Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813598200667.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is AutonomousCar-PT-09b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598200667
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 865K Mar 5 18:22 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-09b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678640519243

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:02:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 17:02:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:02:02] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2023-03-12 17:02:02] [INFO ] Transformed 391 places.
[2023-03-12 17:02:02] [INFO ] Transformed 1554 transitions.
[2023-03-12 17:02:02] [INFO ] Found NUPN structural information;
[2023-03-12 17:02:02] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 340 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutonomousCar-PT-09b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 391 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 341 transition count 1504
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 341 transition count 1504
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 0 with 324 rules applied. Total rules applied 424 place count 341 transition count 1180
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 434 place count 331 transition count 1170
Iterating global reduction 1 with 10 rules applied. Total rules applied 444 place count 331 transition count 1170
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 445 place count 330 transition count 1169
Iterating global reduction 1 with 1 rules applied. Total rules applied 446 place count 330 transition count 1169
Applied a total of 446 rules in 146 ms. Remains 330 /391 variables (removed 61) and now considering 1169/1554 (removed 385) transitions.
// Phase 1: matrix 1169 rows 330 cols
[2023-03-12 17:02:03] [INFO ] Computed 14 place invariants in 25 ms
[2023-03-12 17:02:03] [INFO ] Implicit Places using invariants in 949 ms returned []
[2023-03-12 17:02:03] [INFO ] Invariant cache hit.
[2023-03-12 17:02:05] [INFO ] Implicit Places using invariants and state equation in 1338 ms returned []
Implicit Place search using SMT with State Equation took 2329 ms to find 0 implicit places.
[2023-03-12 17:02:05] [INFO ] Invariant cache hit.
[2023-03-12 17:02:06] [INFO ] Dead Transitions using invariants and state equation in 1153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 330/391 places, 1169/1554 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3630 ms. Remains : 330/391 places, 1169/1554 transitions.
Support contains 34 out of 330 places after structural reductions.
[2023-03-12 17:02:07] [INFO ] Flatten gal took : 256 ms
[2023-03-12 17:02:07] [INFO ] Flatten gal took : 164 ms
[2023-03-12 17:02:07] [INFO ] Input system was already deterministic with 1169 transitions.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 19) seen :16
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 17:02:08] [INFO ] Invariant cache hit.
[2023-03-12 17:02:08] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-12 17:02:08] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 17:02:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-12 17:02:09] [INFO ] After 639ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 17:02:09] [INFO ] Deduced a trap composed of 11 places in 675 ms of which 6 ms to minimize.
[2023-03-12 17:02:11] [INFO ] Deduced a trap composed of 48 places in 1049 ms of which 2 ms to minimize.
[2023-03-12 17:02:11] [INFO ] Deduced a trap composed of 33 places in 570 ms of which 2 ms to minimize.
[2023-03-12 17:02:12] [INFO ] Deduced a trap composed of 47 places in 784 ms of which 1 ms to minimize.
[2023-03-12 17:02:13] [INFO ] Deduced a trap composed of 50 places in 668 ms of which 42 ms to minimize.
[2023-03-12 17:02:13] [INFO ] Deduced a trap composed of 49 places in 686 ms of which 0 ms to minimize.
[2023-03-12 17:02:15] [INFO ] Deduced a trap composed of 50 places in 1310 ms of which 1 ms to minimize.
[2023-03-12 17:02:15] [INFO ] Deduced a trap composed of 33 places in 576 ms of which 16 ms to minimize.
[2023-03-12 17:02:16] [INFO ] Deduced a trap composed of 50 places in 649 ms of which 1 ms to minimize.
[2023-03-12 17:02:17] [INFO ] Deduced a trap composed of 55 places in 484 ms of which 0 ms to minimize.
[2023-03-12 17:02:17] [INFO ] Deduced a trap composed of 35 places in 636 ms of which 1 ms to minimize.
[2023-03-12 17:02:18] [INFO ] Deduced a trap composed of 34 places in 521 ms of which 1 ms to minimize.
[2023-03-12 17:02:18] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 9110 ms
[2023-03-12 17:02:18] [INFO ] Deduced a trap composed of 19 places in 455 ms of which 0 ms to minimize.
[2023-03-12 17:02:19] [INFO ] Deduced a trap composed of 31 places in 470 ms of which 0 ms to minimize.
[2023-03-12 17:02:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1055 ms
[2023-03-12 17:02:19] [INFO ] After 11009ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 294 ms.
[2023-03-12 17:02:19] [INFO ] After 11466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 89 ms.
Support contains 9 out of 330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 1169/1169 transitions.
Graph (trivial) has 300 edges and 330 vertex of which 4 / 330 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1591 edges and 328 vertex of which 326 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 118 rules applied. Total rules applied 120 place count 326 transition count 1047
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 162 rules applied. Total rules applied 282 place count 210 transition count 1001
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 28 rules applied. Total rules applied 310 place count 183 transition count 1000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 311 place count 182 transition count 1000
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 311 place count 182 transition count 991
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 329 place count 173 transition count 991
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 331 place count 171 transition count 989
Iterating global reduction 4 with 2 rules applied. Total rules applied 333 place count 171 transition count 989
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 333 place count 171 transition count 988
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 335 place count 170 transition count 988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 479 place count 98 transition count 916
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 495 place count 82 transition count 773
Iterating global reduction 4 with 16 rules applied. Total rules applied 511 place count 82 transition count 773
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 519 place count 82 transition count 765
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 520 place count 82 transition count 764
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 532 place count 82 transition count 752
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 544 place count 70 transition count 752
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 546 place count 70 transition count 750
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 547 place count 70 transition count 750
Applied a total of 547 rules in 690 ms. Remains 70 /330 variables (removed 260) and now considering 750/1169 (removed 419) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 691 ms. Remains : 70/330 places, 750/1169 transitions.
Finished random walk after 1511 steps, including 13 resets, run visited all 3 properties in 30 ms. (steps per millisecond=50 )
FORMULA AutonomousCar-PT-09b-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutonomousCar-PT-09b-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 50 stabilizing places and 51 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 2 out of 330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 330/330 places, 1169/1169 transitions.
Graph (trivial) has 311 edges and 330 vertex of which 4 / 330 are part of one of the 2 SCC in 0 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 removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 327 transition count 1045
Reduce places removed 121 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 173 rules applied. Total rules applied 295 place count 206 transition count 993
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 32 rules applied. Total rules applied 327 place count 175 transition count 992
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 328 place count 174 transition count 992
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 328 place count 174 transition count 985
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 342 place count 167 transition count 985
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 348 place count 161 transition count 979
Iterating global reduction 4 with 6 rules applied. Total rules applied 354 place count 161 transition count 979
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 354 place count 161 transition count 978
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 356 place count 160 transition count 978
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 357 place count 159 transition count 969
Iterating global reduction 4 with 1 rules applied. Total rules applied 358 place count 159 transition count 969
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 359 place count 159 transition count 968
Performed 70 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 499 place count 89 transition count 897
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 517 place count 71 transition count 734
Iterating global reduction 5 with 18 rules applied. Total rules applied 535 place count 71 transition count 734
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 543 place count 71 transition count 726
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 6 with 2 rules applied. Total rules applied 545 place count 70 transition count 725
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 546 place count 70 transition count 725
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 548 place count 68 transition count 723
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 549 place count 67 transition count 723
Applied a total of 549 rules in 290 ms. Remains 67 /330 variables (removed 263) and now considering 723/1169 (removed 446) transitions.
// Phase 1: matrix 723 rows 67 cols
[2023-03-12 17:02:21] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-12 17:02:22] [INFO ] Implicit Places using invariants in 557 ms returned []
[2023-03-12 17:02:22] [INFO ] Invariant cache hit.
[2023-03-12 17:02:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:02:22] [INFO ] Implicit Places using invariants and state equation in 703 ms returned [62, 66]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1264 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/330 places, 723/1169 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 64 transition count 722
Applied a total of 2 rules in 90 ms. Remains 64 /65 variables (removed 1) and now considering 722/723 (removed 1) transitions.
// Phase 1: matrix 722 rows 64 cols
[2023-03-12 17:02:22] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-12 17:02:23] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-03-12 17:02:23] [INFO ] Invariant cache hit.
[2023-03-12 17:02:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:02:24] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1336 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/330 places, 722/1169 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2993 ms. Remains : 64/330 places, 722/1169 transitions.
Stuttering acceptance computed with spot in 444 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s45 0), p1:(EQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-09b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLCardinality-00 finished in 3556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(((p0 U p1)||G(F(p0)))) U p0)))'
Support contains 4 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 1169/1169 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 320 transition count 1159
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 320 transition count 1159
Applied a total of 20 rules in 32 ms. Remains 320 /330 variables (removed 10) and now considering 1159/1169 (removed 10) transitions.
// Phase 1: matrix 1159 rows 320 cols
[2023-03-12 17:02:24] [INFO ] Computed 14 place invariants in 33 ms
[2023-03-12 17:02:25] [INFO ] Implicit Places using invariants in 511 ms returned []
[2023-03-12 17:02:25] [INFO ] Invariant cache hit.
[2023-03-12 17:02:26] [INFO ] Implicit Places using invariants and state equation in 1264 ms returned []
Implicit Place search using SMT with State Equation took 1803 ms to find 0 implicit places.
[2023-03-12 17:02:26] [INFO ] Invariant cache hit.
[2023-03-12 17:02:27] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 320/330 places, 1159/1169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2541 ms. Remains : 320/330 places, 1159/1169 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s202 0) (EQ s234 1)), p1:(OR (EQ s281 0) (EQ s115 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 454 ms.
Product exploration explored 100000 steps with 50000 reset in 387 ms.
Computed a total of 49 stabilizing places and 50 stable transitions
Computed a total of 49 stabilizing places and 50 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 140 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-09b-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-09b-LTLCardinality-01 finished in 3842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 1169/1169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 319 transition count 1158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 319 transition count 1158
Applied a total of 22 rules in 31 ms. Remains 319 /330 variables (removed 11) and now considering 1158/1169 (removed 11) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2023-03-12 17:02:28] [INFO ] Computed 14 place invariants in 7 ms
[2023-03-12 17:02:29] [INFO ] Implicit Places using invariants in 599 ms returned []
[2023-03-12 17:02:29] [INFO ] Invariant cache hit.
[2023-03-12 17:02:30] [INFO ] Implicit Places using invariants and state equation in 1134 ms returned []
Implicit Place search using SMT with State Equation took 1754 ms to find 0 implicit places.
[2023-03-12 17:02:30] [INFO ] Invariant cache hit.
[2023-03-12 17:02:31] [INFO ] Dead Transitions using invariants and state equation in 965 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/330 places, 1158/1169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2774 ms. Remains : 319/330 places, 1158/1169 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s27 0) (EQ s225 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLCardinality-02 finished in 2905 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 1169/1169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 319 transition count 1158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 319 transition count 1158
Applied a total of 22 rules in 12 ms. Remains 319 /330 variables (removed 11) and now considering 1158/1169 (removed 11) transitions.
[2023-03-12 17:02:31] [INFO ] Invariant cache hit.
[2023-03-12 17:02:32] [INFO ] Implicit Places using invariants in 734 ms returned []
[2023-03-12 17:02:32] [INFO ] Invariant cache hit.
[2023-03-12 17:02:33] [INFO ] Implicit Places using invariants and state equation in 1133 ms returned []
Implicit Place search using SMT with State Equation took 1916 ms to find 0 implicit places.
[2023-03-12 17:02:33] [INFO ] Invariant cache hit.
[2023-03-12 17:02:34] [INFO ] Dead Transitions using invariants and state equation in 831 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/330 places, 1158/1169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2773 ms. Remains : 319/330 places, 1158/1169 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s22 0) (EQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 278 ms.
Product exploration explored 100000 steps with 33333 reset in 243 ms.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Detected a total of 48/319 stabilizing places and 49/1158 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-09b-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-09b-LTLCardinality-04 finished in 3573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&F(p1))))'
Support contains 3 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 1169/1169 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 320 transition count 1159
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 320 transition count 1159
Applied a total of 20 rules in 11 ms. Remains 320 /330 variables (removed 10) and now considering 1159/1169 (removed 10) transitions.
// Phase 1: matrix 1159 rows 320 cols
[2023-03-12 17:02:35] [INFO ] Computed 14 place invariants in 7 ms
[2023-03-12 17:02:35] [INFO ] Implicit Places using invariants in 811 ms returned []
[2023-03-12 17:02:35] [INFO ] Invariant cache hit.
[2023-03-12 17:02:36] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1766 ms to find 0 implicit places.
[2023-03-12 17:02:36] [INFO ] Invariant cache hit.
[2023-03-12 17:02:37] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 320/330 places, 1159/1169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2499 ms. Remains : 320/330 places, 1159/1169 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s29 0) (EQ s117 1)), p0:(EQ s254 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 149 steps with 2 reset in 1 ms.
FORMULA AutonomousCar-PT-09b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLCardinality-05 finished in 2664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p1))||p0))))'
Support contains 5 out of 330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 330/330 places, 1169/1169 transitions.
Graph (trivial) has 306 edges and 330 vertex of which 4 / 330 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 removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 327 transition count 1048
Reduce places removed 118 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 164 rules applied. Total rules applied 283 place count 209 transition count 1002
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 28 rules applied. Total rules applied 311 place count 182 transition count 1001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 312 place count 181 transition count 1001
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 312 place count 181 transition count 992
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 330 place count 172 transition count 992
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 335 place count 167 transition count 987
Iterating global reduction 4 with 5 rules applied. Total rules applied 340 place count 167 transition count 987
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 341 place count 166 transition count 978
Iterating global reduction 4 with 1 rules applied. Total rules applied 342 place count 166 transition count 978
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 344 place count 166 transition count 976
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 345 place count 165 transition count 976
Performed 71 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 6 with 142 rules applied. Total rules applied 487 place count 94 transition count 904
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 504 place count 77 transition count 751
Iterating global reduction 6 with 17 rules applied. Total rules applied 521 place count 77 transition count 751
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 529 place count 77 transition count 743
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 531 place count 76 transition count 742
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 533 place count 76 transition count 742
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 535 place count 74 transition count 740
Applied a total of 535 rules in 220 ms. Remains 74 /330 variables (removed 256) and now considering 740/1169 (removed 429) transitions.
// Phase 1: matrix 740 rows 74 cols
[2023-03-12 17:02:37] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-12 17:02:38] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-12 17:02:38] [INFO ] Invariant cache hit.
[2023-03-12 17:02:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:02:39] [INFO ] Implicit Places using invariants and state equation in 977 ms returned [69, 73]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1449 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/330 places, 740/1169 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 71 transition count 739
Applied a total of 2 rules in 66 ms. Remains 71 /72 variables (removed 1) and now considering 739/740 (removed 1) transitions.
// Phase 1: matrix 739 rows 71 cols
[2023-03-12 17:02:39] [INFO ] Computed 11 place invariants in 12 ms
[2023-03-12 17:02:39] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-12 17:02:39] [INFO ] Invariant cache hit.
[2023-03-12 17:02:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:02:40] [INFO ] Implicit Places using invariants and state equation in 1159 ms returned []
Implicit Place search using SMT with State Equation took 1582 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/330 places, 739/1169 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3317 ms. Remains : 71/330 places, 739/1169 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s64 1) (AND (NEQ s44 0) (NEQ s30 1))), p1:(AND (NEQ s0 0) (NEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 637 reset in 181 ms.
Product exploration explored 100000 steps with 262 reset in 125 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 305 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 577 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 657920 steps, run timeout after 3005 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 657920 steps, saw 102432 distinct states, run finished after 3006 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 17:02:45] [INFO ] Invariant cache hit.
[2023-03-12 17:02:45] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 17:02:45] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:02:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 17:02:45] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:02:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:02:45] [INFO ] After 82ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 17:02:46] [INFO ] Deduced a trap composed of 2 places in 466 ms of which 1 ms to minimize.
[2023-03-12 17:02:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 506 ms
[2023-03-12 17:02:46] [INFO ] After 714ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-12 17:02:46] [INFO ] After 1162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 5 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 739/739 transitions.
Graph (complete) has 851 edges and 71 vertex of which 70 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 70 transition count 736
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 13 place count 70 transition count 726
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 60 transition count 726
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 60 transition count 724
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 60 transition count 727
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 59 transition count 727
Applied a total of 27 rules in 133 ms. Remains 59 /71 variables (removed 12) and now considering 727/739 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 59/71 places, 727/739 transitions.
Finished random walk after 159 steps, including 1 resets, run visited all 2 properties in 3 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 365 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 739/739 transitions.
Applied a total of 0 rules in 64 ms. Remains 71 /71 variables (removed 0) and now considering 739/739 (removed 0) transitions.
[2023-03-12 17:02:47] [INFO ] Invariant cache hit.
[2023-03-12 17:02:48] [INFO ] Implicit Places using invariants in 610 ms returned []
[2023-03-12 17:02:48] [INFO ] Invariant cache hit.
[2023-03-12 17:02:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:02:48] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1517 ms to find 0 implicit places.
[2023-03-12 17:02:49] [INFO ] Redundant transitions in 61 ms returned [733]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 738 rows 71 cols
[2023-03-12 17:02:49] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 17:02:49] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/71 places, 738/739 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 69 transition count 738
Applied a total of 2 rules in 47 ms. Remains 69 /71 variables (removed 2) and now considering 738/738 (removed 0) transitions.
// Phase 1: matrix 738 rows 69 cols
[2023-03-12 17:02:49] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-12 17:02:50] [INFO ] Implicit Places using invariants in 519 ms returned []
[2023-03-12 17:02:50] [INFO ] Invariant cache hit.
[2023-03-12 17:02:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:02:51] [INFO ] Implicit Places using invariants and state equation in 859 ms returned []
Implicit Place search using SMT with State Equation took 1415 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/71 places, 738/739 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3738 ms. Remains : 69/71 places, 738/739 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 329 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 625 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 681229 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{}
Probabilistic random walk after 681229 steps, saw 108440 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 17:02:54] [INFO ] Invariant cache hit.
[2023-03-12 17:02:54] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:02:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-12 17:02:55] [INFO ] After 353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:02:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:02:55] [INFO ] After 56ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 17:02:55] [INFO ] Deduced a trap composed of 3 places in 326 ms of which 1 ms to minimize.
[2023-03-12 17:02:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
[2023-03-12 17:02:55] [INFO ] After 453ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-12 17:02:55] [INFO ] After 981ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 738/738 transitions.
Graph (complete) has 845 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 68 transition count 735
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 13 place count 68 transition count 725
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 58 transition count 725
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 58 transition count 723
Applied a total of 25 rules in 121 ms. Remains 58 /69 variables (removed 11) and now considering 723/738 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 58/69 places, 723/738 transitions.
Finished random walk after 1639 steps, including 24 resets, run visited all 2 properties in 14 ms. (steps per millisecond=117 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 339 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 287 reset in 94 ms.
Product exploration explored 100000 steps with 2287 reset in 369 ms.
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 738/738 transitions.
Applied a total of 0 rules in 31 ms. Remains 69 /69 variables (removed 0) and now considering 738/738 (removed 0) transitions.
[2023-03-12 17:02:57] [INFO ] Invariant cache hit.
[2023-03-12 17:02:57] [INFO ] Implicit Places using invariants in 458 ms returned []
[2023-03-12 17:02:57] [INFO ] Invariant cache hit.
[2023-03-12 17:02:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:02:58] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1319 ms to find 0 implicit places.
[2023-03-12 17:02:58] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-12 17:02:58] [INFO ] Invariant cache hit.
[2023-03-12 17:02:59] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1865 ms. Remains : 69/69 places, 738/738 transitions.
Treatment of property AutonomousCar-PT-09b-LTLCardinality-07 finished in 21720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&G(p1)) U (p2 U X(p3))))'
Support contains 6 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 1169/1169 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 321 transition count 1160
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 321 transition count 1160
Applied a total of 18 rules in 14 ms. Remains 321 /330 variables (removed 9) and now considering 1160/1169 (removed 9) transitions.
// Phase 1: matrix 1160 rows 321 cols
[2023-03-12 17:02:59] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-12 17:03:00] [INFO ] Implicit Places using invariants in 576 ms returned []
[2023-03-12 17:03:00] [INFO ] Invariant cache hit.
[2023-03-12 17:03:00] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1528 ms to find 0 implicit places.
[2023-03-12 17:03:00] [INFO ] Invariant cache hit.
[2023-03-12 17:03:01] [INFO ] Dead Transitions using invariants and state equation in 886 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 321/330 places, 1160/1169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2429 ms. Remains : 321/330 places, 1160/1169 transitions.
Stuttering acceptance computed with spot in 445 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), true, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p0 p1 (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p2 (NOT p0) (NOT p3)) (AND p2 (NOT p1) (NOT p3))), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (EQ s198 0) (EQ s58 1)), p0:(OR (EQ s231 0) (EQ s117 1)), p1:(OR (EQ s231 0) (EQ s117 1) (EQ s63 0) (EQ s17 1)), p3:(OR (EQ s63 0) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 332 ms.
Product exploration explored 100000 steps with 50000 reset in 339 ms.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND p2 p0 p1 p3), (X (NOT (OR (AND p2 (NOT p0) (NOT p3)) (AND p2 (NOT p1) (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p3)))), (X p3), (X (NOT (AND (NOT p2) p0 p1 (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X p1)), true, (X (X (NOT (OR (AND p2 (NOT p0) (NOT p3)) (AND p2 (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p3)
Knowledge based reduction with 21 factoid took 656 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-09b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-09b-LTLCardinality-15 finished in 4258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p1))||p0))))'
[2023-03-12 17:03:04] [INFO ] Flatten gal took : 119 ms
[2023-03-12 17:03:04] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 17:03:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 330 places, 1169 transitions and 13529 arcs took 20 ms.
Total runtime 61856 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/987/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutonomousCar-PT-09b-LTLCardinality-07

BK_STOP 1678640585250

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutonomousCar-PT-09b-LTLCardinality-07
ltl formula formula --ltl=/tmp/987/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 330 places, 1169 transitions and 13529 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.380 real 0.150 user 0.160 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/987/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/987/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/987/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/987/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5562d56ab3f4]
1: pnml2lts-mc(+0xa2496) [0x5562d56ab496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f0532cdb140]
3: pnml2lts-mc(+0x405be5) [0x5562d5a0ebe5]
4: pnml2lts-mc(+0x16b3f9) [0x5562d57743f9]
5: pnml2lts-mc(+0x164ac4) [0x5562d576dac4]
6: pnml2lts-mc(+0x272e0a) [0x5562d587be0a]
7: pnml2lts-mc(+0xb61f0) [0x5562d56bf1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f0532b2e4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f0532b2e67a]
10: pnml2lts-mc(+0xa1581) [0x5562d56aa581]
11: pnml2lts-mc(+0xa1910) [0x5562d56aa910]
12: pnml2lts-mc(+0xa32a2) [0x5562d56ac2a2]
13: pnml2lts-mc(+0xa50f4) [0x5562d56ae0f4]
14: pnml2lts-mc(+0x3f34b3) [0x5562d59fc4b3]
15: pnml2lts-mc(+0x7c63d) [0x5562d568563d]
16: pnml2lts-mc(+0x67d86) [0x5562d5670d86]
17: pnml2lts-mc(+0x60a8a) [0x5562d5669a8a]
18: pnml2lts-mc(+0x5eb15) [0x5562d5667b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f0532b16d0a]
20: pnml2lts-mc(+0x6075e) [0x5562d566975e]

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-09b"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-09b, 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 r009-oct2-167813598200667"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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