Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r043-smll-171620180200142.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is AutonomousCar-PT-01b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180200142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 31K May 18 16:42 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-01b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716305732006

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-01b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 15:35:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 15:35:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:35:35] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-05-21 15:35:35] [INFO ] Transformed 119 places.
[2024-05-21 15:35:35] [INFO ] Transformed 132 transitions.
[2024-05-21 15:35:35] [INFO ] Found NUPN structural information;
[2024-05-21 15:35:35] [INFO ] Parsed PT model containing 119 places and 132 transitions and 339 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutonomousCar-PT-01b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 132/132 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 109 transition count 122
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 109 transition count 122
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 106 transition count 119
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 106 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 105 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 105 transition count 118
Applied a total of 28 rules in 66 ms. Remains 105 /119 variables (removed 14) and now considering 118/132 (removed 14) transitions.
// Phase 1: matrix 118 rows 105 cols
[2024-05-21 15:35:36] [INFO ] Computed 6 invariants in 13 ms
[2024-05-21 15:35:36] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-21 15:35:36] [INFO ] Invariant cache hit.
[2024-05-21 15:35:36] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2024-05-21 15:35:36] [INFO ] Invariant cache hit.
[2024-05-21 15:35:36] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/119 places, 118/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 914 ms. Remains : 105/119 places, 118/132 transitions.
Support contains 28 out of 105 places after structural reductions.
[2024-05-21 15:35:37] [INFO ] Flatten gal took : 63 ms
[2024-05-21 15:35:37] [INFO ] Flatten gal took : 29 ms
[2024-05-21 15:35:37] [INFO ] Input system was already deterministic with 118 transitions.
Support contains 24 out of 105 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 915 ms. (steps per millisecond=10 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 8) seen :0
Finished Best-First random walk after 3642 steps, including 2 resets, run visited all 8 properties in 8 ms. (steps per millisecond=455 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 28 stabilizing places and 29 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&F(p1)))))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 118/118 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 97 transition count 110
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 97 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 96 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 96 transition count 105
Applied a total of 22 rules in 23 ms. Remains 96 /105 variables (removed 9) and now considering 105/118 (removed 13) transitions.
// Phase 1: matrix 105 rows 96 cols
[2024-05-21 15:35:38] [INFO ] Computed 6 invariants in 3 ms
[2024-05-21 15:35:38] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 15:35:38] [INFO ] Invariant cache hit.
[2024-05-21 15:35:39] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-05-21 15:35:39] [INFO ] Invariant cache hit.
[2024-05-21 15:35:39] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/105 places, 105/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 384 ms. Remains : 96/105 places, 105/118 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s57 0), p1:(NEQ s63 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 388 ms.
Product exploration explored 100000 steps with 2 reset in 304 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Computed a total of 24 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 226 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 146 steps, including 3 resets, run visited all 3 properties in 2 ms. (steps per millisecond=73 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 218 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 105/105 transitions.
Applied a total of 0 rules in 8 ms. Remains 96 /96 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2024-05-21 15:35:41] [INFO ] Invariant cache hit.
[2024-05-21 15:35:41] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 15:35:41] [INFO ] Invariant cache hit.
[2024-05-21 15:35:41] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-05-21 15:35:41] [INFO ] Invariant cache hit.
[2024-05-21 15:35:41] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 366 ms. Remains : 96/96 places, 105/105 transitions.
Computed a total of 24 stabilizing places and 25 stable transitions
Computed a total of 24 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 141 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 75 steps, including 1 resets, run visited all 3 properties in 2 ms. (steps per millisecond=37 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 263 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 208 ms.
Product exploration explored 100000 steps with 5 reset in 233 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 105/105 transitions.
Graph (trivial) has 86 edges and 96 vertex of which 4 / 96 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 94 transition count 103
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 41 place count 94 transition count 98
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 41 place count 94 transition count 98
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 49 place count 94 transition count 98
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 77 place count 66 transition count 70
Deduced a syphon composed of 16 places in 1 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 105 place count 66 transition count 70
Performed 26 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 2 with 26 rules applied. Total rules applied 131 place count 66 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 66 transition count 76
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 151 place count 47 transition count 56
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 19 rules applied. Total rules applied 170 place count 47 transition count 56
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 173 place count 47 transition count 53
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 175 place count 45 transition count 51
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 177 place count 45 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 45 transition count 53
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 178 rules in 43 ms. Remains 45 /96 variables (removed 51) and now considering 53/105 (removed 52) transitions.
[2024-05-21 15:35:43] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 53 rows 45 cols
[2024-05-21 15:35:43] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 15:35:44] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/96 places, 53/105 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 45/96 places, 53/105 transitions.
Built C files in :
/tmp/ltsmin14612815302612581746
[2024-05-21 15:35:44] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14612815302612581746
Running compilation step : cd /tmp/ltsmin14612815302612581746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 417 ms.
Running link step : cd /tmp/ltsmin14612815302612581746;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin14612815302612581746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6476473827954113501.hoa' '--buchi-type=spotba'
LTSmin run took 172 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01b-LTLCardinality-00 finished in 5966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 118/118 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 96 transition count 109
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 96 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 95 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 95 transition count 104
Applied a total of 24 rules in 7 ms. Remains 95 /105 variables (removed 10) and now considering 104/118 (removed 14) transitions.
// Phase 1: matrix 104 rows 95 cols
[2024-05-21 15:35:44] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 15:35:44] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 15:35:44] [INFO ] Invariant cache hit.
[2024-05-21 15:35:44] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-05-21 15:35:44] [INFO ] Invariant cache hit.
[2024-05-21 15:35:45] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/105 places, 104/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 377 ms. Remains : 95/105 places, 104/118 transitions.
Stuttering acceptance computed with spot in 330 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-01 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:(NEQ s85 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]]
Product exploration explored 100000 steps with 0 reset in 125 ms.
Product exploration explored 100000 steps with 0 reset in 122 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Computed a total of 24 stabilizing places and 25 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 100 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 104/104 transitions.
Applied a total of 0 rules in 2 ms. Remains 95 /95 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-05-21 15:35:46] [INFO ] Invariant cache hit.
[2024-05-21 15:35:46] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 15:35:46] [INFO ] Invariant cache hit.
[2024-05-21 15:35:46] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2024-05-21 15:35:46] [INFO ] Invariant cache hit.
[2024-05-21 15:35:47] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 389 ms. Remains : 95/95 places, 104/104 transitions.
Computed a total of 24 stabilizing places and 25 stable transitions
Computed a total of 24 stabilizing places and 25 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 216 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=108 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 117 ms.
Product exploration explored 100000 steps with 0 reset in 120 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 104/104 transitions.
Graph (trivial) has 86 edges and 95 vertex of which 4 / 95 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 93 transition count 102
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 40 place count 93 transition count 97
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 40 place count 93 transition count 98
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 93 transition count 98
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 74 place count 67 transition count 72
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 26 rules applied. Total rules applied 100 place count 67 transition count 72
Performed 25 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 125 place count 67 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 127 place count 67 transition count 74
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 146 place count 48 transition count 54
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 19 rules applied. Total rules applied 165 place count 48 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 167 place count 48 transition count 52
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 169 place count 46 transition count 50
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 171 place count 46 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 173 place count 46 transition count 51
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 175 place count 44 transition count 49
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 177 place count 44 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 44 transition count 53
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 178 rules in 41 ms. Remains 44 /95 variables (removed 51) and now considering 53/104 (removed 51) transitions.
[2024-05-21 15:35:48] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 53 rows 44 cols
[2024-05-21 15:35:48] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 15:35:48] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/95 places, 53/104 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 151 ms. Remains : 44/95 places, 53/104 transitions.
Built C files in :
/tmp/ltsmin6458097543800773484
[2024-05-21 15:35:48] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6458097543800773484
Running compilation step : cd /tmp/ltsmin6458097543800773484;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 401 ms.
Running link step : cd /tmp/ltsmin6458097543800773484;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin6458097543800773484;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased949914699627329045.hoa' '--buchi-type=spotba'
LTSmin run took 552 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01b-LTLCardinality-01 finished in 5086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X((X(G(p2))||p1))))))'
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 118/118 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 99 transition count 112
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 99 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 98 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 98 transition count 111
Applied a total of 14 rules in 9 ms. Remains 98 /105 variables (removed 7) and now considering 111/118 (removed 7) transitions.
// Phase 1: matrix 111 rows 98 cols
[2024-05-21 15:35:49] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 15:35:49] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 15:35:49] [INFO ] Invariant cache hit.
[2024-05-21 15:35:49] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-21 15:35:49] [INFO ] Invariant cache hit.
[2024-05-21 15:35:50] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/105 places, 111/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 296 ms. Remains : 98/105 places, 111/118 transitions.
Stuttering acceptance computed with spot in 297 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s28 0) (EQ s30 1)), p2:(AND (EQ s72 0) (EQ s3 1)), p1:(OR (EQ s3 0) (EQ s72 1) (EQ s24 0) (EQ s91 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]]
Product exploration explored 100000 steps with 1 reset in 98 ms.
Product exploration explored 100000 steps with 2 reset in 94 ms.
Computed a total of 25 stabilizing places and 26 stable transitions
Computed a total of 25 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (X (AND p0 p1))), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 125 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[true, (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 15:35:51] [INFO ] Invariant cache hit.
[2024-05-21 15:35:51] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 15:35:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-21 15:35:52] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 15:35:52] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 15 ms to minimize.
[2024-05-21 15:35:52] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:35:52] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-05-21 15:35:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 233 ms
[2024-05-21 15:35:52] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 3 ms to minimize.
[2024-05-21 15:35:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-21 15:35:52] [INFO ] After 412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-21 15:35:52] [INFO ] After 509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 54 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=27 )
Parikh walk visited 3 properties in 8 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (X (AND p0 p1))), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND (NOT p1) p0)), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT p0)), (F (AND p0 p2))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 6 factoid took 211 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-01b-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-01b-LTLCardinality-02 finished in 2842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 118/118 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 96 transition count 109
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 96 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 95 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 95 transition count 104
Applied a total of 24 rules in 5 ms. Remains 95 /105 variables (removed 10) and now considering 104/118 (removed 14) transitions.
// Phase 1: matrix 104 rows 95 cols
[2024-05-21 15:35:52] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 15:35:52] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 15:35:52] [INFO ] Invariant cache hit.
[2024-05-21 15:35:52] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-21 15:35:52] [INFO ] Invariant cache hit.
[2024-05-21 15:35:52] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/105 places, 104/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 269 ms. Remains : 95/105 places, 104/118 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(EQ s82 0)], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 117 ms.
Product exploration explored 100000 steps with 20000 reset in 100 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Computed a total of 24 stabilizing places and 25 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 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 263 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 110396 steps, run visited all 1 properties in 229 ms. (steps per millisecond=482 )
Probabilistic random walk after 110396 steps, saw 20435 distinct states, run finished after 230 ms. (steps per millisecond=479 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 116 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 209 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 104/104 transitions.
Applied a total of 0 rules in 1 ms. Remains 95 /95 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-05-21 15:35:54] [INFO ] Invariant cache hit.
[2024-05-21 15:35:54] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 15:35:54] [INFO ] Invariant cache hit.
[2024-05-21 15:35:54] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-21 15:35:54] [INFO ] Invariant cache hit.
[2024-05-21 15:35:54] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 95/95 places, 104/104 transitions.
Computed a total of 24 stabilizing places and 25 stable transitions
Computed a total of 24 stabilizing places and 25 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 106 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 220 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 110396 steps, run visited all 1 properties in 181 ms. (steps per millisecond=609 )
Probabilistic random walk after 110396 steps, saw 20435 distinct states, run finished after 182 ms. (steps per millisecond=606 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 197 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 251 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 146 ms.
Product exploration explored 100000 steps with 20000 reset in 151 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 104/104 transitions.
Graph (trivial) has 87 edges and 95 vertex of which 4 / 95 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 93 transition count 102
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 41 place count 93 transition count 97
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 41 place count 93 transition count 98
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 50 place count 93 transition count 98
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 78 place count 65 transition count 70
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 106 place count 65 transition count 70
Performed 24 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 130 place count 65 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 132 place count 65 transition count 72
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 149 place count 48 transition count 54
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 17 rules applied. Total rules applied 166 place count 48 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 168 place count 48 transition count 52
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 169 place count 47 transition count 51
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 170 place count 47 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 171 place count 47 transition count 51
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 173 place count 45 transition count 49
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 175 place count 45 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 177 place count 45 transition count 56
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 177 rules in 29 ms. Remains 45 /95 variables (removed 50) and now considering 56/104 (removed 48) transitions.
[2024-05-21 15:35:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 56 rows 45 cols
[2024-05-21 15:35:57] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 15:35:57] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/95 places, 56/104 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 45/95 places, 56/104 transitions.
Built C files in :
/tmp/ltsmin14298745619090598563
[2024-05-21 15:35:57] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14298745619090598563
Running compilation step : cd /tmp/ltsmin14298745619090598563;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 289 ms.
Running link step : cd /tmp/ltsmin14298745619090598563;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin14298745619090598563;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1732511372379208013.hoa' '--buchi-type=spotba'
LTSmin run took 175 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01b-LTLCardinality-03 finished in 4982 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 118/118 transitions.
Graph (trivial) has 94 edges and 105 vertex of which 4 / 105 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 102 transition count 75
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 48 rules applied. Total rules applied 89 place count 62 transition count 67
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 94 place count 58 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 57 transition count 66
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 95 place count 57 transition count 59
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 109 place count 50 transition count 59
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 117 place count 42 transition count 51
Iterating global reduction 4 with 8 rules applied. Total rules applied 125 place count 42 transition count 51
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 129 place count 42 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 129 place count 42 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 131 place count 41 transition count 46
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 133 place count 39 transition count 44
Iterating global reduction 5 with 2 rules applied. Total rules applied 135 place count 39 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 137 place count 39 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 138 place count 38 transition count 42
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 168 place count 23 transition count 26
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 169 place count 22 transition count 24
Iterating global reduction 7 with 1 rules applied. Total rules applied 170 place count 22 transition count 24
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 171 place count 22 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 173 place count 20 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 174 place count 19 transition count 22
Applied a total of 174 rules in 37 ms. Remains 19 /105 variables (removed 86) and now considering 22/118 (removed 96) transitions.
// Phase 1: matrix 22 rows 19 cols
[2024-05-21 15:35:57] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 15:35:57] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 15:35:57] [INFO ] Invariant cache hit.
[2024-05-21 15:35:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:35:57] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [14, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 98 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/105 places, 22/118 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 16 transition count 21
Applied a total of 2 rules in 4 ms. Remains 16 /17 variables (removed 1) and now considering 21/22 (removed 1) transitions.
// Phase 1: matrix 21 rows 16 cols
[2024-05-21 15:35:57] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 15:35:57] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 15:35:57] [INFO ] Invariant cache hit.
[2024-05-21 15:35:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:35:57] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/105 places, 21/118 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 231 ms. Remains : 16/105 places, 21/118 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s6 0) (NEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-04 finished in 295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 118/118 transitions.
Graph (trivial) has 96 edges and 105 vertex of which 4 / 105 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 102 transition count 73
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 53 rules applied. Total rules applied 96 place count 60 transition count 62
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 102 place count 54 transition count 62
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 102 place count 54 transition count 56
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 114 place count 48 transition count 56
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 121 place count 41 transition count 49
Iterating global reduction 3 with 7 rules applied. Total rules applied 128 place count 41 transition count 49
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 132 place count 41 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 132 place count 41 transition count 44
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 134 place count 40 transition count 44
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 135 place count 39 transition count 43
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 39 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 138 place count 39 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 139 place count 38 transition count 41
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 167 place count 24 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 168 place count 24 transition count 25
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 169 place count 23 transition count 23
Iterating global reduction 7 with 1 rules applied. Total rules applied 170 place count 23 transition count 23
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 7 with 2 rules applied. Total rules applied 172 place count 22 transition count 22
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 7 with 2 rules applied. Total rules applied 174 place count 21 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 176 place count 19 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 177 place count 18 transition count 20
Applied a total of 177 rules in 22 ms. Remains 18 /105 variables (removed 87) and now considering 20/118 (removed 98) transitions.
// Phase 1: matrix 20 rows 18 cols
[2024-05-21 15:35:57] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 15:35:57] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 15:35:57] [INFO ] Invariant cache hit.
[2024-05-21 15:35:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:35:58] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 107 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/105 places, 20/118 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 16 transition count 19
Applied a total of 2 rules in 3 ms. Remains 16 /17 variables (removed 1) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 16 cols
[2024-05-21 15:35:58] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 15:35:58] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 15:35:58] [INFO ] Invariant cache hit.
[2024-05-21 15:35:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:35:58] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/105 places, 19/118 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 224 ms. Remains : 16/105 places, 19/118 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s12 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 5 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-06 finished in 279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p1&&X(X(G(!p0))))))))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 118/118 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 98 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 98 transition count 111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 98 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 97 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 97 transition count 106
Applied a total of 20 rules in 6 ms. Remains 97 /105 variables (removed 8) and now considering 106/118 (removed 12) transitions.
// Phase 1: matrix 106 rows 97 cols
[2024-05-21 15:35:58] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 15:35:58] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 15:35:58] [INFO ] Invariant cache hit.
[2024-05-21 15:35:58] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-05-21 15:35:58] [INFO ] Invariant cache hit.
[2024-05-21 15:35:58] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/105 places, 106/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 373 ms. Remains : 97/105 places, 106/118 transitions.
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p1) (NOT p0)), false, false, false, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p1:(EQ s70 1), p0:(NEQ s33 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 149 ms.
Product exploration explored 100000 steps with 1 reset in 289 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Computed a total of 24 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 165 ms. Reduced automaton from 5 states, 17 edges and 2 AP (stutter sensitive) to 5 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :3
Finished Best-First random walk after 530 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=530 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 335 ms. Reduced automaton from 5 states, 17 edges and 2 AP (stutter sensitive) to 5 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 411 ms :[(AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1))]
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 106/106 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2024-05-21 15:36:00] [INFO ] Invariant cache hit.
[2024-05-21 15:36:00] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 15:36:00] [INFO ] Invariant cache hit.
[2024-05-21 15:36:00] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-21 15:36:00] [INFO ] Invariant cache hit.
[2024-05-21 15:36:00] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 97/97 places, 106/106 transitions.
Computed a total of 24 stabilizing places and 25 stable transitions
Computed a total of 24 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 5 states, 17 edges and 2 AP (stutter sensitive) to 5 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 4) seen :3
Finished Best-First random walk after 531 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=531 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 236 ms. Reduced automaton from 5 states, 17 edges and 2 AP (stutter sensitive) to 5 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4 reset in 97 ms.
Product exploration explored 100000 steps with 0 reset in 327 ms.
Built C files in :
/tmp/ltsmin5982955378893167916
[2024-05-21 15:36:02] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5982955378893167916
Running compilation step : cd /tmp/ltsmin5982955378893167916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 268 ms.
Running link step : cd /tmp/ltsmin5982955378893167916;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5982955378893167916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased301510273289966404.hoa' '--buchi-type=spotba'
LTSmin run took 186 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01b-LTLCardinality-07 finished in 4971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 118/118 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 96 transition count 109
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 96 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 95 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 95 transition count 104
Applied a total of 24 rules in 4 ms. Remains 95 /105 variables (removed 10) and now considering 104/118 (removed 14) transitions.
// Phase 1: matrix 104 rows 95 cols
[2024-05-21 15:36:03] [INFO ] Computed 6 invariants in 0 ms
[2024-05-21 15:36:03] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 15:36:03] [INFO ] Invariant cache hit.
[2024-05-21 15:36:03] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-05-21 15:36:03] [INFO ] Invariant cache hit.
[2024-05-21 15:36:03] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/105 places, 104/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 302 ms. Remains : 95/105 places, 104/118 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s0 0) (NEQ s29 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 0 reset in 90 ms.
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-09 finished in 496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 118/118 transitions.
Graph (trivial) has 88 edges and 105 vertex of which 4 / 105 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 102 transition count 78
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 79 place count 65 transition count 74
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 84 place count 63 transition count 71
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 89 place count 60 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 90 place count 59 transition count 69
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 90 place count 59 transition count 62
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 104 place count 52 transition count 62
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 112 place count 44 transition count 54
Iterating global reduction 5 with 8 rules applied. Total rules applied 120 place count 44 transition count 54
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 124 place count 44 transition count 50
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 124 place count 44 transition count 49
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 126 place count 43 transition count 49
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 128 place count 41 transition count 47
Iterating global reduction 6 with 2 rules applied. Total rules applied 130 place count 41 transition count 47
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 156 place count 28 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 157 place count 28 transition count 32
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 158 place count 27 transition count 30
Iterating global reduction 7 with 1 rules applied. Total rules applied 159 place count 27 transition count 30
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 7 with 2 rules applied. Total rules applied 161 place count 26 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 162 place count 26 transition count 28
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 165 place count 26 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 167 place count 24 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 168 place count 23 transition count 26
Applied a total of 168 rules in 23 ms. Remains 23 /105 variables (removed 82) and now considering 26/118 (removed 92) transitions.
// Phase 1: matrix 26 rows 23 cols
[2024-05-21 15:36:03] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 15:36:03] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 15:36:03] [INFO ] Invariant cache hit.
[2024-05-21 15:36:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:36:03] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [18, 22]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 104 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/105 places, 26/118 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 25
Applied a total of 2 rules in 2 ms. Remains 20 /21 variables (removed 1) and now considering 25/26 (removed 1) transitions.
// Phase 1: matrix 25 rows 20 cols
[2024-05-21 15:36:03] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 15:36:03] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-21 15:36:03] [INFO ] Invariant cache hit.
[2024-05-21 15:36:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:36:03] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/105 places, 25/118 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 219 ms. Remains : 20/105 places, 25/118 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s13 0) (EQ s1 1)), p1:(OR (EQ s7 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 102 ms.
Product exploration explored 100000 steps with 5 reset in 90 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 49 steps, including 6 resets, run visited all 2 properties in 1 ms. (steps per millisecond=49 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 249 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-21 15:36:05] [INFO ] Invariant cache hit.
[2024-05-21 15:36:05] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-21 15:36:05] [INFO ] Invariant cache hit.
[2024-05-21 15:36:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:36:05] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-21 15:36:05] [INFO ] Redundant transitions in 17 ms returned [18]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 24 rows 20 cols
[2024-05-21 15:36:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 15:36:05] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/20 places, 24/25 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 22
Applied a total of 2 rules in 4 ms. Remains 18 /20 variables (removed 2) and now considering 22/24 (removed 2) transitions.
// Phase 1: matrix 22 rows 18 cols
[2024-05-21 15:36:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 15:36:05] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 15:36:05] [INFO ] Invariant cache hit.
[2024-05-21 15:36:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:36:05] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/20 places, 22/25 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 243 ms. Remains : 18/20 places, 22/25 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 271 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 21 steps, including 1 resets, run visited all 2 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 3 reset in 81 ms.
Stuttering criterion allowed to conclude after 21 steps with 4 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-11 finished in 2783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(F(p0)) U !p1)))))'
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 118/118 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 97 transition count 110
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 97 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 97 transition count 106
Applied a total of 20 rules in 3 ms. Remains 97 /105 variables (removed 8) and now considering 106/118 (removed 12) transitions.
// Phase 1: matrix 106 rows 97 cols
[2024-05-21 15:36:06] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 15:36:06] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 15:36:06] [INFO ] Invariant cache hit.
[2024-05-21 15:36:06] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-21 15:36:06] [INFO ] Invariant cache hit.
[2024-05-21 15:36:06] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/105 places, 106/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 342 ms. Remains : 97/105 places, 106/118 transitions.
Stuttering acceptance computed with spot in 284 ms :[p1, p1, p1, (NOT p0), (NOT p0), p1]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=p1, acceptance={0} source=5 dest: 4}, { cond=p1, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s58 0) (EQ s70 1)), p0:(AND (NOT (OR (EQ s45 0) (EQ s68 1))) (OR (EQ s25 0) (EQ s33 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-13 finished in 652 ms.
All properties solved by simple procedures.
Total runtime 31694 ms.

BK_STOP 1716305768255

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-01b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is AutonomousCar-PT-01b, 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 r043-smll-171620180200142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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