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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 12 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 110K 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-04b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717211198970

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-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 03:06:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 03:06:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 03:06:41] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2024-06-01 03:06:41] [INFO ] Transformed 221 places.
[2024-06-01 03:06:41] [INFO ] Transformed 368 transitions.
[2024-06-01 03:06:41] [INFO ] Found NUPN structural information;
[2024-06-01 03:06:41] [INFO ] Parsed PT model containing 221 places and 368 transitions and 1658 arcs in 432 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 4 formulas.
FORMULA AutonomousCar-PT-04b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 368/368 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 194 transition count 341
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 194 transition count 341
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 190 transition count 337
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 190 transition count 337
Applied a total of 62 rules in 134 ms. Remains 190 /221 variables (removed 31) and now considering 337/368 (removed 31) transitions.
// Phase 1: matrix 337 rows 190 cols
[2024-06-01 03:06:42] [INFO ] Computed 9 invariants in 40 ms
[2024-06-01 03:06:43] [INFO ] Implicit Places using invariants in 541 ms returned []
[2024-06-01 03:06:43] [INFO ] Invariant cache hit.
[2024-06-01 03:06:43] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2024-06-01 03:06:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 03:06:49] [INFO ] Deduced a trap composed of 17 places in 309 ms of which 40 ms to minimize.
[2024-06-01 03:06:50] [INFO ] Deduced a trap composed of 22 places in 208 ms of which 4 ms to minimize.
[2024-06-01 03:06:50] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 4 ms to minimize.
[2024-06-01 03:06:50] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-06-01 03:06:51] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 3 ms to minimize.
[2024-06-01 03:06:51] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 2 ms to minimize.
[2024-06-01 03:06:51] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2024-06-01 03:06:51] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 3 ms to minimize.
[2024-06-01 03:06:51] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 2 ms to minimize.
[2024-06-01 03:06:51] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-06-01 03:06:51] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 2 ms to minimize.
[2024-06-01 03:06:52] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 2 ms to minimize.
[2024-06-01 03:06:52] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
[2024-06-01 03:06:52] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 03:06:52] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2024-06-01 03:06:52] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-06-01 03:06:52] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2024-06-01 03:06:52] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 3 ms to minimize.
[2024-06-01 03:06:53] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 3 ms to minimize.
[2024-06-01 03:06:53] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 03:06:54] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 3 ms to minimize.
[2024-06-01 03:06:54] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 3 ms to minimize.
[2024-06-01 03:06:54] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 2 ms to minimize.
[2024-06-01 03:06:54] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 4 ms to minimize.
[2024-06-01 03:06:54] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 2 ms to minimize.
[2024-06-01 03:06:55] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 3 ms to minimize.
[2024-06-01 03:06:55] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 3 ms to minimize.
[2024-06-01 03:06:55] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 3 ms to minimize.
[2024-06-01 03:06:55] [INFO ] Deduced a trap composed of 35 places in 239 ms of which 4 ms to minimize.
[2024-06-01 03:06:55] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 3 ms to minimize.
[2024-06-01 03:06:56] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 3 ms to minimize.
[2024-06-01 03:06:56] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 2 ms to minimize.
[2024-06-01 03:06:57] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 2 ms to minimize.
[2024-06-01 03:06:57] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 4 ms to minimize.
[2024-06-01 03:06:57] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 4 ms to minimize.
[2024-06-01 03:06:58] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 3 ms to minimize.
[2024-06-01 03:06:58] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 3 ms to minimize.
[2024-06-01 03:06:58] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 3 ms to minimize.
[2024-06-01 03:06:58] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 3 ms to minimize.
[2024-06-01 03:06:58] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 03:07:01] [INFO ] Deduced a trap composed of 48 places in 170 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 03:07:05] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 2 ms to minimize.
[2024-06-01 03:07:06] [INFO ] Deduced a trap composed of 36 places in 197 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD311 is UNSAT
At refinement iteration 7 (OVERLAPS) 337/527 variables, 190/242 constraints. Problems are: Problem set: 2 solved, 334 unsolved
[2024-06-01 03:07:14] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 4 ms to minimize.
[2024-06-01 03:07:14] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/527 variables, and 244 constraints, problems are : Problem set: 2 solved, 334 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 2 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 334 unsolved
At refinement iteration 1 (OVERLAPS) 2/190 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 45/54 constraints. Problems are: Problem set: 2 solved, 334 unsolved
[2024-06-01 03:07:18] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 3 ms to minimize.
[2024-06-01 03:07:19] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 2/56 constraints. Problems are: Problem set: 2 solved, 334 unsolved
[2024-06-01 03:07:21] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 1/57 constraints. Problems are: Problem set: 2 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/57 constraints. Problems are: Problem set: 2 solved, 334 unsolved
At refinement iteration 6 (OVERLAPS) 337/527 variables, 190/247 constraints. Problems are: Problem set: 2 solved, 334 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 334/581 constraints. Problems are: Problem set: 2 solved, 334 unsolved
[2024-06-01 03:07:31] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 1/582 constraints. Problems are: Problem set: 2 solved, 334 unsolved
[2024-06-01 03:07:40] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 3 ms to minimize.
[2024-06-01 03:07:43] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 3 ms to minimize.
[2024-06-01 03:07:44] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/527 variables, and 585 constraints, problems are : Problem set: 2 solved, 334 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 334/336 constraints, Known Traps: 52/52 constraints]
After SMT, in 61317ms problems are : Problem set: 2 solved, 334 unsolved
Search for dead transitions found 2 dead transitions in 61364ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 190/221 places, 335/368 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 189 transition count 335
Applied a total of 1 rules in 18 ms. Remains 189 /190 variables (removed 1) and now considering 335/335 (removed 0) transitions.
// Phase 1: matrix 335 rows 189 cols
[2024-06-01 03:07:45] [INFO ] Computed 9 invariants in 6 ms
[2024-06-01 03:07:45] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-06-01 03:07:45] [INFO ] Invariant cache hit.
[2024-06-01 03:07:45] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 189/221 places, 335/368 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63203 ms. Remains : 189/221 places, 335/368 transitions.
Support contains 13 out of 189 places after structural reductions.
[2024-06-01 03:07:45] [INFO ] Flatten gal took : 88 ms
[2024-06-01 03:07:45] [INFO ] Flatten gal took : 46 ms
[2024-06-01 03:07:45] [INFO ] Input system was already deterministic with 335 transitions.
Support contains 11 out of 189 places (down from 13) after GAL structural reductions.
RANDOM walk for 23481 steps (76 resets) in 831 ms. (28 steps per ms) remains 0/7 properties
FORMULA AutonomousCar-PT-04b-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutonomousCar-PT-04b-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 34 stabilizing places and 34 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' '!(G(F(p0)))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 335/335 transitions.
Graph (trivial) has 176 edges and 189 vertex of which 4 / 189 are part of one of the 2 SCC in 4 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 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 186 transition count 260
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 99 rules applied. Total rules applied 172 place count 114 transition count 233
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 188 place count 98 transition count 233
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 188 place count 98 transition count 226
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 202 place count 91 transition count 226
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 206 place count 87 transition count 222
Iterating global reduction 3 with 4 rules applied. Total rules applied 210 place count 87 transition count 222
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 3 with 64 rules applied. Total rules applied 274 place count 87 transition count 158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 274 place count 87 transition count 157
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 276 place count 86 transition count 157
Performed 35 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 346 place count 51 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 347 place count 51 transition count 120
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 356 place count 42 transition count 83
Iterating global reduction 5 with 9 rules applied. Total rules applied 365 place count 42 transition count 83
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 369 place count 42 transition count 79
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 6 with 4 rules applied. Total rules applied 373 place count 40 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 375 place count 39 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 377 place count 37 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 378 place count 36 transition count 88
Applied a total of 378 rules in 113 ms. Remains 36 /189 variables (removed 153) and now considering 88/335 (removed 247) transitions.
// Phase 1: matrix 88 rows 36 cols
[2024-06-01 03:07:46] [INFO ] Computed 7 invariants in 3 ms
[2024-06-01 03:07:46] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 03:07:46] [INFO ] Invariant cache hit.
[2024-06-01 03:07:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 03:07:47] [INFO ] Implicit Places using invariants and state equation in 193 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 268 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/189 places, 88/335 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 34 transition count 87
Applied a total of 2 rules in 10 ms. Remains 34 /35 variables (removed 1) and now considering 87/88 (removed 1) transitions.
// Phase 1: matrix 87 rows 34 cols
[2024-06-01 03:07:47] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 03:07:47] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-01 03:07:47] [INFO ] Invariant cache hit.
[2024-06-01 03:07:47] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 03:07:47] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/189 places, 87/335 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 546 ms. Remains : 34/189 places, 87/335 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLCardinality-01
Product exploration explored 100000 steps with 2 reset in 228 ms.
Product exploration explored 100000 steps with 8 reset in 137 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/34 stabilizing places and 4/87 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 87/87 transitions.
Applied a total of 0 rules in 5 ms. Remains 34 /34 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-06-01 03:07:48] [INFO ] Invariant cache hit.
[2024-06-01 03:07:48] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 03:07:48] [INFO ] Invariant cache hit.
[2024-06-01 03:07:48] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 03:07:48] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-06-01 03:07:48] [INFO ] Redundant transitions in 2 ms returned []
Running 85 sub problems to find dead transitions.
[2024-06-01 03:07:48] [INFO ] Invariant cache hit.
[2024-06-01 03:07:48] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 2/34 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/120 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-01 03:07:49] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-06-01 03:07:49] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/121 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 54 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2357 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 2/34 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 86/120 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 85/138 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 1/121 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (OVERLAPS) 0/121 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 139 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3779 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 2/2 constraints]
After SMT, in 6285ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 6287ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6464 ms. Remains : 34/34 places, 87/87 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/34 stabilizing places and 4/87 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15 reset in 98 ms.
Product exploration explored 100000 steps with 4 reset in 120 ms.
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 87/87 transitions.
Applied a total of 0 rules in 5 ms. Remains 34 /34 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-06-01 03:07:55] [INFO ] Invariant cache hit.
[2024-06-01 03:07:55] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 03:07:55] [INFO ] Invariant cache hit.
[2024-06-01 03:07:55] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 03:07:55] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-06-01 03:07:55] [INFO ] Redundant transitions in 1 ms returned []
Running 85 sub problems to find dead transitions.
[2024-06-01 03:07:55] [INFO ] Invariant cache hit.
[2024-06-01 03:07:55] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 2/34 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/120 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-01 03:07:56] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-06-01 03:07:57] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/121 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 54 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2364 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 2/34 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 86/120 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 85/138 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 1/121 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (OVERLAPS) 0/121 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 139 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3962 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 2/2 constraints]
After SMT, in 6423ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 6425ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6591 ms. Remains : 34/34 places, 87/87 transitions.
Treatment of property AutonomousCar-PT-04b-LTLCardinality-01 finished in 15853 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 335/335 transitions.
Graph (trivial) has 176 edges and 189 vertex of which 4 / 189 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 186 transition count 258
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 101 rules applied. Total rules applied 176 place count 112 transition count 231
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 192 place count 96 transition count 231
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 192 place count 96 transition count 224
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 206 place count 89 transition count 224
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 211 place count 84 transition count 219
Iterating global reduction 3 with 5 rules applied. Total rules applied 216 place count 84 transition count 219
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 3 with 64 rules applied. Total rules applied 280 place count 84 transition count 155
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 280 place count 84 transition count 154
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 282 place count 83 transition count 154
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 352 place count 48 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 354 place count 48 transition count 117
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 363 place count 39 transition count 80
Iterating global reduction 5 with 9 rules applied. Total rules applied 372 place count 39 transition count 80
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 376 place count 39 transition count 76
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 6 with 4 rules applied. Total rules applied 380 place count 37 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 382 place count 36 transition count 87
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 384 place count 34 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 385 place count 33 transition count 85
Applied a total of 385 rules in 58 ms. Remains 33 /189 variables (removed 156) and now considering 85/335 (removed 250) transitions.
// Phase 1: matrix 85 rows 33 cols
[2024-06-01 03:08:02] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 03:08:02] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 03:08:02] [INFO ] Invariant cache hit.
[2024-06-01 03:08:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:08:02] [INFO ] Implicit Places using invariants and state equation in 85 ms returned [28, 32]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 147 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/189 places, 85/335 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 30 transition count 84
Applied a total of 2 rules in 7 ms. Remains 30 /31 variables (removed 1) and now considering 84/85 (removed 1) transitions.
// Phase 1: matrix 84 rows 30 cols
[2024-06-01 03:08:02] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 03:08:02] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 03:08:02] [INFO ] Invariant cache hit.
[2024-06-01 03:08:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:08:02] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/189 places, 84/335 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 336 ms. Remains : 30/189 places, 84/335 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLCardinality-05
Product exploration explored 100000 steps with 8 reset in 130 ms.
Product exploration explored 100000 steps with 43 reset in 98 ms.
Computed a total of 0 stabilizing places and 2 stable transitions
Computed a total of 0 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
RANDOM walk for 1703 steps (144 resets) in 59 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-06-01 03:08:03] [INFO ] Invariant cache hit.
[2024-06-01 03:08:03] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 03:08:03] [INFO ] Invariant cache hit.
[2024-06-01 03:08:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:08:03] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-06-01 03:08:03] [INFO ] Redundant transitions in 2 ms returned []
Running 81 sub problems to find dead transitions.
[2024-06-01 03:08:03] [INFO ] Invariant cache hit.
[2024-06-01 03:08:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 83/113 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 1/114 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 36 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1831 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 83/113 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 81/116 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 1/114 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 117 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2972 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
After SMT, in 4891ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 4892ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5025 ms. Remains : 30/30 places, 84/84 transitions.
Computed a total of 0 stabilizing places and 2 stable transitions
Computed a total of 0 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 802 steps (66 resets) in 29 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 84 ms.
Product exploration explored 100000 steps with 2 reset in 94 ms.
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-06-01 03:08:09] [INFO ] Invariant cache hit.
[2024-06-01 03:08:09] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 03:08:09] [INFO ] Invariant cache hit.
[2024-06-01 03:08:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:08:09] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-06-01 03:08:09] [INFO ] Redundant transitions in 3 ms returned []
Running 81 sub problems to find dead transitions.
[2024-06-01 03:08:09] [INFO ] Invariant cache hit.
[2024-06-01 03:08:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 83/113 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 1/114 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 36 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1934 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 83/113 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 81/116 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 1/114 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 117 constraints, problems are : Problem set: 0 solved, 81 unsolved in 3980 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
After SMT, in 6064ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 6067ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6384 ms. Remains : 30/30 places, 84/84 transitions.
Treatment of property AutonomousCar-PT-04b-LTLCardinality-05 finished in 13329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X((!p1 U p2)))))'
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 335/335 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 330
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 330
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 182 transition count 328
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 182 transition count 328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 181 transition count 327
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 181 transition count 327
Applied a total of 16 rules in 29 ms. Remains 181 /189 variables (removed 8) and now considering 327/335 (removed 8) transitions.
// Phase 1: matrix 327 rows 181 cols
[2024-06-01 03:08:15] [INFO ] Computed 9 invariants in 5 ms
[2024-06-01 03:08:15] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-01 03:08:15] [INFO ] Invariant cache hit.
[2024-06-01 03:08:16] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2024-06-01 03:08:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 326 unsolved
[2024-06-01 03:08:21] [INFO ] Deduced a trap composed of 32 places in 334 ms of which 32 ms to minimize.
[2024-06-01 03:08:21] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 3 ms to minimize.
[2024-06-01 03:08:22] [INFO ] Deduced a trap composed of 19 places in 302 ms of which 3 ms to minimize.
[2024-06-01 03:08:22] [INFO ] Deduced a trap composed of 44 places in 215 ms of which 3 ms to minimize.
[2024-06-01 03:08:22] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 2 ms to minimize.
[2024-06-01 03:08:22] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 3 ms to minimize.
[2024-06-01 03:08:23] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 3 ms to minimize.
[2024-06-01 03:08:23] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 4 ms to minimize.
[2024-06-01 03:08:23] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 3 ms to minimize.
[2024-06-01 03:08:23] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 3 ms to minimize.
[2024-06-01 03:08:23] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 3 ms to minimize.
[2024-06-01 03:08:23] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 2 ms to minimize.
[2024-06-01 03:08:24] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 3 ms to minimize.
[2024-06-01 03:08:24] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 2 ms to minimize.
[2024-06-01 03:08:24] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-06-01 03:08:24] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 2 ms to minimize.
[2024-06-01 03:08:24] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 3 ms to minimize.
[2024-06-01 03:08:24] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 3 ms to minimize.
[2024-06-01 03:08:25] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 3 ms to minimize.
[2024-06-01 03:08:25] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 326 unsolved
[2024-06-01 03:08:25] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 3 ms to minimize.
[2024-06-01 03:08:26] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 2 ms to minimize.
[2024-06-01 03:08:26] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 2 ms to minimize.
[2024-06-01 03:08:26] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 2 ms to minimize.
[2024-06-01 03:08:26] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 2 ms to minimize.
[2024-06-01 03:08:27] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 3 ms to minimize.
[2024-06-01 03:08:27] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 2 ms to minimize.
[2024-06-01 03:08:27] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 2 ms to minimize.
[2024-06-01 03:08:27] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-06-01 03:08:27] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 3 ms to minimize.
[2024-06-01 03:08:28] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 3 ms to minimize.
[2024-06-01 03:08:28] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 2 ms to minimize.
[2024-06-01 03:08:28] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 13/42 constraints. Problems are: Problem set: 0 solved, 326 unsolved
[2024-06-01 03:08:31] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2024-06-01 03:08:31] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 2 ms to minimize.
[2024-06-01 03:08:32] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 3 ms to minimize.
[2024-06-01 03:08:32] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 3 ms to minimize.
[2024-06-01 03:08:32] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 3 ms to minimize.
[2024-06-01 03:08:32] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 3 ms to minimize.
[2024-06-01 03:08:33] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 3 ms to minimize.
[2024-06-01 03:08:33] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 3 ms to minimize.
[2024-06-01 03:08:33] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 2 ms to minimize.
[2024-06-01 03:08:34] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-06-01 03:08:34] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-06-01 03:08:34] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2024-06-01 03:08:34] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 3 ms to minimize.
[2024-06-01 03:08:34] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 2 ms to minimize.
[2024-06-01 03:08:34] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
[2024-06-01 03:08:37] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 3 ms to minimize.
[2024-06-01 03:08:37] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-06-01 03:08:37] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 326 unsolved
[2024-06-01 03:08:39] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 326 unsolved
SMT process timed out in 30678ms, After SMT, problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 30685ms
Starting structural reductions in LTL mode, iteration 1 : 181/189 places, 327/335 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31167 ms. Remains : 181/189 places, 327/335 transitions.
Stuttering acceptance computed with spot in 328 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true]
Running random walk in product with property : AutonomousCar-PT-04b-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-04b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLCardinality-07 finished in 31529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-06-01 03:08:47] [INFO ] Flatten gal took : 52 ms
[2024-06-01 03:08:47] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 03:08:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 189 places, 335 transitions and 1590 arcs took 9 ms.
Total runtime 126482 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutonomousCar-PT-04b-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-04b-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717211572427

