About the Execution of LTSMin+red for AutonomousCar-PT-10b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5073.504 | 3366715.00 | 11482430.00 | 2552.70 | TTFTFTFFFFTTTFTF | normal |
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-171620167600371.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-10b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167600371
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 18:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 18:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M 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-10b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717226218519
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-10b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:17:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:17:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:17:02] [INFO ] Load time of PNML (sax parser for PT used): 663 ms
[2024-06-01 07:17:02] [INFO ] Transformed 425 places.
[2024-06-01 07:17:02] [INFO ] Transformed 2252 transitions.
[2024-06-01 07:17:02] [INFO ] Found NUPN structural information;
[2024-06-01 07:17:02] [INFO ] Parsed PT model containing 425 places and 2252 transitions and 29816 arcs in 1101 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-10b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 2252/2252 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 366 transition count 2193
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 366 transition count 2193
Ensure Unique test removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 518 place count 366 transition count 1793
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 528 place count 356 transition count 1783
Iterating global reduction 1 with 10 rules applied. Total rules applied 538 place count 356 transition count 1783
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 539 place count 355 transition count 1782
Iterating global reduction 1 with 1 rules applied. Total rules applied 540 place count 355 transition count 1782
Applied a total of 540 rules in 190 ms. Remains 355 /425 variables (removed 70) and now considering 1782/2252 (removed 470) transitions.
// Phase 1: matrix 1782 rows 355 cols
[2024-06-01 07:17:02] [INFO ] Computed 15 invariants in 74 ms
[2024-06-01 07:17:04] [INFO ] Implicit Places using invariants in 1498 ms returned []
[2024-06-01 07:17:04] [INFO ] Invariant cache hit.
[2024-06-01 07:17:06] [INFO ] Implicit Places using invariants and state equation in 2031 ms returned []
Implicit Place search using SMT with State Equation took 3585 ms to find 0 implicit places.
Running 1781 sub problems to find dead transitions.
[2024-06-01 07:17:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1781 unsolved
SMT process timed out in 56942ms, After SMT, problems are : Problem set: 0 solved, 1781 unsolved
Search for dead transitions found 0 dead transitions in 57005ms
Starting structural reductions in LTL mode, iteration 1 : 355/425 places, 1782/2252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60827 ms. Remains : 355/425 places, 1782/2252 transitions.
Support contains 22 out of 355 places after structural reductions.
[2024-06-01 07:18:04] [INFO ] Flatten gal took : 626 ms
[2024-06-01 07:18:04] [INFO ] Flatten gal took : 298 ms
[2024-06-01 07:18:05] [INFO ] Input system was already deterministic with 1782 transitions.
Support contains 20 out of 355 places (down from 22) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (306 resets) in 4315 ms. (9 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (42 resets) in 217 ms. (183 steps per ms) remains 1/1 properties
[2024-06-01 07:18:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 117/121 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 234/355 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1782/2137 variables, 355/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2137 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2137 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2137/2137 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 932 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 355/355 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 117/121 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 234/355 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 14 places in 2012 ms of which 62 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 26 places in 2130 ms of which 5 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 33 places in 1840 ms of which 5 ms to minimize.
SMT process timed out in 7165ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 355 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 1782/1782 transitions.
Graph (trivial) has 331 edges and 355 vertex of which 4 / 355 are part of one of the 2 SCC in 8 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1870 edges and 353 vertex of which 351 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.54 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 132 rules applied. Total rules applied 134 place count 351 transition count 1646
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 188 rules applied. Total rules applied 322 place count 221 transition count 1588
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 36 rules applied. Total rules applied 358 place count 187 transition count 1586
Reduce places removed 2 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 4 rules applied. Total rules applied 362 place count 185 transition count 1584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 363 place count 184 transition count 1584
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 363 place count 184 transition count 1578
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 375 place count 178 transition count 1578
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 381 place count 172 transition count 1572
Iterating global reduction 5 with 6 rules applied. Total rules applied 387 place count 172 transition count 1572
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 390 place count 169 transition count 1551
Iterating global reduction 5 with 3 rules applied. Total rules applied 393 place count 169 transition count 1551
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 5 with 4 rules applied. Total rules applied 397 place count 169 transition count 1547
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 399 place count 167 transition count 1547
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 3 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 7 with 146 rules applied. Total rules applied 545 place count 94 transition count 1474
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 562 place count 77 transition count 1295
Iterating global reduction 7 with 17 rules applied. Total rules applied 579 place count 77 transition count 1295
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 586 place count 77 transition count 1288
Free-agglomeration rule applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 597 place count 77 transition count 1277
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 608 place count 66 transition count 1277
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 609 place count 66 transition count 1276
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 611 place count 66 transition count 1276
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 612 place count 65 transition count 1275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 613 place count 64 transition count 1275
Applied a total of 613 rules in 1360 ms. Remains 64 /355 variables (removed 291) and now considering 1275/1782 (removed 507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1361 ms. Remains : 64/355 places, 1275/1782 transitions.
RANDOM walk for 40000 steps (180 resets) in 1424 ms. (28 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (201 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 493783 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 1
Probabilistic random walk after 493783 steps, saw 75416 distinct states, run finished after 3006 ms. (steps per millisecond=164 ) properties seen :0
// Phase 1: matrix 1275 rows 64 cols
[2024-06-01 07:18:18] [INFO ] Computed 14 invariants in 23 ms
[2024-06-01 07:18:18] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1112/1132 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 207/1339 variables, 44/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1339 variables, 10/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1339 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1339 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1339 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1339/1339 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1112/1132 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Int declared 1339/1339 variables, and 68 constraints, problems are : Problem set: 1 solved, 0 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 4/14 constraints, State Equation: 64/64 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1008ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA AutonomousCar-PT-10b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 55 stabilizing places and 56 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(p0)))'
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 355/355 places, 1782/1782 transitions.
Graph (trivial) has 337 edges and 355 vertex of which 4 / 355 are part of one of the 2 SCC in 2 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 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 132 place count 352 transition count 1648
Reduce places removed 131 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 188 rules applied. Total rules applied 320 place count 221 transition count 1591
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 354 place count 187 transition count 1591
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 354 place count 187 transition count 1584
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 368 place count 180 transition count 1584
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 375 place count 173 transition count 1577
Iterating global reduction 3 with 7 rules applied. Total rules applied 382 place count 173 transition count 1577
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 385 place count 170 transition count 1556
Iterating global reduction 3 with 3 rules applied. Total rules applied 388 place count 170 transition count 1556
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 392 place count 170 transition count 1552
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 394 place count 168 transition count 1552
Performed 75 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 544 place count 93 transition count 1476
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 562 place count 75 transition count 1286
Iterating global reduction 5 with 18 rules applied. Total rules applied 580 place count 75 transition count 1286
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 588 place count 75 transition count 1278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 590 place count 73 transition count 1276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 591 place count 72 transition count 1276
Applied a total of 591 rules in 710 ms. Remains 72 /355 variables (removed 283) and now considering 1276/1782 (removed 506) transitions.
// Phase 1: matrix 1276 rows 72 cols
[2024-06-01 07:18:20] [INFO ] Computed 13 invariants in 15 ms
[2024-06-01 07:18:21] [INFO ] Implicit Places using invariants in 874 ms returned []
[2024-06-01 07:18:21] [INFO ] Invariant cache hit.
[2024-06-01 07:18:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 07:18:23] [INFO ] Implicit Places using invariants and state equation in 1755 ms returned [67, 71]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2637 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/355 places, 1276/1782 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 69 transition count 1275
Applied a total of 2 rules in 168 ms. Remains 69 /70 variables (removed 1) and now considering 1275/1276 (removed 1) transitions.
// Phase 1: matrix 1275 rows 69 cols
[2024-06-01 07:18:23] [INFO ] Computed 11 invariants in 17 ms
[2024-06-01 07:18:24] [INFO ] Implicit Places using invariants in 1054 ms returned []
[2024-06-01 07:18:24] [INFO ] Invariant cache hit.
[2024-06-01 07:18:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 07:18:26] [INFO ] Implicit Places using invariants and state equation in 1739 ms returned []
Implicit Place search using SMT with State Equation took 2798 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/355 places, 1275/1782 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6314 ms. Remains : 69/355 places, 1275/1782 transitions.
Stuttering acceptance computed with spot in 304 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLCardinality-00
Product exploration explored 100000 steps with 3478 reset in 1050 ms.
Product exploration explored 100000 steps with 992 reset in 344 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 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
RANDOM walk for 155 steps (6 resets) in 7 ms. (19 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 209 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 1 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 1275/1275 transitions.
Applied a total of 0 rules in 135 ms. Remains 69 /69 variables (removed 0) and now considering 1275/1275 (removed 0) transitions.
[2024-06-01 07:18:28] [INFO ] Invariant cache hit.
[2024-06-01 07:18:29] [INFO ] Implicit Places using invariants in 846 ms returned []
[2024-06-01 07:18:29] [INFO ] Invariant cache hit.
[2024-06-01 07:18:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 07:18:31] [INFO ] Implicit Places using invariants and state equation in 1646 ms returned []
Implicit Place search using SMT with State Equation took 2512 ms to find 0 implicit places.
[2024-06-01 07:18:31] [INFO ] Redundant transitions in 191 ms returned [1273]
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 1272 sub problems to find dead transitions.
// Phase 1: matrix 1274 rows 69 cols
[2024-06-01 07:18:31] [INFO ] Computed 11 invariants in 14 ms
[2024-06-01 07:18:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1272 unsolved
At refinement iteration 2 (OVERLAPS) 1273/1341 variables, 68/79 constraints. Problems are: Problem set: 0 solved, 1272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1341/1343 variables, and 79 constraints, problems are : Problem set: 0 solved, 1272 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 68/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1272/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1272 unsolved
At refinement iteration 2 (OVERLAPS) 1273/1341 variables, 68/79 constraints. Problems are: Problem set: 0 solved, 1272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1341 variables, 47/126 constraints. Problems are: Problem set: 0 solved, 1272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1341/1343 variables, and 126 constraints, problems are : Problem set: 0 solved, 1272 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 68/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1272/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 82880ms problems are : Problem set: 0 solved, 1272 unsolved
Search for dead transitions found 0 dead transitions in 82912ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/69 places, 1274/1275 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 1272
Applied a total of 2 rules in 137 ms. Remains 67 /69 variables (removed 2) and now considering 1272/1274 (removed 2) transitions.
// Phase 1: matrix 1272 rows 67 cols
[2024-06-01 07:19:54] [INFO ] Computed 11 invariants in 12 ms
[2024-06-01 07:19:55] [INFO ] Implicit Places using invariants in 743 ms returned []
[2024-06-01 07:19:55] [INFO ] Invariant cache hit.
[2024-06-01 07:19:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 07:19:56] [INFO ] Implicit Places using invariants and state equation in 1646 ms returned []
Implicit Place search using SMT with State Equation took 2396 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/69 places, 1272/1275 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88302 ms. Remains : 67/69 places, 1272/1275 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 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 179 steps (7 resets) in 8 ms. (19 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 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 535 reset in 268 ms.
Product exploration explored 100000 steps with 1965 reset in 705 ms.
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 1272/1272 transitions.
Applied a total of 0 rules in 81 ms. Remains 67 /67 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2024-06-01 07:19:58] [INFO ] Invariant cache hit.
[2024-06-01 07:19:59] [INFO ] Implicit Places using invariants in 837 ms returned []
[2024-06-01 07:19:59] [INFO ] Invariant cache hit.
[2024-06-01 07:19:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 07:20:00] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 2336 ms to find 0 implicit places.
[2024-06-01 07:20:00] [INFO ] Redundant transitions in 58 ms returned []
Running 1271 sub problems to find dead transitions.
[2024-06-01 07:20:00] [INFO ] Invariant cache hit.
[2024-06-01 07:20:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 2 (OVERLAPS) 1271/1338 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1338/1339 variables, and 78 constraints, problems are : Problem set: 0 solved, 1271 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 67/67 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1271/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 2 (OVERLAPS) 1271/1338 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1338 variables, 44/122 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1338/1339 variables, and 122 constraints, problems are : Problem set: 0 solved, 1271 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 67/67 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1271/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 83702ms problems are : Problem set: 0 solved, 1271 unsolved
Search for dead transitions found 0 dead transitions in 83729ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 86216 ms. Remains : 67/67 places, 1272/1272 transitions.
Treatment of property AutonomousCar-PT-10b-LTLCardinality-00 finished in 185407 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 2 out of 355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 355/355 places, 1782/1782 transitions.
Graph (trivial) has 336 edges and 355 vertex of which 4 / 355 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 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 131 place count 352 transition count 1649
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 189 rules applied. Total rules applied 320 place count 222 transition count 1590
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 36 rules applied. Total rules applied 356 place count 187 transition count 1589
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 357 place count 186 transition count 1589
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 357 place count 186 transition count 1582
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 371 place count 179 transition count 1582
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 378 place count 172 transition count 1575
Iterating global reduction 4 with 7 rules applied. Total rules applied 385 place count 172 transition count 1575
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 388 place count 169 transition count 1554
Iterating global reduction 4 with 3 rules applied. Total rules applied 391 place count 169 transition count 1554
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 4 with 4 rules applied. Total rules applied 395 place count 169 transition count 1550
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 397 place count 167 transition count 1550
Performed 74 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 6 with 148 rules applied. Total rules applied 545 place count 93 transition count 1475
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 562 place count 76 transition count 1296
Iterating global reduction 6 with 17 rules applied. Total rules applied 579 place count 76 transition count 1296
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 587 place count 76 transition count 1288
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 589 place count 74 transition count 1286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 590 place count 73 transition count 1286
Applied a total of 590 rules in 378 ms. Remains 73 /355 variables (removed 282) and now considering 1286/1782 (removed 496) transitions.
// Phase 1: matrix 1286 rows 73 cols
[2024-06-01 07:21:25] [INFO ] Computed 13 invariants in 12 ms
[2024-06-01 07:21:26] [INFO ] Implicit Places using invariants in 696 ms returned []
[2024-06-01 07:21:26] [INFO ] Invariant cache hit.
[2024-06-01 07:21:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 07:21:28] [INFO ] Implicit Places using invariants and state equation in 1437 ms returned [68, 72]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2138 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/355 places, 1286/1782 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 70 transition count 1285
Applied a total of 2 rules in 172 ms. Remains 70 /71 variables (removed 1) and now considering 1285/1286 (removed 1) transitions.
// Phase 1: matrix 1285 rows 70 cols
[2024-06-01 07:21:28] [INFO ] Computed 11 invariants in 11 ms
[2024-06-01 07:21:28] [INFO ] Implicit Places using invariants in 740 ms returned []
[2024-06-01 07:21:28] [INFO ] Invariant cache hit.
[2024-06-01 07:21:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 07:21:30] [INFO ] Implicit Places using invariants and state equation in 1499 ms returned []
Implicit Place search using SMT with State Equation took 2241 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/355 places, 1285/1782 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4930 ms. Remains : 70/355 places, 1285/1782 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLCardinality-01
Product exploration explored 100000 steps with 1480 reset in 966 ms.
Product exploration explored 100000 steps with 732 reset in 368 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 198 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 6 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 206 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 1285/1285 transitions.
Applied a total of 0 rules in 146 ms. Remains 70 /70 variables (removed 0) and now considering 1285/1285 (removed 0) transitions.
[2024-06-01 07:21:32] [INFO ] Invariant cache hit.
[2024-06-01 07:21:33] [INFO ] Implicit Places using invariants in 1006 ms returned []
[2024-06-01 07:21:33] [INFO ] Invariant cache hit.
[2024-06-01 07:21:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 07:21:35] [INFO ] Implicit Places using invariants and state equation in 1775 ms returned []
Implicit Place search using SMT with State Equation took 2785 ms to find 0 implicit places.
[2024-06-01 07:21:35] [INFO ] Redundant transitions in 88 ms returned [1283]
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 1282 sub problems to find dead transitions.
// Phase 1: matrix 1284 rows 70 cols
[2024-06-01 07:21:35] [INFO ] Computed 11 invariants in 13 ms
[2024-06-01 07:21:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 24 places in 1646 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 69/1354 variables, and 12 constraints, problems are : Problem set: 0 solved, 1282 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/70 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1282/46 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 3 (OVERLAPS) 1/69 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 5 (OVERLAPS) 1283/1352 variables, 69/81 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1352 variables, 46/127 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1352/1354 variables, and 127 constraints, problems are : Problem set: 0 solved, 1282 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 69/70 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1282/46 constraints, Known Traps: 1/1 constraints]
After SMT, in 83190ms problems are : Problem set: 0 solved, 1282 unsolved
Search for dead transitions found 0 dead transitions in 83218ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/70 places, 1284/1285 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 68 transition count 1282
Applied a total of 2 rules in 171 ms. Remains 68 /70 variables (removed 2) and now considering 1282/1284 (removed 2) transitions.
// Phase 1: matrix 1282 rows 68 cols
[2024-06-01 07:22:58] [INFO ] Computed 11 invariants in 11 ms
[2024-06-01 07:22:59] [INFO ] Implicit Places using invariants in 1037 ms returned []
[2024-06-01 07:22:59] [INFO ] Invariant cache hit.
[2024-06-01 07:23:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 07:23:01] [INFO ] Implicit Places using invariants and state equation in 1746 ms returned []
Implicit Place search using SMT with State Equation took 2785 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/70 places, 1282/1285 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 89206 ms. Remains : 68/70 places, 1282/1285 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1454 reset in 846 ms.
Product exploration explored 100000 steps with 897 reset in 412 ms.
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 1282/1282 transitions.
Applied a total of 0 rules in 85 ms. Remains 68 /68 variables (removed 0) and now considering 1282/1282 (removed 0) transitions.
[2024-06-01 07:23:03] [INFO ] Invariant cache hit.
[2024-06-01 07:23:04] [INFO ] Implicit Places using invariants in 860 ms returned []
[2024-06-01 07:23:04] [INFO ] Invariant cache hit.
[2024-06-01 07:23:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 07:23:06] [INFO ] Implicit Places using invariants and state equation in 1774 ms returned []
Implicit Place search using SMT with State Equation took 2651 ms to find 0 implicit places.
[2024-06-01 07:23:06] [INFO ] Redundant transitions in 85 ms returned []
Running 1281 sub problems to find dead transitions.
[2024-06-01 07:23:06] [INFO ] Invariant cache hit.
[2024-06-01 07:23:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
[2024-06-01 07:23:53] [INFO ] Deduced a trap composed of 24 places in 1677 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 68/1350 variables, and 12 constraints, problems are : Problem set: 0 solved, 1281 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/68 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1281/43 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 5 (OVERLAPS) 1281/1349 variables, 68/80 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1349 variables, 43/123 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1349/1350 variables, and 123 constraints, problems are : Problem set: 0 solved, 1281 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 68/68 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1281/43 constraints, Known Traps: 1/1 constraints]
After SMT, in 84086ms problems are : Problem set: 0 solved, 1281 unsolved
Search for dead transitions found 0 dead transitions in 84111ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 86944 ms. Remains : 68/68 places, 1282/1282 transitions.
Treatment of property AutonomousCar-PT-10b-LTLCardinality-01 finished in 185127 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 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 1782/1782 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 348 transition count 1775
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 347 transition count 1774
Applied a total of 16 rules in 44 ms. Remains 347 /355 variables (removed 8) and now considering 1774/1782 (removed 8) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-06-01 07:24:30] [INFO ] Computed 15 invariants in 21 ms
[2024-06-01 07:24:31] [INFO ] Implicit Places using invariants in 1217 ms returned []
[2024-06-01 07:24:31] [INFO ] Invariant cache hit.
[2024-06-01 07:24:34] [INFO ] Implicit Places using invariants and state equation in 2162 ms returned []
Implicit Place search using SMT with State Equation took 3382 ms to find 0 implicit places.
Running 1773 sub problems to find dead transitions.
[2024-06-01 07:24:34] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
SMT process timed out in 56161ms, After SMT, problems are : Problem set: 0 solved, 1773 unsolved
Search for dead transitions found 0 dead transitions in 56182ms
Starting structural reductions in LTL mode, iteration 1 : 347/355 places, 1774/1782 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59613 ms. Remains : 347/355 places, 1774/1782 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLCardinality-02
Stuttering criterion allowed to conclude after 299 steps with 2 reset in 3 ms.
FORMULA AutonomousCar-PT-10b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLCardinality-02 finished in 59744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p1) U p2))||p0)))'
Support contains 4 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 1782/1782 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 351 transition count 1778
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 351 transition count 1778
Applied a total of 8 rules in 30 ms. Remains 351 /355 variables (removed 4) and now considering 1778/1782 (removed 4) transitions.
// Phase 1: matrix 1778 rows 351 cols
[2024-06-01 07:25:30] [INFO ] Computed 15 invariants in 23 ms
[2024-06-01 07:25:31] [INFO ] Implicit Places using invariants in 860 ms returned []
[2024-06-01 07:25:31] [INFO ] Invariant cache hit.
[2024-06-01 07:25:32] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 2451 ms to find 0 implicit places.
Running 1777 sub problems to find dead transitions.
[2024-06-01 07:25:32] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1777 unsolved
SMT process timed out in 55332ms, After SMT, problems are : Problem set: 0 solved, 1777 unsolved
Search for dead transitions found 0 dead transitions in 55353ms
Starting structural reductions in LTL mode, iteration 1 : 351/355 places, 1778/1782 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57840 ms. Remains : 351/355 places, 1778/1782 transitions.
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 1351 ms.
Product exploration explored 100000 steps with 50000 reset in 286 ms.
Computed a total of 54 stabilizing places and 55 stable transitions
Computed a total of 54 stabilizing places and 55 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 15 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10b-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10b-LTLCardinality-05 finished in 59829 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 1782/1782 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 349 transition count 1776
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 349 transition count 1776
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 348 transition count 1775
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 348 transition count 1775
Applied a total of 14 rules in 52 ms. Remains 348 /355 variables (removed 7) and now considering 1775/1782 (removed 7) transitions.
// Phase 1: matrix 1775 rows 348 cols
[2024-06-01 07:26:30] [INFO ] Computed 15 invariants in 15 ms
[2024-06-01 07:26:31] [INFO ] Implicit Places using invariants in 1320 ms returned []
[2024-06-01 07:26:31] [INFO ] Invariant cache hit.
[2024-06-01 07:26:33] [INFO ] Implicit Places using invariants and state equation in 2212 ms returned []
Implicit Place search using SMT with State Equation took 3534 ms to find 0 implicit places.
Running 1774 sub problems to find dead transitions.
[2024-06-01 07:26:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/347 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1774 unsolved
SMT process timed out in 55411ms, After SMT, problems are : Problem set: 0 solved, 1774 unsolved
Search for dead transitions found 0 dead transitions in 55445ms
Starting structural reductions in LTL mode, iteration 1 : 348/355 places, 1775/1782 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59050 ms. Remains : 348/355 places, 1775/1782 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLCardinality-06 finished in 59239 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 2 out of 355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 355/355 places, 1782/1782 transitions.
Graph (trivial) has 334 edges and 355 vertex of which 4 / 355 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 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 134 place count 352 transition count 1646
Reduce places removed 133 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 192 rules applied. Total rules applied 326 place count 219 transition count 1587
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 361 place count 184 transition count 1587
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 361 place count 184 transition count 1581
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 373 place count 178 transition count 1581
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 379 place count 172 transition count 1575
Iterating global reduction 3 with 6 rules applied. Total rules applied 385 place count 172 transition count 1575
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 388 place count 169 transition count 1554
Iterating global reduction 3 with 3 rules applied. Total rules applied 391 place count 169 transition count 1554
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 395 place count 169 transition count 1550
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 397 place count 167 transition count 1550
Performed 73 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 543 place count 94 transition count 1476
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 559 place count 78 transition count 1308
Iterating global reduction 5 with 16 rules applied. Total rules applied 575 place count 78 transition count 1308
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 583 place count 78 transition count 1300
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 585 place count 76 transition count 1298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 586 place count 75 transition count 1298
Applied a total of 586 rules in 361 ms. Remains 75 /355 variables (removed 280) and now considering 1298/1782 (removed 484) transitions.
// Phase 1: matrix 1298 rows 75 cols
[2024-06-01 07:27:29] [INFO ] Computed 13 invariants in 10 ms
[2024-06-01 07:27:30] [INFO ] Implicit Places using invariants in 884 ms returned []
[2024-06-01 07:27:30] [INFO ] Invariant cache hit.
[2024-06-01 07:27:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 07:27:32] [INFO ] Implicit Places using invariants and state equation in 1438 ms returned [70, 74]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2331 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/355 places, 1298/1782 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 72 transition count 1297
Applied a total of 2 rules in 171 ms. Remains 72 /73 variables (removed 1) and now considering 1297/1298 (removed 1) transitions.
// Phase 1: matrix 1297 rows 72 cols
[2024-06-01 07:27:32] [INFO ] Computed 11 invariants in 7 ms
[2024-06-01 07:27:32] [INFO ] Implicit Places using invariants in 688 ms returned []
[2024-06-01 07:27:33] [INFO ] Invariant cache hit.
[2024-06-01 07:27:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 07:27:34] [INFO ] Implicit Places using invariants and state equation in 1814 ms returned []
Implicit Place search using SMT with State Equation took 2506 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/355 places, 1297/1782 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5369 ms. Remains : 72/355 places, 1297/1782 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLCardinality-08
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLCardinality-08 finished in 5435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(F(p1))))))'
Support contains 4 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 1782/1782 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 349 transition count 1776
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 349 transition count 1776
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 348 transition count 1775
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 348 transition count 1775
Applied a total of 14 rules in 41 ms. Remains 348 /355 variables (removed 7) and now considering 1775/1782 (removed 7) transitions.
// Phase 1: matrix 1775 rows 348 cols
[2024-06-01 07:27:34] [INFO ] Computed 15 invariants in 11 ms
[2024-06-01 07:27:36] [INFO ] Implicit Places using invariants in 1109 ms returned []
[2024-06-01 07:27:36] [INFO ] Invariant cache hit.
[2024-06-01 07:27:38] [INFO ] Implicit Places using invariants and state equation in 2015 ms returned []
Implicit Place search using SMT with State Equation took 3127 ms to find 0 implicit places.
Running 1774 sub problems to find dead transitions.
[2024-06-01 07:27:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/347 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1774 unsolved
SMT process timed out in 56018ms, After SMT, problems are : Problem set: 0 solved, 1774 unsolved
Search for dead transitions found 0 dead transitions in 56039ms
Starting structural reductions in LTL mode, iteration 1 : 348/355 places, 1775/1782 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59212 ms. Remains : 348/355 places, 1775/1782 transitions.
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLCardinality-09
Stuttering criterion allowed to conclude after 122 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-10b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLCardinality-09 finished in 59468 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-06-01 07:28:35] [INFO ] Flatten gal took : 329 ms
[2024-06-01 07:28:35] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 07:28:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 355 places, 1782 transitions and 26476 arcs took 44 ms.
Total runtime 694235 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutonomousCar-PT-10b-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-10b-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717229585234
--------------------
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-10b-LTLCardinality-00
ltl formula formula --ltl=/tmp/986/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 355 places, 1782 transitions and 26476 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.400 real 0.080 user 0.110 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/986/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/986/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/986/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/986/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 356 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 356, there are 1788 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( 2/ 4): ~144 levels ~10000 states ~40636 transitions
pnml2lts-mc( 2/ 4): ~144 levels ~20000 states ~83544 transitions
pnml2lts-mc( 2/ 4): ~144 levels ~40000 states ~185612 transitions
pnml2lts-mc( 2/ 4): ~144 levels ~80000 states ~387464 transitions
pnml2lts-mc( 2/ 4): ~144 levels ~160000 states ~852168 transitions
pnml2lts-mc( 2/ 4): ~144 levels ~320000 states ~1792128 transitions
pnml2lts-mc( 2/ 4): ~144 levels ~640000 states ~3899736 transitions
pnml2lts-mc( 3/ 4): ~136 levels ~1280000 states ~6731344 transitions
pnml2lts-mc( 3/ 4): ~136 levels ~2560000 states ~14408876 transitions
pnml2lts-mc( 3/ 4): ~136 levels ~5120000 states ~29506808 transitions
pnml2lts-mc( 3/ 4): ~136 levels ~10240000 states ~63518152 transitions
pnml2lts-mc( 3/ 4): ~143 levels ~20480000 states ~129117956 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33551563
pnml2lts-mc( 0/ 4): unique states count: 33552004
pnml2lts-mc( 0/ 4): unique transitions count: 238733414
pnml2lts-mc( 0/ 4): - self-loop count: 227
pnml2lts-mc( 0/ 4): - claim dead count: 205178752
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33552020
pnml2lts-mc( 0/ 4): - cum. max stack depth: 564
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33552020 states 238733500 transitions, fanout: 7.115
pnml2lts-mc( 0/ 4): Total exploration time 1297.230 sec (1297.200 sec minimum, 1297.218 sec on average)
pnml2lts-mc( 0/ 4): States per second: 25864, Transitions per second: 184033
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 266.3MB, 8.3 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/16.0%
pnml2lts-mc( 0/ 4): Stored 1812 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 266.3MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-10b-LTLCardinality-01
ltl formula formula --ltl=/tmp/986/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 355 places, 1782 transitions and 26476 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.310 real 0.110 user 0.090 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/986/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/986/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/986/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/986/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 356 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 356, there are 1794 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~131 levels ~10000 states ~32984 transitions
pnml2lts-mc( 0/ 4): ~131 levels ~20000 states ~73976 transitions
pnml2lts-mc( 0/ 4): ~131 levels ~40000 states ~163972 transitions
pnml2lts-mc( 0/ 4): ~131 levels ~80000 states ~351916 transitions
pnml2lts-mc( 0/ 4): ~131 levels ~160000 states ~783496 transitions
pnml2lts-mc( 0/ 4): ~131 levels ~320000 states ~1711468 transitions
pnml2lts-mc( 0/ 4): ~131 levels ~640000 states ~3551060 transitions
pnml2lts-mc( 0/ 4): ~131 levels ~1280000 states ~7487016 transitions
pnml2lts-mc( 0/ 4): ~131 levels ~2560000 states ~15551504 transitions
pnml2lts-mc( 0/ 4): ~138 levels ~5120000 states ~31288360 transitions
pnml2lts-mc( 2/ 4): ~127 levels ~10240000 states ~59032280 transitions
pnml2lts-mc( 2/ 4): ~127 levels ~20480000 states ~123708272 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33551725
pnml2lts-mc( 0/ 4): unique states count: 33552142
pnml2lts-mc( 0/ 4): unique transitions count: 239952172
pnml2lts-mc( 0/ 4): - self-loop count: 446
pnml2lts-mc( 0/ 4): - claim dead count: 206397263
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33552161
pnml2lts-mc( 0/ 4): - cum. max stack depth: 553
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33552161 states 239952288 transitions, fanout: 7.152
pnml2lts-mc( 0/ 4): Total exploration time 1370.230 sec (1370.220 sec minimum, 1370.225 sec on average)
pnml2lts-mc( 0/ 4): States per second: 24487, Transitions per second: 175118
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 267.1MB, 8.3 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/17.0%
pnml2lts-mc( 0/ 4): Stored 1812 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 267.1MB (~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-10b"
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-10b, 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-171620167600371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-10b.tgz
mv AutonomousCar-PT-10b 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 '
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 ;