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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 18:08 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 865K 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-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 1717221491736

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
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:58:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:58:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:58:14] [INFO ] Load time of PNML (sax parser for PT used): 479 ms
[2024-06-01 05:58:14] [INFO ] Transformed 391 places.
[2024-06-01 05:58:14] [INFO ] Transformed 1554 transitions.
[2024-06-01 05:58:14] [INFO ] Found NUPN structural information;
[2024-06-01 05:58:14] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 710 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA AutonomousCar-PT-09b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 391 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 339 transition count 1502
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 339 transition count 1502
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 0 with 324 rules applied. Total rules applied 428 place count 339 transition count 1178
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 439 place count 328 transition count 1167
Iterating global reduction 1 with 11 rules applied. Total rules applied 450 place count 328 transition count 1167
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 451 place count 327 transition count 1166
Iterating global reduction 1 with 1 rules applied. Total rules applied 452 place count 327 transition count 1166
Applied a total of 452 rules in 290 ms. Remains 327 /391 variables (removed 64) and now considering 1166/1554 (removed 388) transitions.
// Phase 1: matrix 1166 rows 327 cols
[2024-06-01 05:58:15] [INFO ] Computed 14 invariants in 46 ms
[2024-06-01 05:58:15] [INFO ] Implicit Places using invariants in 844 ms returned []
[2024-06-01 05:58:15] [INFO ] Invariant cache hit.
[2024-06-01 05:58:17] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned []
Implicit Place search using SMT with State Equation took 2058 ms to find 0 implicit places.
Running 1165 sub problems to find dead transitions.
[2024-06-01 05:58:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1165 unsolved
At refinement iteration 1 (OVERLAPS) 1/327 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1165 unsolved
[2024-06-01 05:58:56] [INFO ] Deduced a trap composed of 18 places in 1267 ms of which 99 ms to minimize.
[2024-06-01 05:58:57] [INFO ] Deduced a trap composed of 24 places in 903 ms of which 5 ms to minimize.
[2024-06-01 05:58:58] [INFO ] Deduced a trap composed of 45 places in 701 ms of which 4 ms to minimize.
[2024-06-01 05:58:59] [INFO ] Deduced a trap composed of 45 places in 646 ms of which 4 ms to minimize.
[2024-06-01 05:59:00] [INFO ] Deduced a trap composed of 41 places in 1047 ms of which 5 ms to minimize.
[2024-06-01 05:59:01] [INFO ] Deduced a trap composed of 42 places in 891 ms of which 9 ms to minimize.
[2024-06-01 05:59:01] [INFO ] Deduced a trap composed of 70 places in 801 ms of which 6 ms to minimize.
[2024-06-01 05:59:03] [INFO ] Deduced a trap composed of 64 places in 1060 ms of which 6 ms to minimize.
[2024-06-01 05:59:04] [INFO ] Deduced a trap composed of 54 places in 1056 ms of which 5 ms to minimize.
[2024-06-01 05:59:05] [INFO ] Deduced a trap composed of 60 places in 1046 ms of which 6 ms to minimize.
[2024-06-01 05:59:06] [INFO ] Deduced a trap composed of 50 places in 983 ms of which 6 ms to minimize.
SMT process timed out in 48979ms, After SMT, problems are : Problem set: 0 solved, 1165 unsolved
Search for dead transitions found 0 dead transitions in 49041ms
Starting structural reductions in LTL mode, iteration 1 : 327/391 places, 1166/1554 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51439 ms. Remains : 327/391 places, 1166/1554 transitions.
Support contains 20 out of 327 places after structural reductions.
[2024-06-01 05:59:07] [INFO ] Flatten gal took : 365 ms
[2024-06-01 05:59:07] [INFO ] Flatten gal took : 161 ms
[2024-06-01 05:59:07] [INFO ] Input system was already deterministic with 1166 transitions.
RANDOM walk for 40000 steps (285 resets) in 1901 ms. (21 steps per ms) remains 1/12 properties
BEST_FIRST walk for 40003 steps (52 resets) in 312 ms. (127 steps per ms) remains 1/1 properties
[2024-06-01 05:59:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/96 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 231/327 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1166/1493 variables, 327/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1493 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1493 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1493/1493 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 608 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 327/327 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/96 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 231/327 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:59:10] [INFO ] Deduced a trap composed of 6 places in 1020 ms of which 3 ms to minimize.
[2024-06-01 05:59:11] [INFO ] Deduced a trap composed of 14 places in 1068 ms of which 4 ms to minimize.
[2024-06-01 05:59:12] [INFO ] Deduced a trap composed of 14 places in 1104 ms of which 5 ms to minimize.
[2024-06-01 05:59:13] [INFO ] Deduced a trap composed of 32 places in 1190 ms of which 4 ms to minimize.
[2024-06-01 05:59:14] [INFO ] Deduced a trap composed of 31 places in 1005 ms of which 3 ms to minimize.
SMT process timed out in 6200ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 1166/1166 transitions.
Graph (trivial) has 306 edges and 327 vertex of which 4 / 327 are part of one of the 2 SCC in 7 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 1588 edges and 325 vertex of which 323 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.32 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 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 119 rules applied. Total rules applied 121 place count 323 transition count 1043
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 165 rules applied. Total rules applied 286 place count 206 transition count 995
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 29 rules applied. Total rules applied 315 place count 178 transition count 994
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 316 place count 177 transition count 994
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 316 place count 177 transition count 987
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 330 place count 170 transition count 987
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 333 place count 167 transition count 984
Iterating global reduction 4 with 3 rules applied. Total rules applied 336 place count 167 transition count 984
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 336 place count 167 transition count 982
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 340 place count 165 transition count 982
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 341 place count 164 transition count 973
Iterating global reduction 4 with 1 rules applied. Total rules applied 342 place count 164 transition count 973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 344 place count 164 transition count 971
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 345 place count 163 transition count 971
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 6 with 148 rules applied. Total rules applied 493 place count 89 transition count 897
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 494 place count 89 transition count 896
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 511 place count 72 transition count 743
Iterating global reduction 7 with 17 rules applied. Total rules applied 528 place count 72 transition count 743
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 536 place count 72 transition count 735
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 8 with 2 rules applied. Total rules applied 538 place count 71 transition count 734
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 539 place count 71 transition count 733
Free-agglomeration rule applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 549 place count 71 transition count 723
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 559 place count 61 transition count 723
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 560 place count 61 transition count 722
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 561 place count 61 transition count 722
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 562 place count 60 transition count 721
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 563 place count 59 transition count 721
Applied a total of 563 rules in 877 ms. Remains 59 /327 variables (removed 268) and now considering 721/1166 (removed 445) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 877 ms. Remains : 59/327 places, 721/1166 transitions.
RANDOM walk for 435 steps (0 resets) in 33 ms. (12 steps per ms) remains 0/1 properties
Computed a total of 49 stabilizing places and 50 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 1166/1166 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 321 transition count 1160
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 321 transition count 1160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 320 transition count 1159
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 320 transition count 1159
Applied a total of 14 rules in 81 ms. Remains 320 /327 variables (removed 7) and now considering 1159/1166 (removed 7) transitions.
// Phase 1: matrix 1159 rows 320 cols
[2024-06-01 05:59:15] [INFO ] Computed 14 invariants in 14 ms
[2024-06-01 05:59:16] [INFO ] Implicit Places using invariants in 688 ms returned []
[2024-06-01 05:59:16] [INFO ] Invariant cache hit.
[2024-06-01 05:59:17] [INFO ] Implicit Places using invariants and state equation in 1274 ms returned []
Implicit Place search using SMT with State Equation took 1968 ms to find 0 implicit places.
Running 1158 sub problems to find dead transitions.
[2024-06-01 05:59:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
At refinement iteration 1 (OVERLAPS) 1/320 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
[2024-06-01 06:00:01] [INFO ] Deduced a trap composed of 18 places in 849 ms of which 4 ms to minimize.
[2024-06-01 06:00:02] [INFO ] Deduced a trap composed of 21 places in 889 ms of which 4 ms to minimize.
[2024-06-01 06:00:03] [INFO ] Deduced a trap composed of 70 places in 989 ms of which 5 ms to minimize.
[2024-06-01 06:00:04] [INFO ] Deduced a trap composed of 28 places in 909 ms of which 4 ms to minimize.
[2024-06-01 06:00:05] [INFO ] Deduced a trap composed of 23 places in 1002 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 320/1479 variables, and 19 constraints, problems are : Problem set: 0 solved, 1158 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/320 constraints, PredecessorRefiner: 1158/1158 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
At refinement iteration 1 (OVERLAPS) 1/320 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
[2024-06-01 06:00:17] [INFO ] Deduced a trap composed of 29 places in 1114 ms of which 5 ms to minimize.
[2024-06-01 06:00:18] [INFO ] Deduced a trap composed of 45 places in 1129 ms of which 5 ms to minimize.
[2024-06-01 06:00:19] [INFO ] Deduced a trap composed of 44 places in 995 ms of which 4 ms to minimize.
[2024-06-01 06:00:20] [INFO ] Deduced a trap composed of 40 places in 1126 ms of which 5 ms to minimize.
[2024-06-01 06:00:21] [INFO ] Deduced a trap composed of 45 places in 1173 ms of which 5 ms to minimize.
[2024-06-01 06:00:22] [INFO ] Deduced a trap composed of 50 places in 1175 ms of which 6 ms to minimize.
[2024-06-01 06:00:24] [INFO ] Deduced a trap composed of 50 places in 1202 ms of which 5 ms to minimize.
[2024-06-01 06:00:25] [INFO ] Deduced a trap composed of 45 places in 1206 ms of which 5 ms to minimize.
[2024-06-01 06:00:26] [INFO ] Deduced a trap composed of 48 places in 1161 ms of which 5 ms to minimize.
[2024-06-01 06:00:27] [INFO ] Deduced a trap composed of 51 places in 1095 ms of which 5 ms to minimize.
[2024-06-01 06:00:29] [INFO ] Deduced a trap composed of 49 places in 1269 ms of which 5 ms to minimize.
[2024-06-01 06:00:30] [INFO ] Deduced a trap composed of 38 places in 1211 ms of which 6 ms to minimize.
[2024-06-01 06:00:32] [INFO ] Deduced a trap composed of 27 places in 1184 ms of which 6 ms to minimize.
[2024-06-01 06:00:33] [INFO ] Deduced a trap composed of 43 places in 1088 ms of which 7 ms to minimize.
[2024-06-01 06:00:34] [INFO ] Deduced a trap composed of 24 places in 1099 ms of which 5 ms to minimize.
[2024-06-01 06:00:35] [INFO ] Deduced a trap composed of 43 places in 1098 ms of which 4 ms to minimize.
SMT process timed out in 77445ms, After SMT, problems are : Problem set: 0 solved, 1158 unsolved
Search for dead transitions found 0 dead transitions in 77483ms
Starting structural reductions in LTL mode, iteration 1 : 320/327 places, 1159/1166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79553 ms. Remains : 320/327 places, 1159/1166 transitions.
Stuttering acceptance computed with spot in 365 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 569 ms.
Product exploration explored 100000 steps with 50000 reset in 342 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 25 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-09b-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-09b-LTLCardinality-05 finished in 81035 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p1))||p0))))'
Support contains 5 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 1166/1166 transitions.
Graph (trivial) has 303 edges and 327 vertex of which 4 / 327 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 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 324 transition count 1048
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 159 rules applied. Total rules applied 275 place count 209 transition count 1004
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 27 rules applied. Total rules applied 302 place count 183 transition count 1003
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 303 place count 182 transition count 1003
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 303 place count 182 transition count 995
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 319 place count 174 transition count 995
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 322 place count 171 transition count 992
Iterating global reduction 4 with 3 rules applied. Total rules applied 325 place count 171 transition count 992
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 325 place count 171 transition count 991
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 327 place count 170 transition count 991
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 328 place count 169 transition count 982
Iterating global reduction 4 with 1 rules applied. Total rules applied 329 place count 169 transition count 982
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 331 place count 169 transition count 980
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 332 place count 168 transition count 980
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 6 with 146 rules applied. Total rules applied 478 place count 95 transition count 906
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 479 place count 95 transition count 905
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 496 place count 78 transition count 752
Iterating global reduction 7 with 17 rules applied. Total rules applied 513 place count 78 transition count 752
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 521 place count 78 transition count 744
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 525 place count 76 transition count 742
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 527 place count 76 transition count 742
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 529 place count 74 transition count 740
Applied a total of 529 rules in 686 ms. Remains 74 /327 variables (removed 253) and now considering 740/1166 (removed 426) transitions.
// Phase 1: matrix 740 rows 74 cols
[2024-06-01 06:00:37] [INFO ] Computed 13 invariants in 9 ms
[2024-06-01 06:00:37] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-06-01 06:00:37] [INFO ] Invariant cache hit.
[2024-06-01 06:00:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 06:00:38] [INFO ] Implicit Places using invariants and state equation in 572 ms returned [69, 73]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 929 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/327 places, 740/1166 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 71 transition count 739
Applied a total of 2 rules in 77 ms. Remains 71 /72 variables (removed 1) and now considering 739/740 (removed 1) transitions.
// Phase 1: matrix 739 rows 71 cols
[2024-06-01 06:00:38] [INFO ] Computed 11 invariants in 7 ms
[2024-06-01 06:00:38] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-06-01 06:00:38] [INFO ] Invariant cache hit.
[2024-06-01 06:00:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:00:39] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/327 places, 739/1166 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2588 ms. Remains : 71/327 places, 739/1166 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-07
Product exploration explored 100000 steps with 400 reset in 195 ms.
Product exploration explored 100000 steps with 121 reset in 221 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 p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 153 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 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 33925 steps (1936 resets) in 2479 ms. (13 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 224 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 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 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.
[2024-06-01 06:00:41] [INFO ] Invariant cache hit.
[2024-06-01 06:00:41] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-06-01 06:00:41] [INFO ] Invariant cache hit.
[2024-06-01 06:00:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:00:42] [INFO ] Implicit Places using invariants and state equation in 801 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
[2024-06-01 06:00:42] [INFO ] Redundant transitions in 105 ms returned [562]
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 736 sub problems to find dead transitions.
// Phase 1: matrix 738 rows 71 cols
[2024-06-01 06:00:42] [INFO ] Computed 11 invariants in 11 ms
[2024-06-01 06:00:42] [INFO ] State equation strengthened by 1 read => feed constraints.
FORMULA AutonomousCar-PT-09b-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-09b-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-09b-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-09b-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-09b-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-09b-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-09b-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : AutonomousCar-PT-09b-LTLCardinality-07
FORMULA AutonomousCar-PT-09b-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-09b-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-09b-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-09b-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-09b-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-09b-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-09b-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-09b-LTLCardinality-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717221882771

