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-171620167400307.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-06b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167400307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 228K 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-06b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717213717904

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-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 03:48:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 03:48:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 03:48:41] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2024-06-01 03:48:41] [INFO ] Transformed 289 places.
[2024-06-01 03:48:41] [INFO ] Transformed 644 transitions.
[2024-06-01 03:48:41] [INFO ] Found NUPN structural information;
[2024-06-01 03:48:41] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 633 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-06b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-06b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 644/644 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 257 transition count 612
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 257 transition count 612
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 251 transition count 606
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 251 transition count 606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 250 transition count 605
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 250 transition count 605
Applied a total of 78 rules in 182 ms. Remains 250 /289 variables (removed 39) and now considering 605/644 (removed 39) transitions.
// Phase 1: matrix 605 rows 250 cols
[2024-06-01 03:48:41] [INFO ] Computed 11 invariants in 58 ms
[2024-06-01 03:48:42] [INFO ] Implicit Places using invariants in 666 ms returned []
[2024-06-01 03:48:42] [INFO ] Invariant cache hit.
[2024-06-01 03:48:43] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2024-06-01 03:48:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/250 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-06-01 03:48:57] [INFO ] Deduced a trap composed of 31 places in 409 ms of which 44 ms to minimize.
[2024-06-01 03:48:57] [INFO ] Deduced a trap composed of 57 places in 331 ms of which 5 ms to minimize.
[2024-06-01 03:48:57] [INFO ] Deduced a trap composed of 22 places in 304 ms of which 5 ms to minimize.
[2024-06-01 03:48:58] [INFO ] Deduced a trap composed of 47 places in 268 ms of which 5 ms to minimize.
[2024-06-01 03:48:58] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 2 ms to minimize.
[2024-06-01 03:48:59] [INFO ] Deduced a trap composed of 40 places in 295 ms of which 5 ms to minimize.
[2024-06-01 03:48:59] [INFO ] Deduced a trap composed of 43 places in 270 ms of which 4 ms to minimize.
[2024-06-01 03:48:59] [INFO ] Deduced a trap composed of 14 places in 224 ms of which 3 ms to minimize.
[2024-06-01 03:48:59] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 3 ms to minimize.
[2024-06-01 03:49:00] [INFO ] Deduced a trap composed of 40 places in 236 ms of which 4 ms to minimize.
[2024-06-01 03:49:00] [INFO ] Deduced a trap composed of 31 places in 245 ms of which 4 ms to minimize.
[2024-06-01 03:49:00] [INFO ] Deduced a trap composed of 33 places in 273 ms of which 4 ms to minimize.
[2024-06-01 03:49:00] [INFO ] Deduced a trap composed of 31 places in 256 ms of which 3 ms to minimize.
[2024-06-01 03:49:01] [INFO ] Deduced a trap composed of 33 places in 272 ms of which 3 ms to minimize.
[2024-06-01 03:49:01] [INFO ] Deduced a trap composed of 33 places in 257 ms of which 3 ms to minimize.
[2024-06-01 03:49:01] [INFO ] Deduced a trap composed of 31 places in 272 ms of which 4 ms to minimize.
[2024-06-01 03:49:02] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 3 ms to minimize.
[2024-06-01 03:49:02] [INFO ] Deduced a trap composed of 63 places in 218 ms of which 2 ms to minimize.
[2024-06-01 03:49:02] [INFO ] Deduced a trap composed of 37 places in 221 ms of which 2 ms to minimize.
[2024-06-01 03:49:03] [INFO ] Deduced a trap composed of 37 places in 231 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-06-01 03:49:03] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 3 ms to minimize.
[2024-06-01 03:49:03] [INFO ] Deduced a trap composed of 25 places in 206 ms of which 3 ms to minimize.
[2024-06-01 03:49:04] [INFO ] Deduced a trap composed of 34 places in 313 ms of which 4 ms to minimize.
[2024-06-01 03:49:04] [INFO ] Deduced a trap composed of 43 places in 414 ms of which 4 ms to minimize.
[2024-06-01 03:49:05] [INFO ] Deduced a trap composed of 32 places in 369 ms of which 4 ms to minimize.
[2024-06-01 03:49:05] [INFO ] Deduced a trap composed of 41 places in 357 ms of which 3 ms to minimize.
[2024-06-01 03:49:05] [INFO ] Deduced a trap composed of 49 places in 362 ms of which 4 ms to minimize.
[2024-06-01 03:49:06] [INFO ] Deduced a trap composed of 35 places in 376 ms of which 4 ms to minimize.
[2024-06-01 03:49:06] [INFO ] Deduced a trap composed of 48 places in 353 ms of which 4 ms to minimize.
[2024-06-01 03:49:07] [INFO ] Deduced a trap composed of 52 places in 346 ms of which 4 ms to minimize.
[2024-06-01 03:49:07] [INFO ] Deduced a trap composed of 21 places in 371 ms of which 4 ms to minimize.
[2024-06-01 03:49:07] [INFO ] Deduced a trap composed of 27 places in 363 ms of which 4 ms to minimize.
[2024-06-01 03:49:08] [INFO ] Deduced a trap composed of 30 places in 256 ms of which 2 ms to minimize.
[2024-06-01 03:49:08] [INFO ] Deduced a trap composed of 38 places in 351 ms of which 2 ms to minimize.
[2024-06-01 03:49:08] [INFO ] Deduced a trap composed of 25 places in 368 ms of which 4 ms to minimize.
[2024-06-01 03:49:09] [INFO ] Deduced a trap composed of 36 places in 336 ms of which 3 ms to minimize.
[2024-06-01 03:49:09] [INFO ] Deduced a trap composed of 39 places in 364 ms of which 3 ms to minimize.
[2024-06-01 03:49:10] [INFO ] Deduced a trap composed of 44 places in 337 ms of which 3 ms to minimize.
[2024-06-01 03:49:10] [INFO ] Deduced a trap composed of 44 places in 332 ms of which 4 ms to minimize.
[2024-06-01 03:49:10] [INFO ] Deduced a trap composed of 40 places in 358 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-06-01 03:49:16] [INFO ] Deduced a trap composed of 41 places in 330 ms of which 4 ms to minimize.
[2024-06-01 03:49:16] [INFO ] Deduced a trap composed of 33 places in 291 ms of which 3 ms to minimize.
[2024-06-01 03:49:17] [INFO ] Deduced a trap composed of 32 places in 306 ms of which 4 ms to minimize.
SMT process timed out in 34184ms, After SMT, problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 34257ms
Starting structural reductions in LTL mode, iteration 1 : 250/289 places, 605/644 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36099 ms. Remains : 250/289 places, 605/644 transitions.
Support contains 30 out of 250 places after structural reductions.
[2024-06-01 03:49:18] [INFO ] Flatten gal took : 223 ms
[2024-06-01 03:49:18] [INFO ] Flatten gal took : 122 ms
[2024-06-01 03:49:18] [INFO ] Input system was already deterministic with 605 transitions.
RANDOM walk for 40000 steps (117 resets) in 1919 ms. (20 steps per ms) remains 3/18 properties
BEST_FIRST walk for 40003 steps (70 resets) in 197 ms. (202 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (72 resets) in 181 ms. (219 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (68 resets) in 114 ms. (347 steps per ms) remains 1/2 properties
[2024-06-01 03:49:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 222/250 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 605/855 variables, 250/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/855 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/855 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 855/855 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Int declared 28/855 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/11 constraints, State Equation: 0/250 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 330ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA AutonomousCar-PT-06b-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 43 stabilizing places and 44 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' '!(F(G(((p1||F(G(p2)))&&p0))))'
Support contains 5 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Graph (trivial) has 228 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 92 place count 247 transition count 511
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 125 rules applied. Total rules applied 217 place count 156 transition count 477
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 238 place count 136 transition count 476
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 239 place count 135 transition count 476
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 239 place count 135 transition count 469
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 253 place count 128 transition count 469
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 260 place count 121 transition count 462
Iterating global reduction 4 with 7 rules applied. Total rules applied 267 place count 121 transition count 462
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 411 place count 121 transition count 318
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 411 place count 121 transition count 317
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 413 place count 120 transition count 317
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 414 place count 119 transition count 311
Iterating global reduction 5 with 1 rules applied. Total rules applied 415 place count 119 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 417 place count 119 transition count 309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 418 place count 118 transition count 309
Performed 47 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 7 with 94 rules applied. Total rules applied 512 place count 71 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 513 place count 71 transition count 260
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 522 place count 62 transition count 201
Iterating global reduction 8 with 9 rules applied. Total rules applied 531 place count 62 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 535 place count 62 transition count 197
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 9 with 2 rules applied. Total rules applied 537 place count 61 transition count 196
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 9 with 2 rules applied. Total rules applied 539 place count 60 transition count 196
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 541 place count 58 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 542 place count 57 transition count 194
Applied a total of 542 rules in 233 ms. Remains 57 /250 variables (removed 193) and now considering 194/605 (removed 411) transitions.
// Phase 1: matrix 194 rows 57 cols
[2024-06-01 03:49:20] [INFO ] Computed 9 invariants in 5 ms
[2024-06-01 03:49:20] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 03:49:20] [INFO ] Invariant cache hit.
[2024-06-01 03:49:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 03:49:20] [INFO ] Implicit Places using invariants and state equation in 165 ms returned [50, 54]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 297 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/250 places, 194/605 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 54 transition count 193
Applied a total of 2 rules in 12 ms. Remains 54 /55 variables (removed 1) and now considering 193/194 (removed 1) transitions.
// Phase 1: matrix 193 rows 54 cols
[2024-06-01 03:49:20] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 03:49:20] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 03:49:20] [INFO ] Invariant cache hit.
[2024-06-01 03:49:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:49:20] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/250 places, 193/605 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 776 ms. Remains : 54/250 places, 193/605 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-01
Product exploration explored 100000 steps with 8 reset in 327 ms.
Product exploration explored 100000 steps with 93 reset in 417 ms.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT p1)), (X (NOT (AND p1 p0 p2))), (X (X p2)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0 p2))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 13 factoid took 757 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (2698 resets) in 774 ms. (51 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (320 resets) in 303 ms. (131 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (311 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
[2024-06-01 03:49:23] [INFO ] Invariant cache hit.
[2024-06-01 03:49:23] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 106/120 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 120/240 variables, 34/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/245 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Real declared 246/247 variables, and 61 constraints, problems are : Problem set: 2 solved, 0 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 210ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT p1)), (X (NOT (AND p1 p0 p2))), (X (X p2)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0 p2)))), (G (OR (NOT p1) p2 (NOT p0))), (G (OR (NOT p1) (NOT p2) (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (AND (NOT p1) p2) (AND p2 (NOT p0))))), (F p0), (F (NOT (OR p1 (NOT p0)))), (F (NOT p2)), (F (NOT (AND (OR p1 p2) (OR p2 p0)))), (F p1)]
Knowledge based reduction with 15 factoid took 876 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
[2024-06-01 03:49:24] [INFO ] Invariant cache hit.
[2024-06-01 03:49:24] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-01 03:49:24] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-06-01 03:49:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:49:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-01 03:49:25] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-06-01 03:49:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:49:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 03:49:25] [INFO ] Computed and/alt/rep : 19/57/19 causal constraints (skipped 172 transitions) in 55 ms.
[2024-06-01 03:49:25] [INFO ] Added : 5 causal constraints over 2 iterations in 127 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 54 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 193/193 transitions.
Applied a total of 0 rules in 13 ms. Remains 54 /54 variables (removed 0) and now considering 193/193 (removed 0) transitions.
[2024-06-01 03:49:25] [INFO ] Invariant cache hit.
[2024-06-01 03:49:25] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-01 03:49:25] [INFO ] Invariant cache hit.
[2024-06-01 03:49:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:49:25] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-06-01 03:49:25] [INFO ] Redundant transitions in 14 ms returned []
Running 191 sub problems to find dead transitions.
[2024-06-01 03:49:25] [INFO ] Invariant cache hit.
[2024-06-01 03:49:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD91 is UNSAT
At refinement iteration 2 (OVERLAPS) 192/246 variables, 54/61 constraints. Problems are: Problem set: 2 solved, 189 unsolved
[2024-06-01 03:49:27] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 1 ms to minimize.
[2024-06-01 03:49:27] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2024-06-01 03:49:27] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 3/64 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/64 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 1/247 variables, 1/65 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/65 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 0/247 variables, 0/65 constraints. Problems are: Problem set: 2 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 65 constraints, problems are : Problem set: 2 solved, 189 unsolved in 7474 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 2 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 3/10 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 192/244 variables, 52/62 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 186/248 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/248 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 2/246 variables, 2/250 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 3/253 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/253 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 9 (OVERLAPS) 1/247 variables, 1/254 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/254 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 11 (OVERLAPS) 0/247 variables, 0/254 constraints. Problems are: Problem set: 2 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 254 constraints, problems are : Problem set: 2 solved, 189 unsolved in 23224 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 189/191 constraints, Known Traps: 3/3 constraints]
After SMT, in 31401ms problems are : Problem set: 2 solved, 189 unsolved
Search for dead transitions found 2 dead transitions in 31408ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 54/54 places, 191/193 transitions.
Graph (complete) has 423 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 52 transition count 190
Applied a total of 3 rules in 37 ms. Remains 52 /54 variables (removed 2) and now considering 190/191 (removed 1) transitions.
// Phase 1: matrix 190 rows 52 cols
[2024-06-01 03:49:57] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 03:49:57] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 03:49:57] [INFO ] Invariant cache hit.
[2024-06-01 03:49:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:49:57] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/54 places, 190/193 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32165 ms. Remains : 52/54 places, 190/193 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 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p2) p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 240 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 266 steps (16 resets) in 8 ms. (29 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p2), (X p2), (X (NOT (AND (NOT p2) p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2))), (F p0)]
Knowledge based reduction with 5 factoid took 338 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
[2024-06-01 03:49:58] [INFO ] Invariant cache hit.
[2024-06-01 03:49:58] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 03:49:58] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-06-01 03:49:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:49:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 03:49:58] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-06-01 03:49:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:49:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 03:49:58] [INFO ] Computed and/alt/rep : 16/54/16 causal constraints (skipped 172 transitions) in 59 ms.
[2024-06-01 03:49:58] [INFO ] Added : 1 causal constraints over 1 iterations in 99 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering criterion allowed to conclude after 1432 steps with 100 reset in 9 ms.
FORMULA AutonomousCar-PT-06b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLCardinality-01 finished in 39088 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' '!(G(F(p0)))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Graph (trivial) has 235 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 247 transition count 508
Reduce places removed 94 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 128 rules applied. Total rules applied 223 place count 153 transition count 474
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 244 place count 133 transition count 473
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 245 place count 132 transition count 473
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 245 place count 132 transition count 466
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 259 place count 125 transition count 466
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 266 place count 118 transition count 459
Iterating global reduction 4 with 7 rules applied. Total rules applied 273 place count 118 transition count 459
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 417 place count 118 transition count 315
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 417 place count 118 transition count 314
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 419 place count 117 transition count 314
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 421 place count 115 transition count 307
Iterating global reduction 5 with 2 rules applied. Total rules applied 423 place count 115 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 425 place count 115 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 426 place count 114 transition count 305
Performed 50 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 526 place count 64 transition count 254
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 527 place count 64 transition count 253
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 537 place count 54 transition count 187
Iterating global reduction 8 with 10 rules applied. Total rules applied 547 place count 54 transition count 187
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 551 place count 54 transition count 183
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 9 with 2 rules applied. Total rules applied 553 place count 53 transition count 182
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 555 place count 51 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 556 place count 50 transition count 180
Applied a total of 556 rules in 123 ms. Remains 50 /250 variables (removed 200) and now considering 180/605 (removed 425) transitions.
// Phase 1: matrix 180 rows 50 cols
[2024-06-01 03:49:59] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 03:49:59] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 03:49:59] [INFO ] Invariant cache hit.
[2024-06-01 03:49:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 03:49:59] [INFO ] Implicit Places using invariants and state equation in 232 ms returned [45, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 369 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/250 places, 180/605 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 179
Applied a total of 2 rules in 13 ms. Remains 47 /48 variables (removed 1) and now considering 179/180 (removed 1) transitions.
// Phase 1: matrix 179 rows 47 cols
[2024-06-01 03:49:59] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 03:49:59] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 03:49:59] [INFO ] Invariant cache hit.
[2024-06-01 03:49:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:49:59] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/250 places, 179/605 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 821 ms. Remains : 47/250 places, 179/605 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-03
Product exploration explored 100000 steps with 336 reset in 106 ms.
Product exploration explored 100000 steps with 233 reset in 122 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 288 steps (12 resets) in 5 ms. (48 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 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 179/179 transitions.
Applied a total of 0 rules in 6 ms. Remains 47 /47 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-06-01 03:50:00] [INFO ] Invariant cache hit.
[2024-06-01 03:50:00] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 03:50:00] [INFO ] Invariant cache hit.
[2024-06-01 03:50:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:50:00] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-06-01 03:50:00] [INFO ] Redundant transitions in 25 ms returned [99]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 176 sub problems to find dead transitions.
// Phase 1: matrix 178 rows 47 cols
[2024-06-01 03:50:00] [INFO ] Computed 7 invariants in 6 ms
[2024-06-01 03:50:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 177/223 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 03:50:03] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 1/224 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 1/225 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (OVERLAPS) 0/225 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 56 constraints, problems are : Problem set: 0 solved, 176 unsolved in 9213 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 177/223 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 176/230 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 03:50:14] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 1/224 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (OVERLAPS) 1/225 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (OVERLAPS) 0/225 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 233 constraints, problems are : Problem set: 0 solved, 176 unsolved in 20837 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 2/2 constraints]
After SMT, in 30644ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 30648ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/47 places, 178/179 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 176
Applied a total of 2 rules in 11 ms. Remains 45 /47 variables (removed 2) and now considering 176/178 (removed 2) transitions.
// Phase 1: matrix 176 rows 45 cols
[2024-06-01 03:50:31] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 03:50:31] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 03:50:31] [INFO ] Invariant cache hit.
[2024-06-01 03:50:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:50:31] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/47 places, 176/179 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31162 ms. Remains : 45/47 places, 176/179 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 162 steps (11 resets) in 4 ms. (32 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 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 300 reset in 100 ms.
Product exploration explored 100000 steps with 69 reset in 113 ms.
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 45 /45 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-06-01 03:50:32] [INFO ] Invariant cache hit.
[2024-06-01 03:50:32] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-01 03:50:32] [INFO ] Invariant cache hit.
[2024-06-01 03:50:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:50:33] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2024-06-01 03:50:33] [INFO ] Redundant transitions in 33 ms returned []
Running 175 sub problems to find dead transitions.
[2024-06-01 03:50:33] [INFO ] Invariant cache hit.
[2024-06-01 03:50:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 175/220 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 03:50:35] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 1/221 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/221 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 54 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7271 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 175/220 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 175/228 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-06-01 03:50:44] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 1/221 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/221 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 230 constraints, problems are : Problem set: 0 solved, 175 unsolved in 17952 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 2/2 constraints]
After SMT, in 25987ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 25992ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 26450 ms. Remains : 45/45 places, 176/176 transitions.
Treatment of property AutonomousCar-PT-06b-LTLCardinality-03 finished in 60141 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 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 238 transition count 593
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 238 transition count 593
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 168 place count 238 transition count 449
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 171 place count 235 transition count 446
Iterating global reduction 1 with 3 rules applied. Total rules applied 174 place count 235 transition count 446
Applied a total of 174 rules in 14 ms. Remains 235 /250 variables (removed 15) and now considering 446/605 (removed 159) transitions.
// Phase 1: matrix 446 rows 235 cols
[2024-06-01 03:50:59] [INFO ] Computed 11 invariants in 6 ms
[2024-06-01 03:50:59] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-06-01 03:50:59] [INFO ] Invariant cache hit.
[2024-06-01 03:51:00] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-06-01 03:51:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-01 03:51:08] [INFO ] Deduced a trap composed of 21 places in 274 ms of which 5 ms to minimize.
[2024-06-01 03:51:08] [INFO ] Deduced a trap composed of 55 places in 375 ms of which 4 ms to minimize.
[2024-06-01 03:51:09] [INFO ] Deduced a trap composed of 17 places in 310 ms of which 4 ms to minimize.
[2024-06-01 03:51:09] [INFO ] Deduced a trap composed of 53 places in 220 ms of which 2 ms to minimize.
[2024-06-01 03:51:09] [INFO ] Deduced a trap composed of 43 places in 316 ms of which 4 ms to minimize.
[2024-06-01 03:51:09] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-06-01 03:51:10] [INFO ] Deduced a trap composed of 38 places in 289 ms of which 13 ms to minimize.
[2024-06-01 03:51:10] [INFO ] Deduced a trap composed of 36 places in 200 ms of which 3 ms to minimize.
[2024-06-01 03:51:10] [INFO ] Deduced a trap composed of 30 places in 297 ms of which 4 ms to minimize.
[2024-06-01 03:51:11] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 4 ms to minimize.
[2024-06-01 03:51:11] [INFO ] Deduced a trap composed of 44 places in 248 ms of which 3 ms to minimize.
[2024-06-01 03:51:11] [INFO ] Deduced a trap composed of 44 places in 287 ms of which 3 ms to minimize.
[2024-06-01 03:51:11] [INFO ] Deduced a trap composed of 33 places in 309 ms of which 3 ms to minimize.
[2024-06-01 03:51:12] [INFO ] Deduced a trap composed of 42 places in 276 ms of which 3 ms to minimize.
[2024-06-01 03:51:12] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 2 ms to minimize.
[2024-06-01 03:51:12] [INFO ] Deduced a trap composed of 34 places in 231 ms of which 4 ms to minimize.
[2024-06-01 03:51:13] [INFO ] Deduced a trap composed of 39 places in 263 ms of which 3 ms to minimize.
[2024-06-01 03:51:13] [INFO ] Deduced a trap composed of 37 places in 266 ms of which 4 ms to minimize.
[2024-06-01 03:51:13] [INFO ] Deduced a trap composed of 39 places in 286 ms of which 4 ms to minimize.
[2024-06-01 03:51:13] [INFO ] Deduced a trap composed of 44 places in 290 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-01 03:51:14] [INFO ] Deduced a trap composed of 14 places in 302 ms of which 3 ms to minimize.
[2024-06-01 03:51:15] [INFO ] Deduced a trap composed of 47 places in 263 ms of which 4 ms to minimize.
[2024-06-01 03:51:15] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 4 ms to minimize.
[2024-06-01 03:51:15] [INFO ] Deduced a trap composed of 32 places in 279 ms of which 4 ms to minimize.
[2024-06-01 03:51:16] [INFO ] Deduced a trap composed of 18 places in 283 ms of which 5 ms to minimize.
[2024-06-01 03:51:16] [INFO ] Deduced a trap composed of 31 places in 245 ms of which 3 ms to minimize.
[2024-06-01 03:51:16] [INFO ] Deduced a trap composed of 31 places in 237 ms of which 4 ms to minimize.
[2024-06-01 03:51:16] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 3 ms to minimize.
[2024-06-01 03:51:17] [INFO ] Deduced a trap composed of 57 places in 324 ms of which 4 ms to minimize.
[2024-06-01 03:51:17] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 3 ms to minimize.
[2024-06-01 03:51:17] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 3 ms to minimize.
[2024-06-01 03:51:18] [INFO ] Deduced a trap composed of 40 places in 252 ms of which 3 ms to minimize.
[2024-06-01 03:51:18] [INFO ] Deduced a trap composed of 44 places in 211 ms of which 3 ms to minimize.
[2024-06-01 03:51:18] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 3 ms to minimize.
[2024-06-01 03:51:18] [INFO ] Deduced a trap composed of 43 places in 202 ms of which 3 ms to minimize.
[2024-06-01 03:51:19] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 3 ms to minimize.
[2024-06-01 03:51:19] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 3 ms to minimize.
[2024-06-01 03:51:19] [INFO ] Deduced a trap composed of 44 places in 223 ms of which 3 ms to minimize.
[2024-06-01 03:51:20] [INFO ] Deduced a trap composed of 41 places in 288 ms of which 3 ms to minimize.
[2024-06-01 03:51:20] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-01 03:51:25] [INFO ] Deduced a trap composed of 40 places in 321 ms of which 3 ms to minimize.
[2024-06-01 03:51:25] [INFO ] Deduced a trap composed of 21 places in 298 ms of which 3 ms to minimize.
[2024-06-01 03:51:25] [INFO ] Deduced a trap composed of 32 places in 289 ms of which 4 ms to minimize.
[2024-06-01 03:51:26] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 3 ms to minimize.
[2024-06-01 03:51:27] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 3 ms to minimize.
[2024-06-01 03:51:27] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 2 ms to minimize.
[2024-06-01 03:51:27] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 3 ms to minimize.
[2024-06-01 03:51:27] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 2 ms to minimize.
[2024-06-01 03:51:28] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 2 ms to minimize.
[2024-06-01 03:51:28] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 3 ms to minimize.
[2024-06-01 03:51:28] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 2 ms to minimize.
[2024-06-01 03:51:29] [INFO ] Deduced a trap composed of 15 places in 289 ms of which 3 ms to minimize.
[2024-06-01 03:51:29] [INFO ] Deduced a trap composed of 23 places in 271 ms of which 4 ms to minimize.
[2024-06-01 03:51:29] [INFO ] Deduced a trap composed of 22 places in 249 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/681 variables, and 65 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-01 03:51:36] [INFO ] Deduced a trap composed of 31 places in 212 ms of which 3 ms to minimize.
[2024-06-01 03:51:36] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 3 ms to minimize.
[2024-06-01 03:51:36] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 2 ms to minimize.
[2024-06-01 03:51:37] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 3 ms to minimize.
[2024-06-01 03:51:37] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 4 ms to minimize.
[2024-06-01 03:51:37] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 2 ms to minimize.
[2024-06-01 03:51:38] [INFO ] Deduced a trap composed of 40 places in 234 ms of which 3 ms to minimize.
[2024-06-01 03:51:38] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 3 ms to minimize.
[2024-06-01 03:51:38] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 3 ms to minimize.
[2024-06-01 03:51:38] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 2 ms to minimize.
[2024-06-01 03:51:39] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 2 ms to minimize.
[2024-06-01 03:51:39] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 2 ms to minimize.
[2024-06-01 03:51:39] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 3 ms to minimize.
[2024-06-01 03:51:39] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 3 ms to minimize.
[2024-06-01 03:51:40] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-01 03:51:42] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 3 ms to minimize.
[2024-06-01 03:51:42] [INFO ] Deduced a trap composed of 35 places in 294 ms of which 3 ms to minimize.
[2024-06-01 03:51:43] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 3 ms to minimize.
[2024-06-01 03:51:43] [INFO ] Deduced a trap composed of 41 places in 207 ms of which 4 ms to minimize.
[2024-06-01 03:51:43] [INFO ] Deduced a trap composed of 39 places in 215 ms of which 2 ms to minimize.
[2024-06-01 03:51:43] [INFO ] Deduced a trap composed of 38 places in 253 ms of which 4 ms to minimize.
[2024-06-01 03:51:46] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 7/87 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-01 03:51:49] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 3 ms to minimize.
[2024-06-01 03:51:49] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 3 ms to minimize.
[2024-06-01 03:51:49] [INFO ] Deduced a trap composed of 35 places in 235 ms of which 3 ms to minimize.
[2024-06-01 03:51:50] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 2 ms to minimize.
[2024-06-01 03:51:50] [INFO ] Deduced a trap composed of 51 places in 257 ms of which 4 ms to minimize.
[2024-06-01 03:51:51] [INFO ] Deduced a trap composed of 32 places in 287 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-01 03:51:55] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 2 ms to minimize.
[2024-06-01 03:51:55] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 2 ms to minimize.
[2024-06-01 03:51:56] [INFO ] Deduced a trap composed of 52 places in 165 ms of which 2 ms to minimize.
[2024-06-01 03:51:57] [INFO ] Deduced a trap composed of 52 places in 155 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/681 variables, and 97 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 0/445 constraints, Known Traps: 86/86 constraints]
After SMT, in 61144ms problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 61152ms
Starting structural reductions in LTL mode, iteration 1 : 235/250 places, 446/605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61919 ms. Remains : 235/250 places, 446/605 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLCardinality-04 finished in 62056 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 6 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Graph (trivial) has 226 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 247 transition count 512
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 122 rules applied. Total rules applied 213 place count 157 transition count 480
Reduce places removed 19 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 22 rules applied. Total rules applied 235 place count 138 transition count 477
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 240 place count 135 transition count 475
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 241 place count 134 transition count 475
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 241 place count 134 transition count 468
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 255 place count 127 transition count 468
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 261 place count 121 transition count 462
Iterating global reduction 5 with 6 rules applied. Total rules applied 267 place count 121 transition count 462
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 5 with 144 rules applied. Total rules applied 411 place count 121 transition count 318
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 411 place count 121 transition count 317
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 413 place count 120 transition count 317
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 414 place count 119 transition count 311
Iterating global reduction 6 with 1 rules applied. Total rules applied 415 place count 119 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 417 place count 119 transition count 309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 418 place count 118 transition count 309
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 8 with 92 rules applied. Total rules applied 510 place count 72 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 511 place count 72 transition count 262
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 521 place count 62 transition count 196
Iterating global reduction 9 with 10 rules applied. Total rules applied 531 place count 62 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 534 place count 62 transition count 193
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 10 with 2 rules applied. Total rules applied 536 place count 61 transition count 192
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 10 with 2 rules applied. Total rules applied 538 place count 60 transition count 192
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 539 place count 60 transition count 191
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 541 place count 60 transition count 191
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 543 place count 58 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 544 place count 57 transition count 189
Applied a total of 544 rules in 118 ms. Remains 57 /250 variables (removed 193) and now considering 189/605 (removed 416) transitions.
// Phase 1: matrix 189 rows 57 cols
[2024-06-01 03:52:01] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 03:52:01] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 03:52:01] [INFO ] Invariant cache hit.
[2024-06-01 03:52:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 03:52:01] [INFO ] Implicit Places using invariants and state equation in 153 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 247 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/250 places, 189/605 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 188
Applied a total of 2 rules in 8 ms. Remains 55 /56 variables (removed 1) and now considering 188/189 (removed 1) transitions.
// Phase 1: matrix 188 rows 55 cols
[2024-06-01 03:52:01] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 03:52:01] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 03:52:01] [INFO ] Invariant cache hit.
[2024-06-01 03:52:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 03:52:01] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/250 places, 188/605 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 616 ms. Remains : 55/250 places, 188/605 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-05
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLCardinality-05 finished in 679 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((X(p0)&&(F(p1)||G(((p2&&F(p3)) U p4))))))'
Support contains 6 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 241 transition count 596
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 241 transition count 596
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 162 place count 241 transition count 452
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 164 place count 239 transition count 450
Iterating global reduction 1 with 2 rules applied. Total rules applied 166 place count 239 transition count 450
Applied a total of 166 rules in 17 ms. Remains 239 /250 variables (removed 11) and now considering 450/605 (removed 155) transitions.
// Phase 1: matrix 450 rows 239 cols
[2024-06-01 03:52:02] [INFO ] Computed 11 invariants in 3 ms
[2024-06-01 03:52:02] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-06-01 03:52:02] [INFO ] Invariant cache hit.
[2024-06-01 03:52:02] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
Running 449 sub problems to find dead transitions.
[2024-06-01 03:52:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-01 03:52:11] [INFO ] Deduced a trap composed of 17 places in 305 ms of which 4 ms to minimize.
[2024-06-01 03:52:11] [INFO ] Deduced a trap composed of 52 places in 309 ms of which 4 ms to minimize.
[2024-06-01 03:52:11] [INFO ] Deduced a trap composed of 32 places in 305 ms of which 4 ms to minimize.
[2024-06-01 03:52:12] [INFO ] Deduced a trap composed of 36 places in 263 ms of which 4 ms to minimize.
[2024-06-01 03:52:12] [INFO ] Deduced a trap composed of 56 places in 312 ms of which 4 ms to minimize.
[2024-06-01 03:52:12] [INFO ] Deduced a trap composed of 24 places in 318 ms of which 4 ms to minimize.
[2024-06-01 03:52:13] [INFO ] Deduced a trap composed of 14 places in 299 ms of which 6 ms to minimize.
[2024-06-01 03:52:13] [INFO ] Deduced a trap composed of 23 places in 301 ms of which 4 ms to minimize.
[2024-06-01 03:52:13] [INFO ] Deduced a trap composed of 31 places in 278 ms of which 3 ms to minimize.
[2024-06-01 03:52:14] [INFO ] Deduced a trap composed of 26 places in 294 ms of which 4 ms to minimize.
[2024-06-01 03:52:14] [INFO ] Deduced a trap composed of 39 places in 279 ms of which 3 ms to minimize.
[2024-06-01 03:52:14] [INFO ] Deduced a trap composed of 39 places in 297 ms of which 4 ms to minimize.
[2024-06-01 03:52:15] [INFO ] Deduced a trap composed of 43 places in 281 ms of which 4 ms to minimize.
[2024-06-01 03:52:15] [INFO ] Deduced a trap composed of 41 places in 466 ms of which 4 ms to minimize.
[2024-06-01 03:52:15] [INFO ] Deduced a trap composed of 31 places in 258 ms of which 3 ms to minimize.
[2024-06-01 03:52:16] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 3 ms to minimize.
[2024-06-01 03:52:16] [INFO ] Deduced a trap composed of 40 places in 222 ms of which 4 ms to minimize.
[2024-06-01 03:52:16] [INFO ] Deduced a trap composed of 45 places in 269 ms of which 4 ms to minimize.
[2024-06-01 03:52:16] [INFO ] Deduced a trap composed of 47 places in 285 ms of which 4 ms to minimize.
[2024-06-01 03:52:17] [INFO ] Deduced a trap composed of 42 places in 308 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-01 03:52:18] [INFO ] Deduced a trap composed of 42 places in 318 ms of which 4 ms to minimize.
[2024-06-01 03:52:18] [INFO ] Deduced a trap composed of 18 places in 285 ms of which 3 ms to minimize.
[2024-06-01 03:52:18] [INFO ] Deduced a trap composed of 46 places in 334 ms of which 4 ms to minimize.
[2024-06-01 03:52:19] [INFO ] Deduced a trap composed of 43 places in 295 ms of which 4 ms to minimize.
[2024-06-01 03:52:19] [INFO ] Deduced a trap composed of 43 places in 289 ms of which 3 ms to minimize.
[2024-06-01 03:52:19] [INFO ] Deduced a trap composed of 44 places in 307 ms of which 4 ms to minimize.
[2024-06-01 03:52:20] [INFO ] Deduced a trap composed of 21 places in 309 ms of which 4 ms to minimize.
[2024-06-01 03:52:20] [INFO ] Deduced a trap composed of 40 places in 320 ms of which 4 ms to minimize.
[2024-06-01 03:52:20] [INFO ] Deduced a trap composed of 40 places in 313 ms of which 4 ms to minimize.
[2024-06-01 03:52:21] [INFO ] Deduced a trap composed of 38 places in 242 ms of which 4 ms to minimize.
[2024-06-01 03:52:21] [INFO ] Deduced a trap composed of 34 places in 249 ms of which 4 ms to minimize.
[2024-06-01 03:52:21] [INFO ] Deduced a trap composed of 28 places in 304 ms of which 4 ms to minimize.
[2024-06-01 03:52:22] [INFO ] Deduced a trap composed of 40 places in 263 ms of which 4 ms to minimize.
[2024-06-01 03:52:22] [INFO ] Deduced a trap composed of 35 places in 272 ms of which 4 ms to minimize.
[2024-06-01 03:52:22] [INFO ] Deduced a trap composed of 40 places in 256 ms of which 4 ms to minimize.
[2024-06-01 03:52:23] [INFO ] Deduced a trap composed of 42 places in 236 ms of which 3 ms to minimize.
[2024-06-01 03:52:23] [INFO ] Deduced a trap composed of 40 places in 286 ms of which 3 ms to minimize.
[2024-06-01 03:52:23] [INFO ] Deduced a trap composed of 21 places in 256 ms of which 3 ms to minimize.
[2024-06-01 03:52:24] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 3 ms to minimize.
[2024-06-01 03:52:24] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-01 03:52:28] [INFO ] Deduced a trap composed of 33 places in 329 ms of which 4 ms to minimize.
[2024-06-01 03:52:29] [INFO ] Deduced a trap composed of 32 places in 281 ms of which 4 ms to minimize.
[2024-06-01 03:52:29] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 3 ms to minimize.
[2024-06-01 03:52:29] [INFO ] Deduced a trap composed of 39 places in 259 ms of which 4 ms to minimize.
[2024-06-01 03:52:30] [INFO ] Deduced a trap composed of 43 places in 250 ms of which 4 ms to minimize.
[2024-06-01 03:52:30] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 3 ms to minimize.
[2024-06-01 03:52:30] [INFO ] Deduced a trap composed of 37 places in 250 ms of which 3 ms to minimize.
[2024-06-01 03:52:30] [INFO ] Deduced a trap composed of 35 places in 218 ms of which 3 ms to minimize.
[2024-06-01 03:52:31] [INFO ] Deduced a trap composed of 60 places in 255 ms of which 3 ms to minimize.
[2024-06-01 03:52:32] [INFO ] Deduced a trap composed of 46 places in 254 ms of which 4 ms to minimize.
[2024-06-01 03:52:32] [INFO ] Deduced a trap composed of 31 places in 255 ms of which 4 ms to minimize.
[2024-06-01 03:52:32] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 2 ms to minimize.
[2024-06-01 03:52:32] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 2 ms to minimize.
[2024-06-01 03:52:33] [INFO ] Deduced a trap composed of 59 places in 259 ms of which 4 ms to minimize.
[2024-06-01 03:52:33] [INFO ] Deduced a trap composed of 40 places in 275 ms of which 4 ms to minimize.
[2024-06-01 03:52:33] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 239/689 variables, and 67 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/239 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-01 03:52:38] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-06-01 03:52:38] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 2 ms to minimize.
[2024-06-01 03:52:38] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 3 ms to minimize.
[2024-06-01 03:52:39] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 3 ms to minimize.
[2024-06-01 03:52:39] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 4 ms to minimize.
[2024-06-01 03:52:39] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 3 ms to minimize.
[2024-06-01 03:52:40] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 2 ms to minimize.
[2024-06-01 03:52:41] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 4 ms to minimize.
[2024-06-01 03:52:41] [INFO ] Deduced a trap composed of 44 places in 204 ms of which 3 ms to minimize.
[2024-06-01 03:52:41] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 3 ms to minimize.
[2024-06-01 03:52:41] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 3 ms to minimize.
[2024-06-01 03:52:42] [INFO ] Deduced a trap composed of 31 places in 260 ms of which 4 ms to minimize.
[2024-06-01 03:52:42] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 3 ms to minimize.
[2024-06-01 03:52:42] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 2 ms to minimize.
[2024-06-01 03:52:43] [INFO ] Deduced a trap composed of 32 places in 297 ms of which 4 ms to minimize.
[2024-06-01 03:52:43] [INFO ] Deduced a trap composed of 47 places in 256 ms of which 4 ms to minimize.
[2024-06-01 03:52:43] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 4 ms to minimize.
[2024-06-01 03:52:44] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 3 ms to minimize.
[2024-06-01 03:52:44] [INFO ] Deduced a trap composed of 40 places in 186 ms of which 3 ms to minimize.
[2024-06-01 03:52:44] [INFO ] Deduced a trap composed of 40 places in 246 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-01 03:52:45] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 3 ms to minimize.
[2024-06-01 03:52:46] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 3 ms to minimize.
[2024-06-01 03:52:48] [INFO ] Deduced a trap composed of 15 places in 308 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-01 03:52:53] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-01 03:52:57] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 2 ms to minimize.
[2024-06-01 03:52:59] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 4 ms to minimize.
[2024-06-01 03:52:59] [INFO ] Deduced a trap composed of 36 places in 251 ms of which 3 ms to minimize.
[2024-06-01 03:52:59] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 2 ms to minimize.
[2024-06-01 03:53:00] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 2 ms to minimize.
[2024-06-01 03:53:00] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 239/689 variables, and 97 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/239 constraints, PredecessorRefiner: 0/449 constraints, Known Traps: 86/86 constraints]
After SMT, in 61139ms problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 61148ms
Starting structural reductions in LTL mode, iteration 1 : 239/250 places, 450/605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61853 ms. Remains : 239/250 places, 450/605 transitions.
Stuttering acceptance computed with spot in 765 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p4))), (NOT p0), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p4))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-07
Stuttering criterion allowed to conclude after 119 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLCardinality-07 finished in 62652 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(G(p0)))))'
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 238 transition count 593
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 238 transition count 593
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 168 place count 238 transition count 449
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 171 place count 235 transition count 446
Iterating global reduction 1 with 3 rules applied. Total rules applied 174 place count 235 transition count 446
Applied a total of 174 rules in 16 ms. Remains 235 /250 variables (removed 15) and now considering 446/605 (removed 159) transitions.
// Phase 1: matrix 446 rows 235 cols
[2024-06-01 03:53:04] [INFO ] Computed 11 invariants in 5 ms
[2024-06-01 03:53:04] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-06-01 03:53:04] [INFO ] Invariant cache hit.
[2024-06-01 03:53:05] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-06-01 03:53:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-01 03:53:12] [INFO ] Deduced a trap composed of 21 places in 341 ms of which 5 ms to minimize.
[2024-06-01 03:53:13] [INFO ] Deduced a trap composed of 55 places in 345 ms of which 4 ms to minimize.
[2024-06-01 03:53:13] [INFO ] Deduced a trap composed of 17 places in 307 ms of which 4 ms to minimize.
[2024-06-01 03:53:13] [INFO ] Deduced a trap composed of 53 places in 296 ms of which 4 ms to minimize.
[2024-06-01 03:53:14] [INFO ] Deduced a trap composed of 43 places in 298 ms of which 4 ms to minimize.
[2024-06-01 03:53:14] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-06-01 03:53:14] [INFO ] Deduced a trap composed of 38 places in 284 ms of which 3 ms to minimize.
[2024-06-01 03:53:15] [INFO ] Deduced a trap composed of 36 places in 270 ms of which 3 ms to minimize.
[2024-06-01 03:53:15] [INFO ] Deduced a trap composed of 30 places in 276 ms of which 4 ms to minimize.
[2024-06-01 03:53:15] [INFO ] Deduced a trap composed of 23 places in 290 ms of which 4 ms to minimize.
[2024-06-01 03:53:16] [INFO ] Deduced a trap composed of 44 places in 279 ms of which 4 ms to minimize.
[2024-06-01 03:53:16] [INFO ] Deduced a trap composed of 44 places in 292 ms of which 4 ms to minimize.
[2024-06-01 03:53:16] [INFO ] Deduced a trap composed of 33 places in 291 ms of which 4 ms to minimize.
[2024-06-01 03:53:16] [INFO ] Deduced a trap composed of 42 places in 218 ms of which 2 ms to minimize.
[2024-06-01 03:53:17] [INFO ] Deduced a trap composed of 27 places in 207 ms of which 2 ms to minimize.
[2024-06-01 03:53:17] [INFO ] Deduced a trap composed of 34 places in 272 ms of which 3 ms to minimize.
[2024-06-01 03:53:17] [INFO ] Deduced a trap composed of 39 places in 270 ms of which 4 ms to minimize.
[2024-06-01 03:53:17] [INFO ] Deduced a trap composed of 37 places in 279 ms of which 4 ms to minimize.
[2024-06-01 03:53:18] [INFO ] Deduced a trap composed of 39 places in 249 ms of which 4 ms to minimize.
[2024-06-01 03:53:18] [INFO ] Deduced a trap composed of 44 places in 277 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-01 03:53:19] [INFO ] Deduced a trap composed of 14 places in 284 ms of which 3 ms to minimize.
[2024-06-01 03:53:19] [INFO ] Deduced a trap composed of 47 places in 299 ms of which 4 ms to minimize.
[2024-06-01 03:53:20] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 4 ms to minimize.
[2024-06-01 03:53:20] [INFO ] Deduced a trap composed of 32 places in 304 ms of which 4 ms to minimize.
[2024-06-01 03:53:20] [INFO ] Deduced a trap composed of 18 places in 268 ms of which 4 ms to minimize.
[2024-06-01 03:53:20] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 3 ms to minimize.
[2024-06-01 03:53:21] [INFO ] Deduced a trap composed of 31 places in 257 ms of which 6 ms to minimize.
[2024-06-01 03:53:21] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 3 ms to minimize.
[2024-06-01 03:53:22] [INFO ] Deduced a trap composed of 57 places in 351 ms of which 4 ms to minimize.
[2024-06-01 03:53:22] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 3 ms to minimize.
[2024-06-01 03:53:22] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 3 ms to minimize.
[2024-06-01 03:53:23] [INFO ] Deduced a trap composed of 40 places in 251 ms of which 3 ms to minimize.
[2024-06-01 03:53:23] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
[2024-06-01 03:53:23] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 3 ms to minimize.
[2024-06-01 03:53:23] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 2 ms to minimize.
[2024-06-01 03:53:23] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 2 ms to minimize.
[2024-06-01 03:53:24] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 3 ms to minimize.
[2024-06-01 03:53:24] [INFO ] Deduced a trap composed of 44 places in 221 ms of which 3 ms to minimize.
[2024-06-01 03:53:24] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 3 ms to minimize.
[2024-06-01 03:53:25] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-01 03:53:29] [INFO ] Deduced a trap composed of 40 places in 303 ms of which 4 ms to minimize.
[2024-06-01 03:53:29] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 3 ms to minimize.
[2024-06-01 03:53:29] [INFO ] Deduced a trap composed of 32 places in 268 ms of which 4 ms to minimize.
[2024-06-01 03:53:30] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 2 ms to minimize.
[2024-06-01 03:53:31] [INFO ] Deduced a trap composed of 42 places in 218 ms of which 2 ms to minimize.
[2024-06-01 03:53:31] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 2 ms to minimize.
[2024-06-01 03:53:31] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 2 ms to minimize.
[2024-06-01 03:53:31] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 3 ms to minimize.
[2024-06-01 03:53:31] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 3 ms to minimize.
[2024-06-01 03:53:32] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 2 ms to minimize.
[2024-06-01 03:53:32] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 2 ms to minimize.
[2024-06-01 03:53:33] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 2 ms to minimize.
[2024-06-01 03:53:33] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 2 ms to minimize.
[2024-06-01 03:53:33] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/681 variables, and 65 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-01 03:53:39] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 2 ms to minimize.
[2024-06-01 03:53:39] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 3 ms to minimize.
[2024-06-01 03:53:39] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-06-01 03:53:40] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 3 ms to minimize.
[2024-06-01 03:53:40] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 2 ms to minimize.
[2024-06-01 03:53:40] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 1 ms to minimize.
[2024-06-01 03:53:40] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 3 ms to minimize.
[2024-06-01 03:53:40] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 2 ms to minimize.
[2024-06-01 03:53:41] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-06-01 03:53:41] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2024-06-01 03:53:41] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-06-01 03:53:41] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2024-06-01 03:53:41] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2024-06-01 03:53:41] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 2 ms to minimize.
[2024-06-01 03:53:42] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-01 03:53:44] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 2 ms to minimize.
[2024-06-01 03:53:44] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 3 ms to minimize.
[2024-06-01 03:53:44] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 2 ms to minimize.
[2024-06-01 03:53:44] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 2 ms to minimize.
[2024-06-01 03:53:45] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 2 ms to minimize.
[2024-06-01 03:53:45] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 2 ms to minimize.
[2024-06-01 03:53:46] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 7/87 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-01 03:53:49] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 2 ms to minimize.
[2024-06-01 03:53:49] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 2 ms to minimize.
[2024-06-01 03:53:49] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 2 ms to minimize.
[2024-06-01 03:53:49] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 2 ms to minimize.
[2024-06-01 03:53:50] [INFO ] Deduced a trap composed of 51 places in 163 ms of which 2 ms to minimize.
[2024-06-01 03:53:50] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-01 03:53:53] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 1 ms to minimize.
[2024-06-01 03:53:53] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 2 ms to minimize.
[2024-06-01 03:53:54] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 1 ms to minimize.
[2024-06-01 03:53:54] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 8 (OVERLAPS) 446/681 variables, 235/332 constraints. Problems are: Problem set: 2 solved, 443 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/681 variables, 443/775 constraints. Problems are: Problem set: 2 solved, 443 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 681/681 variables, and 775 constraints, problems are : Problem set: 2 solved, 443 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 443/445 constraints, Known Traps: 86/86 constraints]
After SMT, in 60877ms problems are : Problem set: 2 solved, 443 unsolved
Search for dead transitions found 2 dead transitions in 60882ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 235/250 places, 444/605 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 444
Applied a total of 1 rules in 4 ms. Remains 234 /235 variables (removed 1) and now considering 444/444 (removed 0) transitions.
// Phase 1: matrix 444 rows 234 cols
[2024-06-01 03:54:06] [INFO ] Computed 11 invariants in 3 ms
[2024-06-01 03:54:06] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-06-01 03:54:06] [INFO ] Invariant cache hit.
[2024-06-01 03:54:06] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 234/250 places, 444/605 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61978 ms. Remains : 234/250 places, 444/605 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 367 steps with 3 reset in 1 ms.
FORMULA AutonomousCar-PT-06b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLCardinality-08 finished in 62169 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 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 238 transition count 593
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 238 transition count 593
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 168 place count 238 transition count 449
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 171 place count 235 transition count 446
Iterating global reduction 1 with 3 rules applied. Total rules applied 174 place count 235 transition count 446
Applied a total of 174 rules in 12 ms. Remains 235 /250 variables (removed 15) and now considering 446/605 (removed 159) transitions.
// Phase 1: matrix 446 rows 235 cols
[2024-06-01 03:54:06] [INFO ] Computed 11 invariants in 3 ms
[2024-06-01 03:54:06] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-06-01 03:54:06] [INFO ] Invariant cache hit.
[2024-06-01 03:54:07] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-06-01 03:54:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-01 03:54:12] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 3 ms to minimize.
[2024-06-01 03:54:13] [INFO ] Deduced a trap composed of 55 places in 215 ms of which 3 ms to minimize.
[2024-06-01 03:54:13] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 2 ms to minimize.
[2024-06-01 03:54:13] [INFO ] Deduced a trap composed of 53 places in 193 ms of which 2 ms to minimize.
[2024-06-01 03:54:13] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 2 ms to minimize.
[2024-06-01 03:54:14] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2024-06-01 03:54:14] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 5 ms to minimize.
[2024-06-01 03:54:14] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 2 ms to minimize.
[2024-06-01 03:54:14] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 2 ms to minimize.
[2024-06-01 03:54:14] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 2 ms to minimize.
[2024-06-01 03:54:15] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 2 ms to minimize.
[2024-06-01 03:54:15] [INFO ] Deduced a trap composed of 44 places in 199 ms of which 2 ms to minimize.
[2024-06-01 03:54:15] [INFO ] Deduced a trap composed of 33 places in 401 ms of which 3 ms to minimize.
[2024-06-01 03:54:15] [INFO ] Deduced a trap composed of 42 places in 204 ms of which 2 ms to minimize.
[2024-06-01 03:54:16] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 2 ms to minimize.
[2024-06-01 03:54:16] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 2 ms to minimize.
[2024-06-01 03:54:16] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 2 ms to minimize.
[2024-06-01 03:54:16] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 2 ms to minimize.
[2024-06-01 03:54:16] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 2 ms to minimize.
[2024-06-01 03:54:17] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-01 03:54:17] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 2 ms to minimize.
[2024-06-01 03:54:17] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 3 ms to minimize.
[2024-06-01 03:54:18] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 2 ms to minimize.
[2024-06-01 03:54:18] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 3 ms to minimize.
[2024-06-01 03:54:18] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 2 ms to minimize.
[2024-06-01 03:54:18] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 2 ms to minimize.
[2024-06-01 03:54:18] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 2 ms to minimize.
[2024-06-01 03:54:19] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 2 ms to minimize.
[2024-06-01 03:54:19] [INFO ] Deduced a trap composed of 57 places in 198 ms of which 2 ms to minimize.
[2024-06-01 03:54:19] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 2 ms to minimize.
[2024-06-01 03:54:19] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 2 ms to minimize.
[2024-06-01 03:54:20] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 2 ms to minimize.
[2024-06-01 03:54:20] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 2 ms to minimize.
[2024-06-01 03:54:20] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 2 ms to minimize.
[2024-06-01 03:54:20] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 2 ms to minimize.
[2024-06-01 03:54:20] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
[2024-06-01 03:54:20] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 3 ms to minimize.
[2024-06-01 03:54:21] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 2 ms to minimize.
[2024-06-01 03:54:21] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 2 ms to minimize.
[2024-06-01 03:54:21] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-01 03:54:24] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 2 ms to minimize.
[2024-06-01 03:54:24] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 2 ms to minimize.
[2024-06-01 03:54:24] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 2 ms to minimize.
[2024-06-01 03:54:25] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 1 ms to minimize.
[2024-06-01 03:54:25] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 2 ms to minimize.
[2024-06-01 03:54:25] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 2 ms to minimize.
[2024-06-01 03:54:26] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 1 ms to minimize.
[2024-06-01 03:54:26] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 1 ms to minimize.
[2024-06-01 03:54:26] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-06-01 03:54:26] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 2 ms to minimize.
[2024-06-01 03:54:26] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 1 ms to minimize.
[2024-06-01 03:54:27] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 2 ms to minimize.
[2024-06-01 03:54:27] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 2 ms to minimize.
[2024-06-01 03:54:27] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-01 03:54:31] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-06-01 03:54:31] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 2 ms to minimize.
[2024-06-01 03:54:32] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-01 03:54:34] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 2 ms to minimize.
[2024-06-01 03:54:34] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 2 ms to minimize.
[2024-06-01 03:54:35] [INFO ] Deduced a trap composed of 54 places in 178 ms of which 2 ms to minimize.
[2024-06-01 03:54:35] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 2 ms to minimize.
[2024-06-01 03:54:35] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2024-06-01 03:54:36] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 1 ms to minimize.
[2024-06-01 03:54:36] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 2 ms to minimize.
[2024-06-01 03:54:36] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/681 variables, and 76 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-01 03:54:41] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 2 ms to minimize.
[2024-06-01 03:54:41] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 2 ms to minimize.
[2024-06-01 03:54:41] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 2 ms to minimize.
[2024-06-01 03:54:42] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-06-01 03:54:42] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 2 ms to minimize.
[2024-06-01 03:54:42] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 1 ms to minimize.
[2024-06-01 03:54:42] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-06-01 03:54:43] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 8/84 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-01 03:54:45] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 2 ms to minimize.
[2024-06-01 03:54:46] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-01 03:54:50] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 2 ms to minimize.
[2024-06-01 03:54:50] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 1 ms to minimize.
[2024-06-01 03:54:50] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 7 (OVERLAPS) 446/681 variables, 235/324 constraints. Problems are: Problem set: 2 solved, 443 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/681 variables, 443/767 constraints. Problems are: Problem set: 2 solved, 443 unsolved
[2024-06-01 03:55:07] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 681/681 variables, and 768 constraints, problems are : Problem set: 2 solved, 443 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 443/445 constraints, Known Traps: 79/79 constraints]
After SMT, in 60850ms problems are : Problem set: 2 solved, 443 unsolved
Search for dead transitions found 2 dead transitions in 60856ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 235/250 places, 444/605 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 444
Applied a total of 1 rules in 3 ms. Remains 234 /235 variables (removed 1) and now considering 444/444 (removed 0) transitions.
// Phase 1: matrix 444 rows 234 cols
[2024-06-01 03:55:08] [INFO ] Computed 11 invariants in 2 ms
[2024-06-01 03:55:08] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-06-01 03:55:08] [INFO ] Invariant cache hit.
[2024-06-01 03:55:08] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 234/250 places, 444/605 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61872 ms. Remains : 234/250 places, 444/605 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 253 ms.
Product exploration explored 100000 steps with 50000 reset in 206 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Computed a total of 38 stabilizing places and 38 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-06b-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06b-LTLCardinality-09 finished in 62528 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(p0))'
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Graph (trivial) has 237 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 247 transition count 505
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 134 rules applied. Total rules applied 232 place count 150 transition count 468
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 254 place count 128 transition count 468
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 254 place count 128 transition count 462
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 266 place count 122 transition count 462
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 273 place count 115 transition count 455
Iterating global reduction 3 with 7 rules applied. Total rules applied 280 place count 115 transition count 455
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 283 place count 112 transition count 430
Iterating global reduction 3 with 3 rules applied. Total rules applied 286 place count 112 transition count 430
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 4 rules applied. Total rules applied 290 place count 112 transition count 426
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 292 place count 110 transition count 426
Performed 49 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 390 place count 61 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 391 place count 61 transition count 375
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 401 place count 51 transition count 249
Iterating global reduction 6 with 10 rules applied. Total rules applied 411 place count 51 transition count 249
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 415 place count 51 transition count 245
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 417 place count 50 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 419 place count 48 transition count 242
Applied a total of 419 rules in 100 ms. Remains 48 /250 variables (removed 202) and now considering 242/605 (removed 363) transitions.
// Phase 1: matrix 242 rows 48 cols
[2024-06-01 03:55:09] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 03:55:09] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-06-01 03:55:09] [INFO ] Invariant cache hit.
[2024-06-01 03:55:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 03:55:09] [INFO ] Implicit Places using invariants and state equation in 188 ms returned [43, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 335 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/250 places, 242/605 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 241
Applied a total of 2 rules in 12 ms. Remains 45 /46 variables (removed 1) and now considering 241/242 (removed 1) transitions.
// Phase 1: matrix 241 rows 45 cols
[2024-06-01 03:55:09] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 03:55:09] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 03:55:09] [INFO ] Invariant cache hit.
[2024-06-01 03:55:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:55:10] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/250 places, 241/605 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 854 ms. Remains : 45/250 places, 241/605 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-11
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLCardinality-11 finished in 901 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(p1)||p0)))'
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 240 transition count 595
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 240 transition count 595
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 164 place count 240 transition count 451
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 167 place count 237 transition count 448
Iterating global reduction 1 with 3 rules applied. Total rules applied 170 place count 237 transition count 448
Applied a total of 170 rules in 8 ms. Remains 237 /250 variables (removed 13) and now considering 448/605 (removed 157) transitions.
// Phase 1: matrix 448 rows 237 cols
[2024-06-01 03:55:10] [INFO ] Computed 11 invariants in 2 ms
[2024-06-01 03:55:10] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 03:55:10] [INFO ] Invariant cache hit.
[2024-06-01 03:55:10] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 447 sub problems to find dead transitions.
[2024-06-01 03:55:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-01 03:55:16] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 3 ms to minimize.
[2024-06-01 03:55:16] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 2 ms to minimize.
[2024-06-01 03:55:17] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 3 ms to minimize.
[2024-06-01 03:55:17] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-06-01 03:55:17] [INFO ] Deduced a trap composed of 54 places in 190 ms of which 3 ms to minimize.
[2024-06-01 03:55:17] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 2 ms to minimize.
[2024-06-01 03:55:17] [INFO ] Deduced a trap composed of 55 places in 189 ms of which 3 ms to minimize.
[2024-06-01 03:55:17] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 2 ms to minimize.
[2024-06-01 03:55:18] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 2 ms to minimize.
[2024-06-01 03:55:18] [INFO ] Deduced a trap composed of 70 places in 196 ms of which 3 ms to minimize.
[2024-06-01 03:55:18] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 2 ms to minimize.
[2024-06-01 03:55:18] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 2 ms to minimize.
[2024-06-01 03:55:19] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 2 ms to minimize.
[2024-06-01 03:55:19] [INFO ] Deduced a trap composed of 40 places in 186 ms of which 2 ms to minimize.
[2024-06-01 03:55:19] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 2 ms to minimize.
[2024-06-01 03:55:19] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 2 ms to minimize.
[2024-06-01 03:55:19] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 2 ms to minimize.
[2024-06-01 03:55:20] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 2 ms to minimize.
[2024-06-01 03:55:20] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 2 ms to minimize.
[2024-06-01 03:55:20] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-01 03:55:21] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 3 ms to minimize.
[2024-06-01 03:55:21] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 2 ms to minimize.
[2024-06-01 03:55:21] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 3 ms to minimize.
[2024-06-01 03:55:21] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 2 ms to minimize.
[2024-06-01 03:55:22] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 2 ms to minimize.
[2024-06-01 03:55:22] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 2 ms to minimize.
[2024-06-01 03:55:22] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 2 ms to minimize.
[2024-06-01 03:55:22] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 3 ms to minimize.
[2024-06-01 03:55:22] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 2 ms to minimize.
[2024-06-01 03:55:23] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 2 ms to minimize.
[2024-06-01 03:55:23] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 2 ms to minimize.
[2024-06-01 03:55:23] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 2 ms to minimize.
[2024-06-01 03:55:24] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 2 ms to minimize.
[2024-06-01 03:55:24] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 2 ms to minimize.
[2024-06-01 03:55:24] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 2 ms to minimize.
[2024-06-01 03:55:24] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 2 ms to minimize.
[2024-06-01 03:55:24] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 2 ms to minimize.
[2024-06-01 03:55:24] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 8 ms to minimize.
[2024-06-01 03:55:25] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 1 ms to minimize.
[2024-06-01 03:55:25] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-01 03:55:27] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 3 ms to minimize.
[2024-06-01 03:55:28] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 2 ms to minimize.
[2024-06-01 03:55:28] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 2 ms to minimize.
[2024-06-01 03:55:28] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 2 ms to minimize.
[2024-06-01 03:55:28] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 2 ms to minimize.
[2024-06-01 03:55:30] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 2 ms to minimize.
[2024-06-01 03:55:30] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 2 ms to minimize.
[2024-06-01 03:55:30] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-01 03:55:32] [INFO ] Deduced a trap composed of 59 places in 207 ms of which 3 ms to minimize.
[2024-06-01 03:55:33] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 2 ms to minimize.
[2024-06-01 03:55:33] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 2 ms to minimize.
[2024-06-01 03:55:33] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 1 ms to minimize.
[2024-06-01 03:55:33] [INFO ] Deduced a trap composed of 48 places in 133 ms of which 2 ms to minimize.
[2024-06-01 03:55:33] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 2 ms to minimize.
[2024-06-01 03:55:34] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 1 ms to minimize.
[2024-06-01 03:55:34] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 1 ms to minimize.
[2024-06-01 03:55:34] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2024-06-01 03:55:34] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 2 ms to minimize.
[2024-06-01 03:55:34] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
[2024-06-01 03:55:34] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-06-01 03:55:35] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-06-01 03:55:35] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
[2024-06-01 03:55:35] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 1 ms to minimize.
[2024-06-01 03:55:35] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
[2024-06-01 03:55:35] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-06-01 03:55:35] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 1 ms to minimize.
[2024-06-01 03:55:35] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-06-01 03:55:36] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-01 03:55:37] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2024-06-01 03:55:37] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 1 ms to minimize.
[2024-06-01 03:55:38] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 237/685 variables, and 82 constraints, problems are : Problem set: 0 solved, 447 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/237 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 447 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 71/82 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 4 (OVERLAPS) 448/685 variables, 237/319 constraints. Problems are: Problem set: 2 solved, 445 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/685 variables, 445/764 constraints. Problems are: Problem set: 2 solved, 445 unsolved
[2024-06-01 03:55:58] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 2 ms to minimize.
[2024-06-01 03:55:59] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 2 ms to minimize.
[2024-06-01 03:55:59] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 3 ms to minimize.
[2024-06-01 03:55:59] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/685 variables, 4/768 constraints. Problems are: Problem set: 2 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 685/685 variables, and 768 constraints, problems are : Problem set: 2 solved, 445 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 445/447 constraints, Known Traps: 75/75 constraints]
After SMT, in 60981ms problems are : Problem set: 2 solved, 445 unsolved
Search for dead transitions found 2 dead transitions in 60998ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 237/250 places, 446/605 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 236 transition count 446
Applied a total of 1 rules in 3 ms. Remains 236 /237 variables (removed 1) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 236 cols
[2024-06-01 03:56:11] [INFO ] Computed 11 invariants in 2 ms
[2024-06-01 03:56:11] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 03:56:11] [INFO ] Invariant cache hit.
[2024-06-01 03:56:12] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 236/250 places, 446/605 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61964 ms. Remains : 236/250 places, 446/605 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 116 ms.
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Computed a total of 38 stabilizing places and 38 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 23 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-06b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06b-LTLCardinality-15 finished in 62366 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' '!(G(F(p0)))'
[2024-06-01 03:56:13] [INFO ] Flatten gal took : 87 ms
[2024-06-01 03:56:13] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 14 ms.
[2024-06-01 03:56:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 250 places, 605 transitions and 3734 arcs took 33 ms.
Total runtime 452900 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutonomousCar-PT-06b-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717214394453

--------------------
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-06b-LTLCardinality-03
ltl formula formula --ltl=/tmp/2560/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 250 places, 605 transitions and 3734 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.270 real 0.070 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2560/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2560/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2560/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2560/ltl_0_
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 252 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 251, there are 614 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( 3/ 4): ~95 levels ~10000 states ~36968 transitions
pnml2lts-mc( 0/ 4): ~94 levels ~20000 states ~94528 transitions
pnml2lts-mc( 3/ 4): ~95 levels ~40000 states ~171588 transitions
pnml2lts-mc( 3/ 4): ~95 levels ~80000 states ~372512 transitions
pnml2lts-mc( 3/ 4): ~97 levels ~160000 states ~785216 transitions
pnml2lts-mc( 3/ 4): ~97 levels ~320000 states ~1594880 transitions
pnml2lts-mc( 3/ 4): ~97 levels ~640000 states ~3468392 transitions
pnml2lts-mc( 3/ 4): ~97 levels ~1280000 states ~7174588 transitions
pnml2lts-mc( 3/ 4): ~105 levels ~2560000 states ~14775796 transitions
pnml2lts-mc( 3/ 4): ~107 levels ~5120000 states ~30975540 transitions
pnml2lts-mc( 3/ 4): ~107 levels ~10240000 states ~64976040 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~185!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 17946215
pnml2lts-mc( 0/ 4): unique states count: 18036910
pnml2lts-mc( 0/ 4): unique transitions count: 117769152
pnml2lts-mc( 0/ 4): - self-loop count: 447
pnml2lts-mc( 0/ 4): - claim dead count: 99638010
pnml2lts-mc( 0/ 4): - claim found count: 89869
pnml2lts-mc( 0/ 4): - claim success count: 18036924
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1048
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 18036924 states 117769211 transitions, fanout: 6.529
pnml2lts-mc( 0/ 4): Total exploration time 220.080 sec (220.060 sec minimum, 220.070 sec on average)
pnml2lts-mc( 0/ 4): States per second: 81956, Transitions per second: 535120
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 138.6MB, 8.1 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 53.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 617 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 138.6MB (~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-06b"
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-06b, 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-171620167400307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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