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.r468-smll-171620167300251.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 ltsminxred
Input is AutonomousCar-PT-03a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167300251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 42K 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-03a-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717210294860

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-03a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:51:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 02:51:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:51:38] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2024-06-01 02:51:38] [INFO ] Transformed 41 places.
[2024-06-01 02:51:38] [INFO ] Transformed 121 transitions.
[2024-06-01 02:51:38] [INFO ] Found NUPN structural information;
[2024-06-01 02:51:38] [INFO ] Parsed PT model containing 41 places and 121 transitions and 745 arcs in 382 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA AutonomousCar-PT-03a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 76/76 transitions.
Applied a total of 0 rules in 23 ms. Remains 41 /41 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-06-01 02:51:38] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
// Phase 1: matrix 75 rows 41 cols
[2024-06-01 02:51:38] [INFO ] Computed 8 invariants in 20 ms
[2024-06-01 02:51:38] [INFO ] Implicit Places using invariants in 428 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 500 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 40/41 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 563 ms. Remains : 40/41 places, 76/76 transitions.
Support contains 22 out of 40 places after structural reductions.
[2024-06-01 02:51:39] [INFO ] Flatten gal took : 70 ms
[2024-06-01 02:51:39] [INFO ] Flatten gal took : 30 ms
[2024-06-01 02:51:39] [INFO ] Input system was already deterministic with 76 transitions.
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 1161 steps (64 resets) in 272 ms. (4 steps per ms) remains 0/18 properties
FORMULA AutonomousCar-PT-03a-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 36 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 36 transition count 63
Applied a total of 8 rules in 18 ms. Remains 36 /40 variables (removed 4) and now considering 63/76 (removed 13) transitions.
// Phase 1: matrix 63 rows 36 cols
[2024-06-01 02:51:40] [INFO ] Computed 6 invariants in 4 ms
[2024-06-01 02:51:40] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 02:51:40] [INFO ] Invariant cache hit.
[2024-06-01 02:51:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:51:40] [INFO ] Implicit Places using invariants and state equation in 164 ms returned [32, 34]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 282 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 34/40 places, 63/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 34 /34 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 304 ms. Remains : 34/40 places, 63/76 transitions.
Stuttering acceptance computed with spot in 421 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-01 finished in 846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(X(F(p0))))&&G(p1)))))'
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 37 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 37 transition count 67
Applied a total of 6 rules in 5 ms. Remains 37 /40 variables (removed 3) and now considering 67/76 (removed 9) transitions.
// Phase 1: matrix 67 rows 37 cols
[2024-06-01 02:51:40] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 02:51:40] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 02:51:40] [INFO ] Invariant cache hit.
[2024-06-01 02:51:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:51:41] [INFO ] Implicit Places using invariants and state equation in 150 ms returned [33, 35]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 236 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/40 places, 67/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 242 ms. Remains : 35/40 places, 67/76 transitions.
Stuttering acceptance computed with spot in 500 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-03 finished in 772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(p1))))))'
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 37 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 37 transition count 67
Applied a total of 6 rules in 4 ms. Remains 37 /40 variables (removed 3) and now considering 67/76 (removed 9) transitions.
[2024-06-01 02:51:41] [INFO ] Invariant cache hit.
[2024-06-01 02:51:41] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 02:51:41] [INFO ] Invariant cache hit.
[2024-06-01 02:51:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:51:41] [INFO ] Implicit Places using invariants and state equation in 128 ms returned [33, 35]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 216 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/40 places, 67/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 223 ms. Remains : 35/40 places, 67/76 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-04
Product exploration explored 100000 steps with 25000 reset in 568 ms.
Product exploration explored 100000 steps with 25000 reset in 254 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 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
RANDOM walk for 1119 steps (70 resets) in 34 ms. (31 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 240 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 67/67 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 35 cols
[2024-06-01 02:51:43] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 02:51:44] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 02:51:44] [INFO ] Invariant cache hit.
[2024-06-01 02:51:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:51:44] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-06-01 02:51:44] [INFO ] Invariant cache hit.
[2024-06-01 02:51:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 66/101 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-01 02:51:45] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 1/102 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/102 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 41 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2151 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 66/101 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 66/106 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-01 02:51:47] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 1/102 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 108 constraints, problems are : Problem set: 0 solved, 66 unsolved in 3304 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 2/2 constraints]
After SMT, in 5667ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 5684ms
Finished structural reductions in LTL mode , in 1 iterations and 5889 ms. Remains : 35/35 places, 67/67 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 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
RANDOM walk for 2497 steps (133 resets) in 109 ms. (22 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 246 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 263 ms.
Product exploration explored 100000 steps with 25000 reset in 267 ms.
Support contains 4 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 67/67 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2024-06-01 02:51:52] [INFO ] Invariant cache hit.
[2024-06-01 02:51:52] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 02:51:52] [INFO ] Invariant cache hit.
[2024-06-01 02:51:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:51:52] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-06-01 02:51:52] [INFO ] Invariant cache hit.
[2024-06-01 02:51:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 66/101 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-01 02:51:53] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 1/102 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/102 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 41 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2128 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 66/101 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 66/106 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-01 02:51:55] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 1/102 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 108 constraints, problems are : Problem set: 0 solved, 66 unsolved in 3284 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 2/2 constraints]
After SMT, in 5529ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 5533ms
Finished structural reductions in LTL mode , in 1 iterations and 5723 ms. Remains : 35/35 places, 67/67 transitions.
Treatment of property AutonomousCar-PT-03a-LTLCardinality-04 finished in 16454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 36 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 36 transition count 63
Applied a total of 8 rules in 3 ms. Remains 36 /40 variables (removed 4) and now considering 63/76 (removed 13) transitions.
// Phase 1: matrix 63 rows 36 cols
[2024-06-01 02:51:58] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 02:51:58] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 02:51:58] [INFO ] Invariant cache hit.
[2024-06-01 02:51:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:51:58] [INFO ] Implicit Places using invariants and state equation in 120 ms returned [32, 34]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 203 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 34/40 places, 63/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 207 ms. Remains : 34/40 places, 63/76 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-05
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-05 finished in 327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(p1))))'
Support contains 3 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 37 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 37 transition count 67
Applied a total of 6 rules in 3 ms. Remains 37 /40 variables (removed 3) and now considering 67/76 (removed 9) transitions.
// Phase 1: matrix 67 rows 37 cols
[2024-06-01 02:51:58] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 02:51:58] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 02:51:58] [INFO ] Invariant cache hit.
[2024-06-01 02:51:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:51:58] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [33, 35]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 162 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/40 places, 67/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 166 ms. Remains : 35/40 places, 67/76 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 127 steps with 8 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-07 finished in 361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 36 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 36 transition count 63
Applied a total of 8 rules in 5 ms. Remains 36 /40 variables (removed 4) and now considering 63/76 (removed 13) transitions.
// Phase 1: matrix 63 rows 36 cols
[2024-06-01 02:51:58] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 02:51:58] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 02:51:58] [INFO ] Invariant cache hit.
[2024-06-01 02:51:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:51:58] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [32, 34]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 158 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 34/40 places, 63/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 34/40 places, 63/76 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-08 finished in 352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p0))))))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 37 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 37 transition count 64
Applied a total of 6 rules in 3 ms. Remains 37 /40 variables (removed 3) and now considering 64/76 (removed 12) transitions.
[2024-06-01 02:51:59] [INFO ] Flow matrix only has 63 transitions (discarded 1 similar events)
// Phase 1: matrix 63 rows 37 cols
[2024-06-01 02:51:59] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 02:51:59] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 02:51:59] [INFO ] Flow matrix only has 63 transitions (discarded 1 similar events)
[2024-06-01 02:51:59] [INFO ] Invariant cache hit.
[2024-06-01 02:51:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:51:59] [INFO ] Implicit Places using invariants and state equation in 97 ms returned [32, 35]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 160 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/40 places, 64/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 35/40 places, 64/76 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-11
Product exploration explored 100000 steps with 1 reset in 183 ms.
Product exploration explored 100000 steps with 7 reset in 169 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 2295 steps (145 resets) in 21 ms. (104 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 02:52:00] [INFO ] Flow matrix only has 63 transitions (discarded 1 similar events)
// Phase 1: matrix 63 rows 35 cols
[2024-06-01 02:52:00] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:52:00] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 02:52:00] [INFO ] Flow matrix only has 63 transitions (discarded 1 similar events)
[2024-06-01 02:52:00] [INFO ] Invariant cache hit.
[2024-06-01 02:52:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:52:00] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-06-01 02:52:00] [INFO ] Flow matrix only has 63 transitions (discarded 1 similar events)
[2024-06-01 02:52:00] [INFO ] Invariant cache hit.
[2024-06-01 02:52:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-06-01 02:52:01] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
[2024-06-01 02:52:01] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 02:52:01] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 62/97 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 1/98 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 44 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1967 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 62/97 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 63/106 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 1/98 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 107 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2786 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 3/3 constraints]
After SMT, in 4816ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 4818ms
Finished structural reductions in LTL mode , in 1 iterations and 4986 ms. Remains : 35/35 places, 64/64 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1736 steps (102 resets) in 14 ms. (115 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 92 ms.
Product exploration explored 100000 steps with 3 reset in 476 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 64/64 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 35 transition count 64
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 35 transition count 66
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 35 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 35 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 34 transition count 65
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 34 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 34 transition count 68
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 11 rules in 38 ms. Remains 34 /35 variables (removed 1) and now considering 68/64 (removed -4) transitions.
[2024-06-01 02:52:07] [INFO ] Redundant transitions in 3 ms returned []
Running 67 sub problems to find dead transitions.
[2024-06-01 02:52:07] [INFO ] Flow matrix only has 67 transitions (discarded 1 similar events)
// Phase 1: matrix 67 rows 34 cols
[2024-06-01 02:52:07] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 02:52:07] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-06-01 02:52:08] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 02:52:08] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 02:52:08] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 02:52:08] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-01 02:52:08] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-06-01 02:52:08] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 02:52:08] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD32 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 7/12 constraints. Problems are: Problem set: 8 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/12 constraints. Problems are: Problem set: 8 solved, 59 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
At refinement iteration 4 (OVERLAPS) 66/100 variables, 34/46 constraints. Problems are: Problem set: 12 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 1/47 constraints. Problems are: Problem set: 12 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/47 constraints. Problems are: Problem set: 12 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 1/101 variables, 1/48 constraints. Problems are: Problem set: 12 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/48 constraints. Problems are: Problem set: 12 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 0/101 variables, 0/48 constraints. Problems are: Problem set: 12 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 48 constraints, problems are : Problem set: 12 solved, 55 unsolved in 2320 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 34/34 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 12 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 5/5 constraints. Problems are: Problem set: 12 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 7/12 constraints. Problems are: Problem set: 12 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 12 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 65/98 variables, 33/45 constraints. Problems are: Problem set: 12 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 1/46 constraints. Problems are: Problem set: 12 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 55/101 constraints. Problems are: Problem set: 12 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/101 constraints. Problems are: Problem set: 12 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 2/100 variables, 1/102 constraints. Problems are: Problem set: 12 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/102 constraints. Problems are: Problem set: 12 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 1/101 variables, 1/103 constraints. Problems are: Problem set: 12 solved, 55 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/101 variables, 0/103 constraints. Problems are: Problem set: 12 solved, 55 unsolved
At refinement iteration 12 (OVERLAPS) 0/101 variables, 0/103 constraints. Problems are: Problem set: 12 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 103 constraints, problems are : Problem set: 12 solved, 55 unsolved in 2973 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 34/34 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 55/67 constraints, Known Traps: 7/7 constraints]
After SMT, in 5401ms problems are : Problem set: 12 solved, 55 unsolved
Search for dead transitions found 12 dead transitions in 5404ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 34/35 places, 56/64 transitions.
Graph (complete) has 152 edges and 34 vertex of which 26 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 26 /34 variables (removed 8) and now considering 56/56 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/35 places, 56/64 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5473 ms. Remains : 26/35 places, 56/64 transitions.
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 02:52:12] [INFO ] Flow matrix only has 63 transitions (discarded 1 similar events)
// Phase 1: matrix 63 rows 35 cols
[2024-06-01 02:52:12] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:52:13] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 02:52:13] [INFO ] Flow matrix only has 63 transitions (discarded 1 similar events)
[2024-06-01 02:52:13] [INFO ] Invariant cache hit.
[2024-06-01 02:52:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:52:13] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-06-01 02:52:13] [INFO ] Flow matrix only has 63 transitions (discarded 1 similar events)
[2024-06-01 02:52:13] [INFO ] Invariant cache hit.
[2024-06-01 02:52:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-06-01 02:52:13] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 2 ms to minimize.
[2024-06-01 02:52:13] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 02:52:13] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 62/97 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 1/98 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 44 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1808 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 62/97 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 63/106 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 1/98 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 107 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 3/3 constraints]
After SMT, in 3875ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 3876ms
Finished structural reductions in LTL mode , in 1 iterations and 4029 ms. Remains : 35/35 places, 64/64 transitions.
Treatment of property AutonomousCar-PT-03a-LTLCardinality-11 finished in 17939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0) U (F(p1)||X(p2))))))'
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 40 transition count 73
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 37 transition count 73
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 9 place count 34 transition count 64
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 34 transition count 64
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 2 with 2 rules applied. Total rules applied 14 place count 33 transition count 63
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 32 transition count 63
Applied a total of 16 rules in 22 ms. Remains 32 /40 variables (removed 8) and now considering 63/76 (removed 13) transitions.
// Phase 1: matrix 63 rows 32 cols
[2024-06-01 02:52:17] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 02:52:17] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 02:52:17] [INFO ] Invariant cache hit.
[2024-06-01 02:52:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:52:17] [INFO ] Implicit Places using invariants and state equation in 82 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 133 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/40 places, 63/76 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 30 transition count 62
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 29 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 28 transition count 61
Applied a total of 4 rules in 9 ms. Remains 28 /30 variables (removed 2) and now considering 61/63 (removed 2) transitions.
// Phase 1: matrix 61 rows 28 cols
[2024-06-01 02:52:17] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 02:52:17] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 02:52:17] [INFO ] Invariant cache hit.
[2024-06-01 02:52:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 02:52:17] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/40 places, 61/76 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 286 ms. Remains : 28/40 places, 61/76 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-12
Product exploration explored 100000 steps with 11 reset in 374 ms.
Product exploration explored 100000 steps with 4 reset in 490 ms.
Computed a total of 4 stabilizing places and 6 stable transitions
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 159 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false]
RANDOM walk for 40000 steps (3019 resets) in 195 ms. (204 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (477 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
[2024-06-01 02:52:18] [INFO ] Invariant cache hit.
[2024-06-01 02:52:18] [INFO ] State equation strengthened by 2 read => feed constraints.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 4/89 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 0/4 constraints, State Equation: 0/28 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 19ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (G (OR p2 p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p2) p1))), (F (NOT p1)), (F (NOT (AND (OR (NOT p2) p1) (OR (NOT p0) p1)))), (F (NOT p2)), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 14 factoid took 505 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 61/61 transitions.
Applied a total of 0 rules in 5 ms. Remains 28 /28 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-06-01 02:52:19] [INFO ] Invariant cache hit.
[2024-06-01 02:52:19] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 02:52:19] [INFO ] Invariant cache hit.
[2024-06-01 02:52:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 02:52:19] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-06-01 02:52:19] [INFO ] Redundant transitions in 20 ms returned []
Running 60 sub problems to find dead transitions.
[2024-06-01 02:52:19] [INFO ] Invariant cache hit.
[2024-06-01 02:52:19] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 60/88 variables, 28/32 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/89 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/89 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 34 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1676 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 28/28 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 60/88 variables, 28/32 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 60/93 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/89 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/89 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 94 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2713 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 28/28 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 4480ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4485ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4672 ms. Remains : 28/28 places, 61/61 transitions.
Computed a total of 4 stabilizing places and 6 stable transitions
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p2 p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 164 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 133 steps (11 resets) in 5 ms. (22 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 7 factoid took 254 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 6 reset in 98 ms.
Product exploration explored 100000 steps with 48 reset in 97 ms.
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 61/61 transitions.
Applied a total of 0 rules in 5 ms. Remains 28 /28 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-06-01 02:52:25] [INFO ] Invariant cache hit.
[2024-06-01 02:52:25] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 02:52:25] [INFO ] Invariant cache hit.
[2024-06-01 02:52:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 02:52:25] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-06-01 02:52:25] [INFO ] Redundant transitions in 17 ms returned []
Running 60 sub problems to find dead transitions.
[2024-06-01 02:52:25] [INFO ] Invariant cache hit.
[2024-06-01 02:52:25] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 60/88 variables, 28/32 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/89 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/89 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 34 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1530 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 28/28 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 60/88 variables, 28/32 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 60/93 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/89 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/89 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 94 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2937 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 28/28 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 4515ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4517ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4691 ms. Remains : 28/28 places, 61/61 transitions.
Treatment of property AutonomousCar-PT-03a-LTLCardinality-12 finished in 13047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 36 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 36 transition count 63
Applied a total of 8 rules in 3 ms. Remains 36 /40 variables (removed 4) and now considering 63/76 (removed 13) transitions.
// Phase 1: matrix 63 rows 36 cols
[2024-06-01 02:52:30] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 02:52:30] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 02:52:30] [INFO ] Invariant cache hit.
[2024-06-01 02:52:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:52:30] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 195 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/40 places, 63/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 200 ms. Remains : 35/40 places, 63/76 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 79 steps with 5 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-13 finished in 349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 39 transition count 71
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 35 transition count 71
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 31 transition count 58
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 31 transition count 58
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 20 place count 29 transition count 56
Applied a total of 20 rules in 15 ms. Remains 29 /40 variables (removed 11) and now considering 56/76 (removed 20) transitions.
// Phase 1: matrix 56 rows 29 cols
[2024-06-01 02:52:30] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 02:52:30] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 02:52:30] [INFO ] Invariant cache hit.
[2024-06-01 02:52:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:52:30] [INFO ] Implicit Places using invariants and state equation in 90 ms returned [25, 27]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 164 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/40 places, 56/76 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 27 transition count 55
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 26 transition count 55
Applied a total of 2 rules in 6 ms. Remains 26 /27 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 26 cols
[2024-06-01 02:52:30] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 02:52:30] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 02:52:30] [INFO ] Invariant cache hit.
[2024-06-01 02:52:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:52:30] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/40 places, 55/76 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 349 ms. Remains : 26/40 places, 55/76 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 76 ms.
Product exploration explored 100000 steps with 9 reset in 94 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
RANDOM walk for 263 steps (17 resets) in 6 ms. (37 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 55/55 transitions.
Applied a total of 0 rules in 4 ms. Remains 26 /26 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2024-06-01 02:52:31] [INFO ] Invariant cache hit.
[2024-06-01 02:52:31] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 02:52:31] [INFO ] Invariant cache hit.
[2024-06-01 02:52:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:52:31] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-06-01 02:52:31] [INFO ] Redundant transitions in 1 ms returned []
Running 54 sub problems to find dead transitions.
[2024-06-01 02:52:31] [INFO ] Invariant cache hit.
[2024-06-01 02:52:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 54/80 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 02:52:32] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
[2024-06-01 02:52:32] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 1/81 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 33 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1569 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 54/80 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 54/86 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 1/81 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 87 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1445 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 2/2 constraints]
After SMT, in 3075ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 3077ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3251 ms. Remains : 26/26 places, 55/55 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 338 steps (32 resets) in 7 ms. (42 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 91 ms.
Product exploration explored 100000 steps with 0 reset in 101 ms.
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 55/55 transitions.
Applied a total of 0 rules in 12 ms. Remains 26 /26 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2024-06-01 02:52:35] [INFO ] Invariant cache hit.
[2024-06-01 02:52:35] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 02:52:35] [INFO ] Invariant cache hit.
[2024-06-01 02:52:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:52:35] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-06-01 02:52:35] [INFO ] Redundant transitions in 2 ms returned []
Running 54 sub problems to find dead transitions.
[2024-06-01 02:52:35] [INFO ] Invariant cache hit.
[2024-06-01 02:52:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 54/80 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 02:52:35] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
[2024-06-01 02:52:35] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 1/81 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 33 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1458 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 54/80 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 54/86 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 1/81 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 87 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1927 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 2/2 constraints]
After SMT, in 3443ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 3444ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3607 ms. Remains : 26/26 places, 55/55 transitions.
Treatment of property AutonomousCar-PT-03a-LTLCardinality-14 finished in 8425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(p1))))))'
Found a Shortening insensitive property : AutonomousCar-PT-03a-LTLCardinality-04
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 40 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 38 transition count 74
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 35 transition count 65
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 35 transition count 65
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 34 transition count 64
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 33 transition count 64
Applied a total of 14 rules in 13 ms. Remains 33 /40 variables (removed 7) and now considering 64/76 (removed 12) transitions.
// Phase 1: matrix 64 rows 33 cols
[2024-06-01 02:52:39] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 02:52:39] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 02:52:39] [INFO ] Invariant cache hit.
[2024-06-01 02:52:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:52:39] [INFO ] Implicit Places using invariants and state equation in 96 ms returned [29, 31]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 167 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 31/40 places, 64/76 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 31 transition count 63
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 30 transition count 63
Applied a total of 2 rules in 5 ms. Remains 30 /31 variables (removed 1) and now considering 63/64 (removed 1) transitions.
// Phase 1: matrix 63 rows 30 cols
[2024-06-01 02:52:39] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 02:52:39] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 02:52:39] [INFO ] Invariant cache hit.
[2024-06-01 02:52:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:52:39] [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.
Starting structural reductions in LI_LTL mode, iteration 2 : 30/40 places, 63/76 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 338 ms. Remains : 30/40 places, 63/76 transitions.
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-04
Product exploration explored 100000 steps with 25000 reset in 322 ms.
Product exploration explored 100000 steps with 25000 reset in 390 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
RANDOM walk for 1608 steps (102 resets) in 10 ms. (146 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 231 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 63/63 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-06-01 02:52:41] [INFO ] Invariant cache hit.
[2024-06-01 02:52:41] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 02:52:41] [INFO ] Invariant cache hit.
[2024-06-01 02:52:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:52:41] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2024-06-01 02:52:41] [INFO ] Invariant cache hit.
[2024-06-01 02:52:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 62/92 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-06-01 02:52:42] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-06-01 02:52:42] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 02:52:42] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 1/93 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/93 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 38 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1933 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 62/92 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 62/99 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 1/93 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (OVERLAPS) 0/93 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 100 constraints, problems are : Problem set: 0 solved, 62 unsolved in 2445 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 3/3 constraints]
After SMT, in 4458ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 4460ms
Finished structural reductions in LTL mode , in 1 iterations and 4609 ms. Remains : 30/30 places, 63/63 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
RANDOM walk for 1543 steps (82 resets) in 12 ms. (118 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 219 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 244 ms.
Product exploration explored 100000 steps with 25000 reset in 272 ms.
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-06-01 02:52:47] [INFO ] Invariant cache hit.
[2024-06-01 02:52:47] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-01 02:52:47] [INFO ] Invariant cache hit.
[2024-06-01 02:52:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:52:47] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2024-06-01 02:52:47] [INFO ] Invariant cache hit.
[2024-06-01 02:52:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 62/92 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-06-01 02:52:48] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-01 02:52:48] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 02:52:48] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 1/93 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/93 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 38 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1777 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 62/92 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 62/99 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 1/93 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (OVERLAPS) 0/93 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 100 constraints, problems are : Problem set: 0 solved, 62 unsolved in 2465 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 3/3 constraints]
After SMT, in 4308ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 4309ms
Finished structural reductions in LTL mode , in 1 iterations and 4469 ms. Remains : 30/30 places, 63/63 transitions.
Treatment of property AutonomousCar-PT-03a-LTLCardinality-04 finished in 13417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p0))))))'
Found a Lengthening insensitive property : AutonomousCar-PT-03a-LTLCardinality-11
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 39 transition count 71
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 35 transition count 71
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 32 transition count 59
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 32 transition count 59
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 18 place count 30 transition count 57
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 20 place count 29 transition count 57
Applied a total of 20 rules in 12 ms. Remains 29 /40 variables (removed 11) and now considering 57/76 (removed 19) transitions.
[2024-06-01 02:52:52] [INFO ] Flow matrix only has 56 transitions (discarded 1 similar events)
// Phase 1: matrix 56 rows 29 cols
[2024-06-01 02:52:52] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 02:52:52] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 02:52:52] [INFO ] Flow matrix only has 56 transitions (discarded 1 similar events)
[2024-06-01 02:52:52] [INFO ] Invariant cache hit.
[2024-06-01 02:52:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:52:52] [INFO ] Implicit Places using invariants and state equation in 90 ms returned [24, 27]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 163 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 27/40 places, 57/76 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 27 transition count 56
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 26 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 25 transition count 55
Applied a total of 4 rules in 5 ms. Remains 25 /27 variables (removed 2) and now considering 55/57 (removed 2) transitions.
[2024-06-01 02:52:52] [INFO ] Flow matrix only has 54 transitions (discarded 1 similar events)
// Phase 1: matrix 54 rows 25 cols
[2024-06-01 02:52:52] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:52:52] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 02:52:52] [INFO ] Flow matrix only has 54 transitions (discarded 1 similar events)
[2024-06-01 02:52:52] [INFO ] Invariant cache hit.
[2024-06-01 02:52:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 02:52:52] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 25/40 places, 55/76 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 332 ms. Remains : 25/40 places, 55/76 transitions.
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-11
Product exploration explored 100000 steps with 7 reset in 83 ms.
Product exploration explored 100000 steps with 4 reset in 89 ms.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1249 steps (129 resets) in 8 ms. (138 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2024-06-01 02:52:53] [INFO ] Flow matrix only has 54 transitions (discarded 1 similar events)
[2024-06-01 02:52:53] [INFO ] Invariant cache hit.
[2024-06-01 02:52:53] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 02:52:53] [INFO ] Flow matrix only has 54 transitions (discarded 1 similar events)
[2024-06-01 02:52:53] [INFO ] Invariant cache hit.
[2024-06-01 02:52:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 02:52:54] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-06-01 02:52:54] [INFO ] Flow matrix only has 54 transitions (discarded 1 similar events)
[2024-06-01 02:52:54] [INFO ] Invariant cache hit.
[2024-06-01 02:52:54] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 02:52:54] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 02:52:54] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 53/78 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 1/79 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 34 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1496 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 53/78 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 54/87 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 1/79 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 88 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1963 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 2/2 constraints]
After SMT, in 3516ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 3519ms
Finished structural reductions in LTL mode , in 1 iterations and 3665 ms. Remains : 25/25 places, 55/55 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1543 steps (147 resets) in 15 ms. (96 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 0 ms.
Treatment of property AutonomousCar-PT-03a-LTLCardinality-11 finished in 6301 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-11 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0) U (F(p1)||X(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-06-01 02:52:58] [INFO ] Flatten gal took : 19 ms
[2024-06-01 02:52:58] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 02:52:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 40 places, 76 transitions and 362 arcs took 9 ms.
Total runtime 81413 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutonomousCar-PT-03a-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-03a-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-03a-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-03a-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717210379671

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutonomousCar-PT-03a-LTLCardinality-04
ltl formula formula --ltl=/tmp/1861/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 40 places, 76 transitions and 362 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1861/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1861/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1861/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1861/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 42 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 41, there are 108 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 15
pnml2lts-mc( 0/ 4): unique states count: 15
pnml2lts-mc( 0/ 4): unique transitions count: 14
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 26
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 28
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 28 states 60 transitions, fanout: 2.143
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 37.3 B/state, compr.: 22.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 76 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-03a-LTLCardinality-11
ltl formula formula --ltl=/tmp/1861/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 40 places, 76 transitions and 362 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1861/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1861/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1861/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1861/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 42 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 41, there are 85 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~33!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 87
pnml2lts-mc( 0/ 4): unique states count: 180
pnml2lts-mc( 0/ 4): unique transitions count: 538
pnml2lts-mc( 0/ 4): - self-loop count: 15
pnml2lts-mc( 0/ 4): - claim dead count: 95
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 194
pnml2lts-mc( 0/ 4): - cum. max stack depth: 110
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 194 states 607 transitions, fanout: 3.129
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 13.0 B/state, compr.: 7.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 76 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-03a-LTLCardinality-12
ltl formula formula --ltl=/tmp/1861/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 40 places, 76 transitions and 362 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1861/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1861/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1861/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1861/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 42 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 41, there are 97 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~53!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 331
pnml2lts-mc( 0/ 4): unique states count: 487
pnml2lts-mc( 0/ 4): unique transitions count: 1395
pnml2lts-mc( 0/ 4): - self-loop count: 104
pnml2lts-mc( 0/ 4): - claim dead count: 372
pnml2lts-mc( 0/ 4): - claim found count: 6
pnml2lts-mc( 0/ 4): - claim success count: 496
pnml2lts-mc( 0/ 4): - cum. max stack depth: 167
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 496 states 1441 transitions, fanout: 2.905
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 49600, Transitions per second: 144100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 11.7 B/state, compr.: 7.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 76 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-03a-LTLCardinality-14
ltl formula formula --ltl=/tmp/1861/ltl_3_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 40 places, 76 transitions and 362 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1861/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1861/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1861/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1861/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 41 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 41, there are 82 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~52!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1875
pnml2lts-mc( 0/ 4): unique states count: 2041
pnml2lts-mc( 0/ 4): unique transitions count: 6691
pnml2lts-mc( 0/ 4): - self-loop count: 935
pnml2lts-mc( 0/ 4): - claim dead count: 3261
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2050
pnml2lts-mc( 0/ 4): - cum. max stack depth: 193
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2050 states 6737 transitions, fanout: 3.286
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 102500, Transitions per second: 336850
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 9.8 B/state, compr.: 5.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 76 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-03a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutonomousCar-PT-03a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r468-smll-171620167300251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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