--------------------
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-09b-LTLCardinality-00
ltl formula formula --ltl=/tmp/764/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 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.600 real 0.110 user 0.170 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/764/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/764/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/764/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/764/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 392 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1575 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~125!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 419
pnml2lts-mc( 0/ 4): unique transitions count: 3030
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 426
pnml2lts-mc( 0/ 4): - cum. max stack depth: 426
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 426 states 3054 transitions, fanout: 7.169
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7100, Transitions per second: 50900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 18.3 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-09b-LTLCardinality-01
ltl formula formula --ltl=/tmp/764/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 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.580 real 0.100 user 0.170 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/764/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/764/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/764/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/764/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 393 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1559 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):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~102!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 329
pnml2lts-mc( 0/ 4): unique transitions count: 2218
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 355
pnml2lts-mc( 0/ 4): - cum. max stack depth: 355
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 355 states 2343 transitions, fanout: 6.600
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.040 sec minimum, 0.045 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7100, Transitions per second: 46860
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 20.2 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-09b-LTLCardinality-02
ltl formula formula --ltl=/tmp/764/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/764/ltl_2_
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.330 real 0.110 user 0.070 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/764/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/764/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/764/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 393 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1557 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):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~112!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 403
pnml2lts-mc( 0/ 4): unique transitions count: 2717
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 415
pnml2lts-mc( 0/ 4): - cum. max stack depth: 415
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 415 states 2791 transitions, fanout: 6.725
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.050 sec minimum, 0.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 8300, Transitions per second: 55820
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 18.2 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-09b-LTLCardinality-03
ltl formula formula --ltl=/tmp/764/ltl_3_
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 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.280 real 0.130 user 0.070 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/764/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/764/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/764/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/764/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 392 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1574 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~111!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 403
pnml2lts-mc( 0/ 4): unique transitions count: 2798
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 422
pnml2lts-mc( 0/ 4): - cum. max stack depth: 422
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 422 states 2912 transitions, fanout: 6.900
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.050 sec minimum, 0.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 8440, Transitions per second: 58240
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 18.4 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-09b-LTLCardinality-04
ltl formula formula --ltl=/tmp/764/ltl_4_
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 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.270 real 0.110 user 0.080 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/764/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/764/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/764/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/764/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 392 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1569 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~113!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 434
pnml2lts-mc( 0/ 4): unique transitions count: 2621
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 462
pnml2lts-mc( 0/ 4): - cum. max stack depth: 462
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 462 states 2728 transitions, fanout: 5.905
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.050 sec minimum, 0.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 9240, Transitions per second: 54560
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 18.8 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-09b-LTLCardinality-05
ltl formula formula --ltl=/tmp/764/ltl_5_
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 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.250 real 0.100 user 0.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/764/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/764/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/764/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/764/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 392 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1561 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2
pnml2lts-mc( 0/ 4): unique states count: 2
pnml2lts-mc( 0/ 4): unique transitions count: 1
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8 states 8 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 80.0 B/state, compr.: 5.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-09b-LTLCardinality-06
ltl formula formula --ltl=/tmp/764/ltl_6_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.480 real 0.080 user 0.100 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/764/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/764/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/764/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/764/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 392 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1579 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 72.0 B/state, compr.: 4.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-09b-LTLCardinality-07
ltl formula formula --ltl=/tmp/764/ltl_7_
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 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.240 real 0.070 user 0.080 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/764/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/764/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/764/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/764/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 392 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1560 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~127 levels ~10000 states ~43396 transitions
pnml2lts-mc( 1/ 4): ~137 levels ~20000 states ~86900 transitions
pnml2lts-mc( 1/ 4): ~137 levels ~40000 states ~175980 transitions
pnml2lts-mc( 1/ 4): ~137 levels ~80000 states ~387184 transitions
pnml2lts-mc( 3/ 4): ~114 levels ~160000 states ~822928 transitions
pnml2lts-mc( 3/ 4): ~140 levels ~320000 states ~1615828 transitions
pnml2lts-mc( 3/ 4): ~144 levels ~640000 states ~3173188 transitions
pnml2lts-mc( 3/ 4): ~149 levels ~1280000 states ~6521764 transitions
pnml2lts-mc( 3/ 4): ~149 levels ~2560000 states ~13978740 transitions
pnml2lts-mc( 3/ 4): ~149 levels ~5120000 states ~30248888 transitions
ltl formula name AutonomousCar-PT-09b-LTLCardinality-08
ltl formula formula --ltl=/tmp/764/ltl_8_
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 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.340 real 0.090 user 0.070 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/764/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/764/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/764/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/764/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 393 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1557 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 72.0 B/state, compr.: 4.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-09b-LTLCardinality-09
ltl formula formula --ltl=/tmp/764/ltl_9_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.270 real 0.110 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/764/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/764/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/764/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/764/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 393 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1556 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2
pnml2lts-mc( 0/ 4): unique states count: 2
pnml2lts-mc( 0/ 4): unique transitions count: 1
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8 states 8 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 80.0 B/state, compr.: 5.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-09b-LTLCardinality-10
ltl formula formula --ltl=/tmp/764/ltl_10_
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 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.280 real 0.100 user 0.080 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/764/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/764/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/764/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/764/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): There are 392 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1598 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):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~129!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 473
pnml2lts-mc( 0/ 4): unique transitions count: 3566
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 489
pnml2lts-mc( 0/ 4): - cum. max stack depth: 488
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 489 states 3656 transitions, fanout: 7.476
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.050 sec minimum, 0.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 9780, Transitions per second: 73120
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 18.1 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-09b-LTLCardinality-11
ltl formula formula --ltl=/tmp/764/ltl_11_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.250 real 0.130 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/764/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/764/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/764/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/764/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 393 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1557 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~107!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 382
pnml2lts-mc( 0/ 4): unique transitions count: 2552
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 396
pnml2lts-mc( 0/ 4): - cum. max stack depth: 396
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 396 states 2637 transitions, fanout: 6.659
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 9900, Transitions per second: 65925
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 18.7 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-09b-LTLCardinality-12
ltl formula formula --ltl=/tmp/764/ltl_12_
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.240 real 0.090 user 0.070 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/764/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/764/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/764/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/764/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 392 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1574 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~109!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 395
pnml2lts-mc( 0/ 4): unique transitions count: 2533
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 418
pnml2lts-mc( 0/ 4): - cum. max stack depth: 418
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 418 states 2644 transitions, fanout: 6.325
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 13933, Transitions per second: 88133
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 18.2 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-09b-LTLCardinality-13
ltl formula formula --ltl=/tmp/764/ltl_13_
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 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.230 real 0.100 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/764/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/764/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/764/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/764/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 393 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1560 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~102!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 350
pnml2lts-mc( 0/ 4): unique transitions count: 2134
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 366
pnml2lts-mc( 0/ 4): - cum. max stack depth: 366
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 366 states 2225 transitions, fanout: 6.079
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 9150, Transitions per second: 55625
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 19.1 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-09b-LTLCardinality-14
ltl formula formula --ltl=/tmp/764/ltl_14_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.220 real 0.080 user 0.070 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/764/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/764/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/764/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/764/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 393 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1559 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 72.0 B/state, compr.: 4.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-09b-LTLCardinality-15
ltl formula formula --ltl=/tmp/764/ltl_15_
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 391 places, 1554 transitions and 16243 arcs
pnml2lts-mc( 0/ 4): Petri net AutonomousCar-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.080 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/764/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/764/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/764/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/764/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 11 states
pnml2lts-mc( 0/ 4): There are 392 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 392, there are 1581 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4
pnml2lts-mc( 0/ 4): unique states count: 4
pnml2lts-mc( 0/ 4): unique transitions count: 3
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 16
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 16 states 16 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 92.0 B/state, compr.: 5.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1584 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-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-5568"
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 r468-smll-171620167500355"
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 ;