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-171620180300207.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-08a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180300207
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 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 448K 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-08a-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716312534571

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-08a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 17:28:57] [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 17:28:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 17:28:57] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2024-05-21 17:28:57] [INFO ] Transformed 81 places.
[2024-05-21 17:28:57] [INFO ] Transformed 849 transitions.
[2024-05-21 17:28:57] [INFO ] Found NUPN structural information;
[2024-05-21 17:28:57] [INFO ] Parsed PT model containing 81 places and 849 transitions and 8894 arcs in 338 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 275 transitions
Reduce redundant transitions removed 275 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-08a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-08a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 574/574 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 75 transition count 528
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 75 transition count 528
Applied a total of 12 rules in 57 ms. Remains 75 /81 variables (removed 6) and now considering 528/574 (removed 46) transitions.
// Phase 1: matrix 528 rows 75 cols
[2024-05-21 17:28:57] [INFO ] Computed 12 invariants in 33 ms
[2024-05-21 17:28:58] [INFO ] Implicit Places using invariants in 878 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 924 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/81 places, 528/574 transitions.
Applied a total of 0 rules in 8 ms. Remains 74 /74 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 990 ms. Remains : 74/81 places, 528/574 transitions.
Support contains 17 out of 74 places after structural reductions.
[2024-05-21 17:28:59] [INFO ] Flatten gal took : 193 ms
[2024-05-21 17:28:59] [INFO ] Flatten gal took : 119 ms
[2024-05-21 17:28:59] [INFO ] Input system was already deterministic with 528 transitions.
Incomplete random walk after 10000 steps, including 490 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 528 rows 74 cols
[2024-05-21 17:29:00] [INFO ] Computed 11 invariants in 10 ms
[2024-05-21 17:29:00] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 17:29:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 17:29:00] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 17:29:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 17:29:00] [INFO ] After 46ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 17:29:00] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-21 17:29:00] [INFO ] After 498ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 528/528 transitions.
Graph (complete) has 774 edges and 74 vertex of which 73 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 73 transition count 517
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 20 place count 65 transition count 516
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 64 transition count 516
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 21 place count 64 transition count 515
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 23 place count 63 transition count 515
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 26 place count 60 transition count 488
Iterating global reduction 3 with 3 rules applied. Total rules applied 29 place count 60 transition count 488
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 33 place count 58 transition count 486
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 40 place count 58 transition count 479
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 103 place count 51 transition count 423
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 51 transition count 423
Applied a total of 104 rules in 227 ms. Remains 51 /74 variables (removed 23) and now considering 423/528 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 51/74 places, 423/528 transitions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Finished probabilistic random walk after 425127 steps, run visited all 1 properties in 956 ms. (steps per millisecond=444 )
Probabilistic random walk after 425127 steps, saw 58474 distinct states, run finished after 957 ms. (steps per millisecond=444 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Computed a total of 2 stabilizing places and 2 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' '!(F(G(p0)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 528/528 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 73 transition count 519
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 65 transition count 519
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 63 transition count 501
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 63 transition count 501
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 61 transition count 499
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 60 transition count 499
Applied a total of 26 rules in 92 ms. Remains 60 /74 variables (removed 14) and now considering 499/528 (removed 29) transitions.
// Phase 1: matrix 499 rows 60 cols
[2024-05-21 17:29:02] [INFO ] Computed 11 invariants in 6 ms
[2024-05-21 17:29:02] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-21 17:29:02] [INFO ] Invariant cache hit.
[2024-05-21 17:29:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 17:29:03] [INFO ] Implicit Places using invariants and state equation in 393 ms returned [56, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 642 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/74 places, 499/528 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 58 transition count 498
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 57 transition count 498
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 56 transition count 497
Applied a total of 4 rules in 58 ms. Remains 56 /58 variables (removed 2) and now considering 497/499 (removed 2) transitions.
// Phase 1: matrix 497 rows 56 cols
[2024-05-21 17:29:03] [INFO ] Computed 9 invariants in 8 ms
[2024-05-21 17:29:03] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-21 17:29:03] [INFO ] Invariant cache hit.
[2024-05-21 17:29:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 17:29:03] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/74 places, 497/528 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1390 ms. Remains : 56/74 places, 497/528 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 212 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLCardinality-00 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 s10 0) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-08a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLCardinality-00 finished in 1675 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)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 528/528 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 73 transition count 519
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 65 transition count 519
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 62 transition count 492
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 62 transition count 492
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 60 transition count 490
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 28 place count 59 transition count 490
Applied a total of 28 rules in 55 ms. Remains 59 /74 variables (removed 15) and now considering 490/528 (removed 38) transitions.
// Phase 1: matrix 490 rows 59 cols
[2024-05-21 17:29:04] [INFO ] Computed 11 invariants in 5 ms
[2024-05-21 17:29:04] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-21 17:29:04] [INFO ] Invariant cache hit.
[2024-05-21 17:29:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 17:29:04] [INFO ] Implicit Places using invariants and state equation in 354 ms returned [55, 57]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 566 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/74 places, 490/528 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 57 transition count 489
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 56 transition count 489
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 55 transition count 488
Applied a total of 4 rules in 38 ms. Remains 55 /57 variables (removed 2) and now considering 488/490 (removed 2) transitions.
// Phase 1: matrix 488 rows 55 cols
[2024-05-21 17:29:04] [INFO ] Computed 9 invariants in 4 ms
[2024-05-21 17:29:04] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-21 17:29:04] [INFO ] Invariant cache hit.
[2024-05-21 17:29:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 17:29:05] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/74 places, 488/528 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1215 ms. Remains : 55/74 places, 488/528 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s6 0) (NEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLCardinality-02 finished in 1316 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) U G(p1))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 528/528 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 72 transition count 510
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 72 transition count 510
Applied a total of 4 rules in 7 ms. Remains 72 /74 variables (removed 2) and now considering 510/528 (removed 18) transitions.
// Phase 1: matrix 510 rows 72 cols
[2024-05-21 17:29:05] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 17:29:05] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-21 17:29:05] [INFO ] Invariant cache hit.
[2024-05-21 17:29:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 17:29:06] [INFO ] Implicit Places using invariants and state equation in 348 ms returned [68, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 615 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/74 places, 510/528 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 510/510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 626 ms. Remains : 70/74 places, 510/528 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s52 1), p0:(OR (EQ s60 0) (EQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 519 reset in 329 ms.
Product exploration explored 100000 steps with 563 reset in 223 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 151 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 494 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 510 rows 70 cols
[2024-05-21 17:29:07] [INFO ] Computed 9 invariants in 5 ms
[2024-05-21 17:29:07] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 17:29:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-21 17:29:07] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 17:29:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 17:29:07] [INFO ] After 28ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 17:29:07] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-21 17:29:07] [INFO ] After 336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 510/510 transitions.
Graph (complete) has 744 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 69 transition count 498
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 21 place count 61 transition count 497
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 60 transition count 497
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 22 place count 60 transition count 496
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 24 place count 59 transition count 496
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 25 place count 58 transition count 495
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 58 transition count 495
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 56 transition count 493
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 37 place count 56 transition count 486
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 100 place count 49 transition count 430
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 101 place count 48 transition count 429
Applied a total of 101 rules in 107 ms. Remains 48 /70 variables (removed 22) and now considering 429/510 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 48/70 places, 429/510 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Finished Best-First random walk after 7818 steps, including 27 resets, run visited all 1 properties in 10 ms. (steps per millisecond=781 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) p1))
Knowledge based reduction with 11 factoid took 202 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-08a-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08a-LTLCardinality-06 finished in 2706 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(((X(X(p1))||p0)&&(X(X(p1))||F(p2))))))'
Support contains 6 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 528/528 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 71 transition count 501
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 71 transition count 501
Applied a total of 6 rules in 5 ms. Remains 71 /74 variables (removed 3) and now considering 501/528 (removed 27) transitions.
// Phase 1: matrix 501 rows 71 cols
[2024-05-21 17:29:08] [INFO ] Computed 11 invariants in 14 ms
[2024-05-21 17:29:08] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-21 17:29:08] [INFO ] Invariant cache hit.
[2024-05-21 17:29:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 17:29:08] [INFO ] Implicit Places using invariants and state equation in 358 ms returned [67, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 567 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/74 places, 501/528 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 575 ms. Remains : 69/74 places, 501/528 transitions.
Stuttering acceptance computed with spot in 350 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Running random walk in product with property : AutonomousCar-PT-08a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 5}, { cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s61 0) (EQ s62 1)), p2:(OR (EQ s20 0) (EQ s24 1)), p1:(OR (EQ s45 0) (EQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5608 reset in 830 ms.
Product exploration explored 100000 steps with 5619 reset in 696 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND p0 (NOT p2)))), (X p0), (X p2), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 176 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Incomplete random walk after 10000 steps, including 524 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 501 rows 69 cols
[2024-05-21 17:29:11] [INFO ] Computed 9 invariants in 5 ms
[2024-05-21 17:29:11] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 17:29:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-21 17:29:11] [INFO ] After 295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 17:29:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 17:29:12] [INFO ] After 133ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-21 17:29:12] [INFO ] After 312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 130 ms.
[2024-05-21 17:29:12] [INFO ] After 788ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 52 ms.
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 501/501 transitions.
Graph (complete) has 734 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 68 transition count 492
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 62 transition count 490
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 60 transition count 490
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 60 transition count 489
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 21 place count 59 transition count 489
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 23 place count 58 transition count 488
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 58 transition count 482
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 54 rules applied. Total rules applied 83 place count 52 transition count 434
Applied a total of 83 rules in 65 ms. Remains 52 /69 variables (removed 17) and now considering 434/501 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 52/69 places, 434/501 transitions.
Incomplete random walk after 10000 steps, including 178 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 560949 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :{}
Probabilistic random walk after 560949 steps, saw 84258 distinct states, run finished after 3002 ms. (steps per millisecond=186 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 434 rows 52 cols
[2024-05-21 17:29:16] [INFO ] Computed 10 invariants in 7 ms
[2024-05-21 17:29:16] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 17:29:16] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-21 17:29:16] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 17:29:16] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 17:29:16] [INFO ] After 441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 122 ms.
[2024-05-21 17:29:16] [INFO ] After 615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 60 ms.
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 434/434 transitions.
Applied a total of 0 rules in 17 ms. Remains 52 /52 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 52/52 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 434/434 transitions.
Applied a total of 0 rules in 16 ms. Remains 52 /52 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2024-05-21 17:29:16] [INFO ] Invariant cache hit.
[2024-05-21 17:29:17] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-21 17:29:17] [INFO ] Invariant cache hit.
[2024-05-21 17:29:17] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2024-05-21 17:29:17] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-21 17:29:17] [INFO ] Invariant cache hit.
[2024-05-21 17:29:17] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 979 ms. Remains : 52/52 places, 434/434 transitions.
Applied a total of 0 rules in 16 ms. Remains 52 /52 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-21 17:29:17] [INFO ] Invariant cache hit.
[2024-05-21 17:29:18] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 17:29:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-21 17:29:18] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 13 ms returned sat
[2024-05-21 17:29:18] [INFO ] After 258ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 17:29:18] [INFO ] After 422ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 130 ms.
[2024-05-21 17:29:18] [INFO ] After 613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND p0 (NOT p2)))), (X p0), (X p2), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (AND p0 (NOT p2))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 8 factoid took 332 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 358 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Stuttering acceptance computed with spot in 340 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 501/501 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 69 cols
[2024-05-21 17:29:19] [INFO ] Computed 9 invariants in 3 ms
[2024-05-21 17:29:19] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-21 17:29:19] [INFO ] Invariant cache hit.
[2024-05-21 17:29:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 17:29:20] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2024-05-21 17:29:20] [INFO ] Invariant cache hit.
[2024-05-21 17:29:20] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 913 ms. Remains : 69/69 places, 501/501 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND p0 (NOT p2)))), (X p0), (X p2), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 175 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Incomplete random walk after 10000 steps, including 505 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-21 17:29:21] [INFO ] Invariant cache hit.
[2024-05-21 17:29:21] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 17:29:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-21 17:29:22] [INFO ] After 300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 17:29:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 17:29:22] [INFO ] After 135ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-21 17:29:22] [INFO ] After 308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 132 ms.
[2024-05-21 17:29:22] [INFO ] After 797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 60 ms.
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 501/501 transitions.
Graph (complete) has 734 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 68 transition count 492
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 62 transition count 490
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 60 transition count 490
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 60 transition count 489
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 21 place count 59 transition count 489
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 23 place count 58 transition count 488
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 58 transition count 482
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 54 rules applied. Total rules applied 83 place count 52 transition count 434
Applied a total of 83 rules in 62 ms. Remains 52 /69 variables (removed 17) and now considering 434/501 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 52/69 places, 434/501 transitions.
Incomplete random walk after 10000 steps, including 148 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 580996 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :{}
Probabilistic random walk after 580996 steps, saw 87258 distinct states, run finished after 3003 ms. (steps per millisecond=193 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 434 rows 52 cols
[2024-05-21 17:29:26] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 17:29:26] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 17:29:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-05-21 17:29:26] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 17:29:26] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 17:29:26] [INFO ] After 416ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 124 ms.
[2024-05-21 17:29:26] [INFO ] After 595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 66 ms.
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 434/434 transitions.
Applied a total of 0 rules in 17 ms. Remains 52 /52 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 52/52 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 434/434 transitions.
Applied a total of 0 rules in 16 ms. Remains 52 /52 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2024-05-21 17:29:26] [INFO ] Invariant cache hit.
[2024-05-21 17:29:26] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-21 17:29:26] [INFO ] Invariant cache hit.
[2024-05-21 17:29:27] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2024-05-21 17:29:27] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-21 17:29:27] [INFO ] Invariant cache hit.
[2024-05-21 17:29:27] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 863 ms. Remains : 52/52 places, 434/434 transitions.
Applied a total of 0 rules in 16 ms. Remains 52 /52 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-21 17:29:27] [INFO ] Invariant cache hit.
[2024-05-21 17:29:27] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 17:29:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-21 17:29:27] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 17:29:28] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 17:29:28] [INFO ] After 415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 130 ms.
[2024-05-21 17:29:28] [INFO ] After 600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND p0 (NOT p2)))), (X p0), (X p2), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (AND p0 (NOT p2))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 8 factoid took 372 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 435 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Stuttering acceptance computed with spot in 365 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Stuttering acceptance computed with spot in 427 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Product exploration explored 100000 steps with 5606 reset in 678 ms.
Product exploration explored 100000 steps with 5581 reset in 692 ms.
Applying partial POR strategy [false, false, true, false, false, true, true, true]
Stuttering acceptance computed with spot in 358 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 501/501 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 69 transition count 501
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8 place count 69 transition count 503
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 69 transition count 503
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 69 transition count 503
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 10 rules in 40 ms. Remains 69 /69 variables (removed 0) and now considering 503/501 (removed -2) transitions.
[2024-05-21 17:29:32] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 503 rows 69 cols
[2024-05-21 17:29:32] [INFO ] Computed 9 invariants in 3 ms
[2024-05-21 17:29:32] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/69 places, 503/501 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 381 ms. Remains : 69/69 places, 503/501 transitions.
Built C files in :
/tmp/ltsmin9490551994158772540
[2024-05-21 17:29:32] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9490551994158772540
Running compilation step : cd /tmp/ltsmin9490551994158772540;'/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 2123 ms.
Running link step : cd /tmp/ltsmin9490551994158772540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 228 ms.
Running LTSmin : cd /tmp/ltsmin9490551994158772540;'/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/stateBased1853125688642023753.hoa' '--buchi-type=spotba'
LTSmin run took 1290 ms.
FORMULA AutonomousCar-PT-08a-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-08a-LTLCardinality-11 finished in 27934 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||G(p1))))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 528/528 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 73 transition count 519
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 65 transition count 518
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 64 transition count 518
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 63 transition count 509
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 63 transition count 509
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 24 place count 61 transition count 507
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 60 transition count 507
Applied a total of 26 rules in 54 ms. Remains 60 /74 variables (removed 14) and now considering 507/528 (removed 21) transitions.
// Phase 1: matrix 507 rows 60 cols
[2024-05-21 17:29:36] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 17:29:36] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-21 17:29:36] [INFO ] Invariant cache hit.
[2024-05-21 17:29:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 17:29:36] [INFO ] Implicit Places using invariants and state equation in 342 ms returned [56, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 542 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/74 places, 507/528 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 58 transition count 506
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 57 transition count 506
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 56 transition count 505
Applied a total of 4 rules in 34 ms. Remains 56 /58 variables (removed 2) and now considering 505/507 (removed 2) transitions.
// Phase 1: matrix 505 rows 56 cols
[2024-05-21 17:29:36] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 17:29:36] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-21 17:29:36] [INFO ] Invariant cache hit.
[2024-05-21 17:29:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 17:29:37] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/74 places, 505/528 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1174 ms. Remains : 56/74 places, 505/528 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (NEQ s29 0) (NEQ s16 1)), p0:(AND (NEQ s12 0) (NEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLCardinality-15 finished in 1231 ms.
All properties solved by simple procedures.
Total runtime 40078 ms.

BK_STOP 1716312578400

--------------------
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-08a"
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-08a, 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-171620180300207"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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