--------------------
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-04b-LTLCardinality-01
ltl formula formula --ltl=/tmp/1184/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 189 places, 335 transitions and 1590 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1184/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1184/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1184/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1184/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 191 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 190, there are 344 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): ~39 levels ~10000 states ~22040 transitions
pnml2lts-mc( 1/ 4): ~39 levels ~20000 states ~45860 transitions
pnml2lts-mc( 1/ 4): ~39 levels ~40000 states ~96632 transitions
pnml2lts-mc( 1/ 4): ~39 levels ~80000 states ~210016 transitions
pnml2lts-mc( 1/ 4): ~79 levels ~160000 states ~438736 transitions
pnml2lts-mc( 1/ 4): ~89 levels ~320000 states ~1151096 transitions
pnml2lts-mc( 1/ 4): ~93 levels ~640000 states ~2709348 transitions
pnml2lts-mc( 1/ 4): ~93 levels ~1280000 states ~6313080 transitions
pnml2lts-mc( 2/ 4): ~199 levels ~2560000 states ~13523348 transitions
pnml2lts-mc( 2/ 4): ~199 levels ~5120000 states ~27231360 transitions
pnml2lts-mc( 2/ 4): ~199 levels ~10240000 states ~54590660 transitions
pnml2lts-mc( 1/ 4): ~162 levels ~20480000 states ~113761004 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 30448364
pnml2lts-mc( 0/ 4): unique states count: 33547451
pnml2lts-mc( 0/ 4): unique transitions count: 207517132
pnml2lts-mc( 0/ 4): - self-loop count: 906
pnml2lts-mc( 0/ 4): - claim dead count: 167574702
pnml2lts-mc( 0/ 4): - claim found count: 6386603
pnml2lts-mc( 0/ 4): - claim success count: 33547836
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8091
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33547883 states 207520046 transitions, fanout: 6.186
pnml2lts-mc( 0/ 4): Total exploration time 243.460 sec (243.400 sec minimum, 243.418 sec on average)
pnml2lts-mc( 0/ 4): States per second: 137796, Transitions per second: 852378
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 261.1MB, 8.2 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/7.0%
pnml2lts-mc( 0/ 4): Stored 338 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 261.1MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-04b-LTLCardinality-05
ltl formula formula --ltl=/tmp/1184/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 189 places, 335 transitions and 1590 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1184/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1184/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1184/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1184/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 190 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 190, there are 341 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 ~181!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1097
pnml2lts-mc( 0/ 4): unique states count: 1465
pnml2lts-mc( 0/ 4): unique transitions count: 4550
pnml2lts-mc( 0/ 4): - self-loop count: 11
pnml2lts-mc( 0/ 4): - claim dead count: 2007
pnml2lts-mc( 0/ 4): - claim found count: 16
pnml2lts-mc( 0/ 4): - claim success count: 1483
pnml2lts-mc( 0/ 4): - cum. max stack depth: 400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1483 states 4604 transitions, fanout: 3.105
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: 49433, Transitions per second: 153467
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 13.0 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 338 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-04b"
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-04b, 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-171620167400275"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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