Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872900428.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutonomousCar-PT-02a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872900428
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 5.1K Jun 7 15:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Jun 7 15:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 7 15:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K Jun 7 15:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 3 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 3 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 3 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 3 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 7.8K Jun 7 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Jun 7 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 7 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 7 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 23K Jun 3 16:02 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-02a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654898099886

Running Version 202205111006
[2022-06-10 21:55:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 21:55:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 21:55:02] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2022-06-10 21:55:02] [INFO ] Transformed 33 places.
[2022-06-10 21:55:02] [INFO ] Transformed 69 transitions.
[2022-06-10 21:55:02] [INFO ] Found NUPN structural information;
[2022-06-10 21:55:02] [INFO ] Parsed PT model containing 33 places and 69 transitions in 369 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 84 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 23 transitions
Reduce redundant transitions removed 23 transitions.
FORMULA AutonomousCar-PT-02a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 46/46 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 32 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 45
Applied a total of 2 rules in 27 ms. Remains 32 /33 variables (removed 1) and now considering 45/46 (removed 1) transitions.
// Phase 1: matrix 45 rows 32 cols
[2022-06-10 21:55:03] [INFO ] Computed 6 place invariants in 15 ms
[2022-06-10 21:55:03] [INFO ] Implicit Places using invariants in 245 ms returned []
// Phase 1: matrix 45 rows 32 cols
[2022-06-10 21:55:03] [INFO ] Computed 6 place invariants in 7 ms
[2022-06-10 21:55:03] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-10 21:55:03] [INFO ] Implicit Places using invariants and state equation in 157 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 467 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 45/46 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 45/46 transitions.
Support contains 21 out of 30 places after structural reductions.
[2022-06-10 21:55:04] [INFO ] Flatten gal took : 55 ms
[2022-06-10 21:55:04] [INFO ] Flatten gal took : 23 ms
[2022-06-10 21:55:04] [INFO ] Input system was already deterministic with 45 transitions.
Finished random walk after 381 steps, including 24 resets, run visited all 22 properties in 122 ms. (steps per millisecond=3 )
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1)||G(p2)||X(p3))))'
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 42
Applied a total of 2 rules in 4 ms. Remains 29 /30 variables (removed 1) and now considering 42/45 (removed 3) transitions.
// Phase 1: matrix 42 rows 29 cols
[2022-06-10 21:55:05] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:55:05] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 42 rows 29 cols
[2022-06-10 21:55:05] [INFO ] Computed 4 place invariants in 5 ms
[2022-06-10 21:55:05] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-06-10 21:55:05] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 29 cols
[2022-06-10 21:55:05] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 21:55:05] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29/30 places, 42/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/30 places, 42/45 transitions.
Stuttering acceptance computed with spot in 778 ms :[(AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=9 dest: 9}]], initial=2, aps=[p0:(AND (EQ s1 1) (EQ s2 1) (EQ s14 1) (EQ s24 1)), p3:(OR (EQ s11 0) (EQ s15 0) (EQ s25 0)), p1:(EQ s13 1), p2:(OR (EQ s1 0) (EQ s2 0) (EQ s6 0) (EQ s24 ...], 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 603 ms.
Product exploration explored 100000 steps with 33333 reset in 396 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) p2), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))))
Knowledge based reduction with 14 factoid took 396 ms. Reduced automaton from 10 states, 23 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-02a-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-02a-LTLFireability-00 finished in 2506 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X(G(F(p1))))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 45/45 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 41
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 25 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 25 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 24 transition count 40
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 23 transition count 37
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 23 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 22 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 21 transition count 36
Applied a total of 15 rules in 23 ms. Remains 21 /30 variables (removed 9) and now considering 36/45 (removed 9) transitions.
// Phase 1: matrix 36 rows 21 cols
[2022-06-10 21:55:07] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:55:07] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 36 rows 21 cols
[2022-06-10 21:55:07] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-10 21:55:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 21:55:07] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2022-06-10 21:55:07] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 36 rows 21 cols
[2022-06-10 21:55:07] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 21:55:07] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/30 places, 36/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/30 places, 36/45 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s9 0), p1:(EQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4 reset in 401 ms.
Product exploration explored 100000 steps with 5 reset in 169 ms.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 274 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 19 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 323 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 36/36 transitions.
Applied a total of 0 rules in 4 ms. Remains 21 /21 variables (removed 0) and now considering 36/36 (removed 0) transitions.
// Phase 1: matrix 36 rows 21 cols
[2022-06-10 21:55:09] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:55:09] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 36 rows 21 cols
[2022-06-10 21:55:09] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 21:55:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 21:55:09] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2022-06-10 21:55:09] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 36 rows 21 cols
[2022-06-10 21:55:09] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 21:55:09] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 36/36 transitions.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 246 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 140 ms.
Product exploration explored 100000 steps with 1 reset in 151 ms.
Built C files in :
/tmp/ltsmin4304761898634509296
[2022-06-10 21:55:10] [INFO ] Computing symmetric may disable matrix : 36 transitions.
[2022-06-10 21:55:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:55:10] [INFO ] Computing symmetric may enable matrix : 36 transitions.
[2022-06-10 21:55:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:55:10] [INFO ] Computing Do-Not-Accords matrix : 36 transitions.
[2022-06-10 21:55:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:55:10] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4304761898634509296
Running compilation step : cd /tmp/ltsmin4304761898634509296;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 336 ms.
Running link step : cd /tmp/ltsmin4304761898634509296;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin4304761898634509296;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4985991696796401781.hoa' '--buchi-type=spotba'
LTSmin run took 147 ms.
FORMULA AutonomousCar-PT-02a-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-02a-LTLFireability-02 finished in 3803 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p1))||p0)))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 45/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 28 transition count 39
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 28 transition count 39
Applied a total of 4 rules in 2 ms. Remains 28 /30 variables (removed 2) and now considering 39/45 (removed 6) transitions.
// Phase 1: matrix 39 rows 28 cols
[2022-06-10 21:55:11] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:55:11] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 39 rows 28 cols
[2022-06-10 21:55:11] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:55:11] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-06-10 21:55:11] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 39 rows 28 cols
[2022-06-10 21:55:11] [INFO ] Computed 4 place invariants in 8 ms
[2022-06-10 21:55:11] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 28/30 places, 39/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 39/45 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s1 0) (EQ s5 0) (EQ s16 0) (EQ s23 0)), p1:(NEQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-02a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLFireability-03 finished in 281 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 45/45 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 41
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 25 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 24 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9 place count 24 transition count 39
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 23 transition count 39
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 13 place count 21 transition count 33
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 21 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 19 transition count 31
Applied a total of 19 rules in 11 ms. Remains 19 /30 variables (removed 11) and now considering 31/45 (removed 14) transitions.
// Phase 1: matrix 31 rows 19 cols
[2022-06-10 21:55:11] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-10 21:55:11] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 31 rows 19 cols
[2022-06-10 21:55:11] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:55:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:55:11] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2022-06-10 21:55:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 19 cols
[2022-06-10 21:55:11] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:55:11] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/30 places, 31/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/30 places, 31/45 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s14 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 3 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLFireability-05 finished in 234 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 42
Applied a total of 2 rules in 2 ms. Remains 29 /30 variables (removed 1) and now considering 42/45 (removed 3) transitions.
// Phase 1: matrix 42 rows 29 cols
[2022-06-10 21:55:11] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:55:11] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 42 rows 29 cols
[2022-06-10 21:55:11] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:55:11] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-06-10 21:55:11] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 29 cols
[2022-06-10 21:55:11] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:55:11] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29/30 places, 42/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/30 places, 42/45 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s1 0) (EQ s2 0) (EQ s10 0) (EQ s24 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1 reset in 438 ms.
Product exploration explored 100000 steps with 2 reset in 202 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 235 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 31 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 29 cols
[2022-06-10 21:55:13] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:55:13] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 42 rows 29 cols
[2022-06-10 21:55:13] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:55:13] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-06-10 21:55:13] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 29 cols
[2022-06-10 21:55:13] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:55:13] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 42/42 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 228 steps, including 15 resets, run visited all 1 properties in 5 ms. (steps per millisecond=45 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 235 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 17 steps with 1 reset in 1 ms.
FORMULA AutonomousCar-PT-02a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLFireability-06 finished in 2895 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U !(X(p1)||p2)))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 42
Applied a total of 2 rules in 3 ms. Remains 29 /30 variables (removed 1) and now considering 42/45 (removed 3) transitions.
// Phase 1: matrix 42 rows 29 cols
[2022-06-10 21:55:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:55:14] [INFO ] Implicit Places using invariants in 75 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/30 places, 42/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 28/30 places, 42/45 transitions.
Stuttering acceptance computed with spot in 276 ms :[p1, true, (OR p2 p1), (OR (NOT p0) p2 p1)]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}, { cond=(AND p2 p0 p1), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND p2 p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(NEQ s9 1), p0:(NEQ s16 1), p1:(AND (EQ s8 1) (EQ s15 1) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLFireability-07 finished in 388 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||F(p1))))'
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 45/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 28 transition count 39
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 28 transition count 39
Applied a total of 4 rules in 3 ms. Remains 28 /30 variables (removed 2) and now considering 39/45 (removed 6) transitions.
// Phase 1: matrix 39 rows 28 cols
[2022-06-10 21:55:15] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:55:15] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 39 rows 28 cols
[2022-06-10 21:55:15] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 21:55:15] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-06-10 21:55:15] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 39 rows 28 cols
[2022-06-10 21:55:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:55:15] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 28/30 places, 39/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 39/45 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s15 1) (EQ s24 1)), p1:(OR (EQ s1 0) (EQ s2 0) (EQ s6 0) (EQ s23 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 203 ms.
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-02a-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-02a-LTLFireability-08 finished in 855 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(X(p0))))||G(p1))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 42
Applied a total of 2 rules in 3 ms. Remains 29 /30 variables (removed 1) and now considering 42/45 (removed 3) transitions.
// Phase 1: matrix 42 rows 29 cols
[2022-06-10 21:55:15] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:55:15] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 42 rows 29 cols
[2022-06-10 21:55:15] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-10 21:55:16] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-06-10 21:55:16] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 29 cols
[2022-06-10 21:55:16] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:55:16] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29/30 places, 42/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/30 places, 42/45 transitions.
Stuttering acceptance computed with spot in 423 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 7}], [{ cond=p1, acceptance={} source=7 dest: 2}, { cond=(NOT p1), acceptance={} source=7 dest: 4}]], initial=1, aps=[p0:(AND (EQ s1 1) (EQ s2 1) (EQ s16 1) (EQ s24 1)), p1:(EQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLFireability-09 finished in 665 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(G(p0)))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 45/45 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 42
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 27 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 26 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 26 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 25 transition count 40
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 12 place count 23 transition count 34
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 23 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 22 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 21 transition count 33
Applied a total of 18 rules in 28 ms. Remains 21 /30 variables (removed 9) and now considering 33/45 (removed 12) transitions.
// Phase 1: matrix 33 rows 21 cols
[2022-06-10 21:55:16] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:55:16] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 33 rows 21 cols
[2022-06-10 21:55:16] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:55:16] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-06-10 21:55:16] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2022-06-10 21:55:16] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 33 rows 21 cols
[2022-06-10 21:55:16] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:55:16] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/30 places, 33/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/30 places, 33/45 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s2 1) (EQ s14 1) (EQ s17 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-02a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLFireability-10 finished in 354 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X(X(X(G(p0)))))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 45/45 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 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 43
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 28 transition count 43
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 28 transition count 41
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 26 transition count 41
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 24 transition count 35
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 24 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 23 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 22 transition count 34
Applied a total of 16 rules in 37 ms. Remains 22 /30 variables (removed 8) and now considering 34/45 (removed 11) transitions.
// Phase 1: matrix 34 rows 22 cols
[2022-06-10 21:55:16] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:55:17] [INFO ] Implicit Places using invariants in 73 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/30 places, 34/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 21 /21 variables (removed 0) and now considering 34/34 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/30 places, 34/45 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s11 1) (EQ s18 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 6 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLFireability-11 finished in 191 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(X((F(p2)||p1)))||F(p2)))'
Support contains 8 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 30 cols
[2022-06-10 21:55:17] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:55:17] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 45 rows 30 cols
[2022-06-10 21:55:17] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:55:17] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-10 21:55:17] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 30 cols
[2022-06-10 21:55:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:55:17] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 45/45 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (EQ s1 1) (EQ s5 1) (EQ s8 1) (EQ s25 1)), p0:(AND (EQ s1 1) (EQ s2 1) (EQ s15 1) (EQ s25 1) (EQ s11 1)), p1:(OR (EQ s1 0) (EQ s5 0) (EQ s6 0) (EQ...], 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 6 reset in 188 ms.
Product exploration explored 100000 steps with 9 reset in 201 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 906 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Finished random walk after 187 steps, including 13 resets, run visited all 3 properties in 5 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1)))]
False Knowledge obtained : [(F p2), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 16 factoid took 909 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 5 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 30 cols
[2022-06-10 21:55:20] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 21:55:20] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 45 rows 30 cols
[2022-06-10 21:55:20] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:55:20] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-10 21:55:20] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 30 cols
[2022-06-10 21:55:20] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:55:20] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 45/45 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 315 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Finished random walk after 524 steps, including 33 resets, run visited all 3 properties in 8 ms. (steps per millisecond=65 )
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p1 (NOT p2))))]
False Knowledge obtained : [(F p2), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 386 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 5 reset in 163 ms.
Product exploration explored 100000 steps with 7 reset in 171 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 45/45 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 47
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 30 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 29 transition count 44
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 29 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 29 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 28 transition count 43
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 28 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 28 transition count 46
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 11 rules in 13 ms. Remains 28 /30 variables (removed 2) and now considering 46/45 (removed -1) transitions.
[2022-06-10 21:55:22] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 46 rows 28 cols
[2022-06-10 21:55:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:55:22] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/30 places, 46/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 46/45 transitions.
Product exploration explored 100000 steps with 0 reset in 327 ms.
Product exploration explored 100000 steps with 3 reset in 258 ms.
Built C files in :
/tmp/ltsmin4248686493011880683
[2022-06-10 21:55:23] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4248686493011880683
Running compilation step : cd /tmp/ltsmin4248686493011880683;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 252 ms.
Running link step : cd /tmp/ltsmin4248686493011880683;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4248686493011880683;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16369531194510037115.hoa' '--buchi-type=spotba'
LTSmin run took 104 ms.
FORMULA AutonomousCar-PT-02a-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-02a-LTLFireability-12 finished in 6548 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(F(X((G(F(p0))&&p1))))) U X(p2)))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 42
Applied a total of 2 rules in 2 ms. Remains 29 /30 variables (removed 1) and now considering 42/45 (removed 3) transitions.
// Phase 1: matrix 42 rows 29 cols
[2022-06-10 21:55:23] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:55:23] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 42 rows 29 cols
[2022-06-10 21:55:23] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:55:23] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-06-10 21:55:23] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 29 cols
[2022-06-10 21:55:23] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:55:23] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29/30 places, 42/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/30 places, 42/45 transitions.
Stuttering acceptance computed with spot in 358 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-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 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}, { cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(NOT p2), acceptance={0} source=6 dest: 5}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s11 1), p0:(AND (EQ s1 1) (EQ s5 1) (EQ s8 1) (EQ s24 1)), p1:(EQ s7 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, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLFireability-13 finished in 567 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F((p0&&F(G(p1)))))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 45/45 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 41
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 26 transition count 41
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 25 transition count 38
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 25 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 24 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 23 transition count 37
Applied a total of 14 rules in 7 ms. Remains 23 /30 variables (removed 7) and now considering 37/45 (removed 8) transitions.
// Phase 1: matrix 37 rows 23 cols
[2022-06-10 21:55:24] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:55:24] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 37 rows 23 cols
[2022-06-10 21:55:24] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:55:24] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-10 21:55:24] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2022-06-10 21:55:24] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 37 rows 23 cols
[2022-06-10 21:55:24] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:55:24] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 37/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/30 places, 37/45 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s2 1) (EQ s12 1) (EQ s18 1)), p0:(EQ s21 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-02a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLFireability-14 finished in 303 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 45/45 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 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 43
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 28 transition count 43
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 28 transition count 41
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 26 transition count 41
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 24 transition count 35
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 24 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 23 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 22 transition count 34
Applied a total of 16 rules in 11 ms. Remains 22 /30 variables (removed 8) and now considering 34/45 (removed 11) transitions.
// Phase 1: matrix 34 rows 22 cols
[2022-06-10 21:55:24] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:55:24] [INFO ] Implicit Places using invariants in 64 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/30 places, 34/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 34/34 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/30 places, 34/45 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s13 1) (EQ s18 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 16 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLFireability-15 finished in 152 ms.
All properties solved by simple procedures.
Total runtime 22142 ms.

BK_STOP 1654898124880

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-02a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463872900428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-02a.tgz
mv AutonomousCar-PT-02a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;