Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812500419.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is Parking-PT-416, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812500419
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 107K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Parking-PT-416-LTLCardinality-00
FORMULA_NAME Parking-PT-416-LTLCardinality-01
FORMULA_NAME Parking-PT-416-LTLCardinality-02
FORMULA_NAME Parking-PT-416-LTLCardinality-03
FORMULA_NAME Parking-PT-416-LTLCardinality-04
FORMULA_NAME Parking-PT-416-LTLCardinality-05
FORMULA_NAME Parking-PT-416-LTLCardinality-06
FORMULA_NAME Parking-PT-416-LTLCardinality-07
FORMULA_NAME Parking-PT-416-LTLCardinality-08
FORMULA_NAME Parking-PT-416-LTLCardinality-09
FORMULA_NAME Parking-PT-416-LTLCardinality-10
FORMULA_NAME Parking-PT-416-LTLCardinality-11
FORMULA_NAME Parking-PT-416-LTLCardinality-12
FORMULA_NAME Parking-PT-416-LTLCardinality-13
FORMULA_NAME Parking-PT-416-LTLCardinality-14
FORMULA_NAME Parking-PT-416-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748881578184

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-416
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 16:26:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 16:26:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 16:26:19] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2025-06-02 16:26:19] [INFO ] Transformed 305 places.
[2025-06-02 16:26:19] [INFO ] Transformed 433 transitions.
[2025-06-02 16:26:19] [INFO ] Found NUPN structural information;
[2025-06-02 16:26:19] [INFO ] Parsed PT model containing 305 places and 433 transitions and 1289 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
FORMULA Parking-PT-416-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 257/257 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 302 transition count 254
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 302 transition count 254
Applied a total of 6 rules in 52 ms. Remains 302 /305 variables (removed 3) and now considering 254/257 (removed 3) transitions.
// Phase 1: matrix 254 rows 302 cols
[2025-06-02 16:26:19] [INFO ] Computed 76 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:26:20] [INFO ] Implicit Places using invariants in 385 ms returned [48, 56, 64, 88, 117, 125, 133, 141, 157, 159, 186, 202, 210, 226, 228, 255, 263, 271, 279, 295, 297]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 414 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 281/305 places, 254/257 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 268 transition count 241
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 268 transition count 241
Applied a total of 26 rules in 13 ms. Remains 268 /281 variables (removed 13) and now considering 241/254 (removed 13) transitions.
// Phase 1: matrix 241 rows 268 cols
[2025-06-02 16:26:20] [INFO ] Computed 55 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:26:20] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-02 16:26:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:26:20] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 16:26:20] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 268/305 places, 241/257 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 960 ms. Remains : 268/305 places, 241/257 transitions.
Support contains 27 out of 268 places after structural reductions.
[2025-06-02 16:26:20] [INFO ] Flatten gal took : 40 ms
[2025-06-02 16:26:20] [INFO ] Flatten gal took : 19 ms
[2025-06-02 16:26:20] [INFO ] Input system was already deterministic with 241 transitions.
RANDOM walk for 40000 steps (514 resets) in 1087 ms. (36 steps per ms) remains 3/17 properties
BEST_FIRST walk for 40003 steps (19 resets) in 255 ms. (156 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (20 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (20 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
[2025-06-02 16:26:21] [INFO ] Invariant cache hit.
[2025-06-02 16:26:21] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 82/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 181/268 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 241/509 variables, 268/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 60/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/509 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/509 variables, and 383 constraints, problems are : Problem set: 0 solved, 3 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 268/268 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 82/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 181/268 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 241/509 variables, 268/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 60/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 3/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/509 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 509/509 variables, and 386 constraints, problems are : Problem set: 0 solved, 3 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 268/268 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 960ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 209 ms.
Support contains 3 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 241/241 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 268 transition count 233
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 260 transition count 233
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 260 transition count 225
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 252 transition count 225
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 250 transition count 223
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 250 transition count 223
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 68 place count 234 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 233 transition count 226
Free-agglomeration rule applied 56 times.
Iterating global reduction 2 with 56 rules applied. Total rules applied 126 place count 233 transition count 170
Reduce places removed 56 places and 0 transitions.
Graph (complete) has 388 edges and 177 vertex of which 95 are kept as prefixes of interest. Removing 82 places using SCC suffix rule.0 ms
Discarding 82 places :
Also discarding 77 output transitions
Drop transitions (Output transitions of discarded places.) removed 77 transitions
Iterating post reduction 2 with 57 rules applied. Total rules applied 183 place count 95 transition count 93
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 199 place count 95 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 200 place count 94 transition count 76
Reduce places removed 28 places and 0 transitions.
Graph (trivial) has 64 edges and 66 vertex of which 25 / 66 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 50 rules applied. Total rules applied 250 place count 42 transition count 55
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 57 rules applied. Total rules applied 307 place count 21 transition count 19
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 6 rules applied. Total rules applied 313 place count 17 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 315 place count 15 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 315 place count 15 transition count 15
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 319 place count 13 transition count 15
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 321 place count 11 transition count 13
Iterating global reduction 8 with 2 rules applied. Total rules applied 323 place count 11 transition count 13
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 325 place count 11 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 327 place count 10 transition count 10
Applied a total of 327 rules in 72 ms. Remains 10 /268 variables (removed 258) and now considering 10/241 (removed 231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 10/268 places, 10/241 transitions.
RANDOM walk for 56 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/2 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((F(p1)&&X(X(F(p2))))||p0))))'
Support contains 5 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 241/241 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 267 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 267 transition count 240
Applied a total of 2 rules in 11 ms. Remains 267 /268 variables (removed 1) and now considering 240/241 (removed 1) transitions.
// Phase 1: matrix 240 rows 267 cols
[2025-06-02 16:26:23] [INFO ] Computed 55 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:26:23] [INFO ] Implicit Places using invariants in 186 ms returned [67, 83, 176]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 189 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 264/268 places, 240/241 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 262 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 262 transition count 238
Applied a total of 4 rules in 9 ms. Remains 262 /264 variables (removed 2) and now considering 238/240 (removed 2) transitions.
// Phase 1: matrix 238 rows 262 cols
[2025-06-02 16:26:23] [INFO ] Computed 52 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:26:23] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-02 16:26:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:26:23] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 16:26:23] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 262/268 places, 238/241 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 709 ms. Remains : 262/268 places, 238/241 transitions.
Stuttering acceptance computed with spot in 328 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : Parking-PT-416-LTLCardinality-05
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 3 ms.
FORMULA Parking-PT-416-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLCardinality-05 finished in 1213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 3 out of 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 241/241 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 268 transition count 233
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 260 transition count 233
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 260 transition count 225
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 252 transition count 225
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 250 transition count 223
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 250 transition count 223
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 64 place count 236 transition count 209
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 235 transition count 228
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 235 transition count 228
Applied a total of 67 rules in 39 ms. Remains 235 /268 variables (removed 33) and now considering 228/241 (removed 13) transitions.
// Phase 1: matrix 228 rows 235 cols
[2025-06-02 16:26:24] [INFO ] Computed 55 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:26:24] [INFO ] Implicit Places using invariants in 127 ms returned [61, 77]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 129 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 233/268 places, 228/241 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 227
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 4 place count 231 transition count 226
Applied a total of 4 rules in 16 ms. Remains 231 /233 variables (removed 2) and now considering 226/228 (removed 2) transitions.
// Phase 1: matrix 226 rows 231 cols
[2025-06-02 16:26:24] [INFO ] Computed 53 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:26:24] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-06-02 16:26:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:26:24] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-06-02 16:26:24] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 231/268 places, 226/241 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 803 ms. Remains : 231/268 places, 226/241 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Parking-PT-416-LTLCardinality-08
Product exploration explored 100000 steps with 1329 reset in 378 ms.
Product exploration explored 100000 steps with 1324 reset in 365 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (OR p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 243 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 21404 steps (278 resets) in 144 ms. (147 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (OR p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 408 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 226/226 transitions.
Applied a total of 0 rules in 12 ms. Remains 231 /231 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2025-06-02 16:26:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:26:26] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-02 16:26:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:26:27] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-06-02 16:26:27] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:26:27] [INFO ] Redundant transitions in 8 ms returned []
Running 221 sub problems to find dead transitions.
[2025-06-02 16:26:27] [INFO ] Invariant cache hit.
[2025-06-02 16:26:27] [INFO ] State equation strengthened by 104 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 226/457 variables, 231/284 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 104/388 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 388 constraints, problems are : Problem set: 0 solved, 221 unsolved in 16656 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 231/231 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 226/457 variables, 231/284 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 104/388 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 221/609 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 609 constraints, problems are : Problem set: 0 solved, 221 unsolved in 27558 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 231/231 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44309ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 44311ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44882 ms. Remains : 231/231 places, 226/226 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 224 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 17417 steps (229 resets) in 61 ms. (280 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 334 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1328 reset in 293 ms.
Product exploration explored 100000 steps with 1329 reset in 328 ms.
Built C files in :
/tmp/ltsmin17359693951954072594
[2025-06-02 16:27:13] [INFO ] Computing symmetric may disable matrix : 226 transitions.
[2025-06-02 16:27:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:27:13] [INFO ] Computing symmetric may enable matrix : 226 transitions.
[2025-06-02 16:27:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:27:13] [INFO ] Computing Do-Not-Accords matrix : 226 transitions.
[2025-06-02 16:27:13] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:27:13] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17359693951954072594
Running compilation step : cd /tmp/ltsmin17359693951954072594;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 550 ms.
Running link step : cd /tmp/ltsmin17359693951954072594;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin17359693951954072594;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5788259842534980135.hoa' '--buchi-type=spotba'
LTSmin run took 873 ms.
FORMULA Parking-PT-416-LTLCardinality-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-416-LTLCardinality-08 finished in 50599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U X(p1)))'
Support contains 4 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 241/241 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 266 transition count 239
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 266 transition count 239
Applied a total of 4 rules in 5 ms. Remains 266 /268 variables (removed 2) and now considering 239/241 (removed 2) transitions.
// Phase 1: matrix 239 rows 266 cols
[2025-06-02 16:27:14] [INFO ] Computed 55 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:14] [INFO ] Implicit Places using invariants in 157 ms returned [67, 83, 176]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 158 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/268 places, 239/241 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 5 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2025-06-02 16:27:14] [INFO ] Computed 52 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:15] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-02 16:27:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:15] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 16:27:15] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/268 places, 237/241 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 711 ms. Remains : 261/268 places, 237/241 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : Parking-PT-416-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 428 ms.
Product exploration explored 100000 steps with 50000 reset in 458 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-416-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-416-LTLCardinality-09 finished in 1786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(p1)))&&X(X(F(p2)))))'
Support contains 4 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 241/241 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 266 transition count 239
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 266 transition count 239
Applied a total of 4 rules in 4 ms. Remains 266 /268 variables (removed 2) and now considering 239/241 (removed 2) transitions.
// Phase 1: matrix 239 rows 266 cols
[2025-06-02 16:27:16] [INFO ] Computed 55 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:16] [INFO ] Implicit Places using invariants in 116 ms returned [67, 83, 176]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 130 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/268 places, 239/241 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 238
Applied a total of 2 rules in 5 ms. Remains 262 /263 variables (removed 1) and now considering 238/239 (removed 1) transitions.
// Phase 1: matrix 238 rows 262 cols
[2025-06-02 16:27:16] [INFO ] Computed 52 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:16] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-02 16:27:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:16] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 16:27:17] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 262/268 places, 238/241 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 641 ms. Remains : 262/268 places, 238/241 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : Parking-PT-416-LTLCardinality-11
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLCardinality-11 finished in 851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 241/241 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 267 transition count 232
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 259 transition count 232
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 259 transition count 224
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 251 transition count 224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 250 transition count 223
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 250 transition count 223
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 66 place count 234 transition count 207
Applied a total of 66 rules in 17 ms. Remains 234 /268 variables (removed 34) and now considering 207/241 (removed 34) transitions.
// Phase 1: matrix 207 rows 234 cols
[2025-06-02 16:27:17] [INFO ] Computed 55 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:17] [INFO ] Implicit Places using invariants in 123 ms returned [60, 156]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 124 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 232/268 places, 207/241 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 231 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 206
Applied a total of 2 rules in 8 ms. Remains 231 /232 variables (removed 1) and now considering 206/207 (removed 1) transitions.
// Phase 1: matrix 206 rows 231 cols
[2025-06-02 16:27:17] [INFO ] Computed 53 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:17] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-02 16:27:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:17] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 231/268 places, 206/241 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 414 ms. Remains : 231/268 places, 206/241 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-416-LTLCardinality-12
Product exploration explored 100000 steps with 6092 reset in 340 ms.
Product exploration explored 100000 steps with 6032 reset in 361 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (531 resets) in 175 ms. (227 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (20 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
[2025-06-02 16:27:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/81 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/135 variables, 32/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/160 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 31/191 variables, 29/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 27/218 variables, 18/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 9/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/218 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/437 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 26/53 constraints, State Equation: 115/231 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/81 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/135 variables, 32/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/160 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 31/191 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 27/218 variables, 18/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 9/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/218 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/218 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/437 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 26/53 constraints, State Equation: 115/231 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 217ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 25 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 211 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2025-06-02 16:27:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 16:27:19] [INFO ] [Real]Absence check using 53 positive place invariants in 11 ms returned sat
[2025-06-02 16:27:19] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2025-06-02 16:27:19] [INFO ] Computed and/alt/rep : 137/198/137 causal constraints (skipped 1 transitions) in 16 ms.
[2025-06-02 16:27:19] [INFO ] Added : 30 causal constraints over 6 iterations in 115 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 206/206 transitions.
Applied a total of 0 rules in 18 ms. Remains 231 /231 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2025-06-02 16:27:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:20] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-02 16:27:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:20] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:27:20] [INFO ] Redundant transitions in 6 ms returned []
Running 138 sub problems to find dead transitions.
[2025-06-02 16:27:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 4/231 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:27:21] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 206/437 variables, 231/285 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 285 constraints, problems are : Problem set: 0 solved, 138 unsolved in 8156 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 4/231 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 206/437 variables, 231/285 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 138/423 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/437 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 423 constraints, problems are : Problem set: 0 solved, 138 unsolved in 7945 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16115ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 16115ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16417 ms. Remains : 231/231 places, 206/206 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 201 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (528 resets) in 156 ms. (254 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (20 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
[2025-06-02 16:27:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/81 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/135 variables, 32/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/160 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 31/191 variables, 29/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 27/218 variables, 18/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 9/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/218 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/437 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 26/53 constraints, State Equation: 115/231 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/81 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/135 variables, 32/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/160 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 31/191 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 27/218 variables, 18/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 9/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/218 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/218 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/437 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 26/53 constraints, State Equation: 115/231 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 193ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 245 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2025-06-02 16:27:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 16:27:37] [INFO ] [Real]Absence check using 53 positive place invariants in 11 ms returned sat
[2025-06-02 16:27:37] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2025-06-02 16:27:37] [INFO ] Computed and/alt/rep : 137/198/137 causal constraints (skipped 1 transitions) in 9 ms.
[2025-06-02 16:27:37] [INFO ] Added : 30 causal constraints over 6 iterations in 108 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 5750 reset in 305 ms.
Product exploration explored 100000 steps with 6000 reset in 343 ms.
Built C files in :
/tmp/ltsmin16445970489642040646
[2025-06-02 16:27:38] [INFO ] Computing symmetric may disable matrix : 206 transitions.
[2025-06-02 16:27:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:27:38] [INFO ] Computing symmetric may enable matrix : 206 transitions.
[2025-06-02 16:27:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:27:38] [INFO ] Computing Do-Not-Accords matrix : 206 transitions.
[2025-06-02 16:27:38] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:27:38] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16445970489642040646
Running compilation step : cd /tmp/ltsmin16445970489642040646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 387 ms.
Running link step : cd /tmp/ltsmin16445970489642040646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16445970489642040646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12903487625878956707.hoa' '--buchi-type=spotba'
LTSmin run took 809 ms.
FORMULA Parking-PT-416-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-416-LTLCardinality-12 finished in 22305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0)) U G(!p1)))'
Support contains 4 out of 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 241/241 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 267 transition count 232
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 259 transition count 232
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 259 transition count 224
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 251 transition count 224
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 249 transition count 222
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 249 transition count 222
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 68 place count 233 transition count 206
Applied a total of 68 rules in 17 ms. Remains 233 /268 variables (removed 35) and now considering 206/241 (removed 35) transitions.
// Phase 1: matrix 206 rows 233 cols
[2025-06-02 16:27:39] [INFO ] Computed 55 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:39] [INFO ] Implicit Places using invariants in 93 ms returned [60, 76, 156]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 94 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 230/268 places, 206/241 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 229 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 229 transition count 205
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 4 place count 228 transition count 204
Applied a total of 4 rules in 8 ms. Remains 228 /230 variables (removed 2) and now considering 204/206 (removed 2) transitions.
// Phase 1: matrix 204 rows 228 cols
[2025-06-02 16:27:39] [INFO ] Computed 52 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:39] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-02 16:27:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:40] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 228/268 places, 204/241 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 354 ms. Remains : 228/268 places, 204/241 transitions.
Stuttering acceptance computed with spot in 57 ms :[p1, p0]
Running random walk in product with property : Parking-PT-416-LTLCardinality-13
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLCardinality-13 finished in 423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (X(p1)&&(G(p0)||p2)))))'
Support contains 6 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 241/241 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 266 transition count 239
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 266 transition count 239
Applied a total of 4 rules in 9 ms. Remains 266 /268 variables (removed 2) and now considering 239/241 (removed 2) transitions.
// Phase 1: matrix 239 rows 266 cols
[2025-06-02 16:27:40] [INFO ] Computed 55 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:40] [INFO ] Implicit Places using invariants in 115 ms returned [83, 176]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 116 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 264/268 places, 239/241 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 263 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 238
Applied a total of 2 rules in 3 ms. Remains 263 /264 variables (removed 1) and now considering 238/239 (removed 1) transitions.
// Phase 1: matrix 238 rows 263 cols
[2025-06-02 16:27:40] [INFO ] Computed 53 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:40] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-02 16:27:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:40] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 16:27:40] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/268 places, 238/241 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 506 ms. Remains : 263/268 places, 238/241 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-416-LTLCardinality-14
Product exploration explored 100000 steps with 5946 reset in 441 ms.
Product exploration explored 100000 steps with 5922 reset in 467 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (OR p2 p0)), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) p0)), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR p2 p0))), (X (X (NOT (OR p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 13 factoid took 548 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 30941 steps (398 resets) in 181 ms. (170 steps per ms) remains 0/12 properties
Knowledge obtained : [(AND p2 p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (OR p2 p0)), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) p0)), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR p2 p0))), (X (X (NOT (OR p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p2) p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p0 p2 p1))), (F (NOT p2)), (F (NOT (AND p0 p2))), (F (NOT (OR p0 p2))), (F (NOT p1)), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 13 factoid took 1041 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 238/238 transitions.
Applied a total of 0 rules in 5 ms. Remains 263 /263 variables (removed 0) and now considering 238/238 (removed 0) transitions.
[2025-06-02 16:27:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:44] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-02 16:27:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:44] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 16:27:44] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 237 sub problems to find dead transitions.
[2025-06-02 16:27:44] [INFO ] Invariant cache hit.
[2025-06-02 16:27:44] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:27:47] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:27:47] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:27:47] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:27:48] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 238/501 variables, 263/320 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 60/380 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 0/501 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 380 constraints, problems are : Problem set: 0 solved, 237 unsolved in 17940 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 263/263 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 238/501 variables, 263/320 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 60/380 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 237/617 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (OVERLAPS) 0/501 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 617 constraints, problems are : Problem set: 0 solved, 237 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 263/263 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47990ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 47991ms
Finished structural reductions in LTL mode , in 1 iterations and 48407 ms. Remains : 263/263 places, 238/238 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT p2)), (X (OR p0 p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (AND p0 (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR p0 p2))), (X (X (NOT (OR p0 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 13 factoid took 551 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 20070 steps (254 resets) in 114 ms. (174 steps per ms) remains 0/12 properties
Knowledge obtained : [(AND p0 p2 p1), (X (NOT p2)), (X (OR p0 p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (AND p0 (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR p0 p2))), (X (X (NOT (OR p0 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p2) p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p0 p2 p1))), (F (NOT p2)), (F (NOT (AND p0 p2))), (F (NOT (OR p0 p2))), (F (NOT p1)), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 13 factoid took 1125 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5850 reset in 397 ms.
Product exploration explored 100000 steps with 5816 reset in 430 ms.
Applying partial POR strategy [false, false, true, false, false, true, false]
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 238/238 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 263 transition count 238
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 8 place count 263 transition count 238
Deduced a syphon composed of 16 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 16 place count 263 transition count 238
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 24 place count 255 transition count 230
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 32 place count 255 transition count 230
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 48 place count 255 transition count 238
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 48 rules in 31 ms. Remains 255 /263 variables (removed 8) and now considering 238/238 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:28:37] [INFO ] Redundant transitions in 3 ms returned []
Running 237 sub problems to find dead transitions.
// Phase 1: matrix 238 rows 255 cols
[2025-06-02 16:28:37] [INFO ] Computed 53 invariants in 1 ms
[2025-06-02 16:28:37] [INFO ] State equation strengthened by 92 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/255 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:40] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:40] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:40] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 3 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:40] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:40] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:40] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:40] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 2 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 8/61 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/61 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 238/493 variables, 255/316 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 92/408 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 0/408 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 0/493 variables, 0/408 constraints. Problems are: Problem set: 32 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 408 constraints, problems are : Problem set: 32 solved, 205 unsolved in 17454 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 255/255 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 32 solved, 205 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 25/255 variables, 53/53 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 8/61 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/61 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 238/493 variables, 255/316 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 92/408 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 205/613 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 0/613 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 0/493 variables, 0/613 constraints. Problems are: Problem set: 32 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 493/493 variables, and 613 constraints, problems are : Problem set: 32 solved, 205 unsolved in 23921 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 255/255 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 205/237 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41399ms problems are : Problem set: 32 solved, 205 unsolved
Search for dead transitions found 32 dead transitions in 41400ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 255/263 places, 206/238 transitions.
Graph (complete) has 620 edges and 255 vertex of which 231 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 230
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 20 ms. Remains 231 /255 variables (removed 24) and now considering 230/206 (removed -24) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 231/263 places, 230/238 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41460 ms. Remains : 231/263 places, 230/238 transitions.
Built C files in :
/tmp/ltsmin11377783232018337471
[2025-06-02 16:29:18] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11377783232018337471
Running compilation step : cd /tmp/ltsmin11377783232018337471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 376 ms.
Running link step : cd /tmp/ltsmin11377783232018337471;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11377783232018337471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10835338976121971189.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 238/238 transitions.
Applied a total of 0 rules in 7 ms. Remains 263 /263 variables (removed 0) and now considering 238/238 (removed 0) transitions.
// Phase 1: matrix 238 rows 263 cols
[2025-06-02 16:29:33] [INFO ] Computed 53 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:29:33] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-02 16:29:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:29:33] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 16:29:33] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 237 sub problems to find dead transitions.
[2025-06-02 16:29:33] [INFO ] Invariant cache hit.
[2025-06-02 16:29:33] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:29:36] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:29:36] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:29:37] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:29:37] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 238/501 variables, 263/320 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 60/380 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 0/501 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 380 constraints, problems are : Problem set: 0 solved, 237 unsolved in 17739 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 263/263 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 238/501 variables, 263/320 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 60/380 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 237/617 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (OVERLAPS) 0/501 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 617 constraints, problems are : Problem set: 0 solved, 237 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 263/263 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47782ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 47783ms
Finished structural reductions in LTL mode , in 1 iterations and 48176 ms. Remains : 263/263 places, 238/238 transitions.
Built C files in :
/tmp/ltsmin2869342923470827448
[2025-06-02 16:30:21] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2869342923470827448
Running compilation step : cd /tmp/ltsmin2869342923470827448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 367 ms.
Running link step : cd /tmp/ltsmin2869342923470827448;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2869342923470827448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6488695752653310800.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 16:30:36] [INFO ] Flatten gal took : 13 ms
[2025-06-02 16:30:36] [INFO ] Flatten gal took : 14 ms
[2025-06-02 16:30:36] [INFO ] Time to serialize gal into /tmp/LTL4214832314070673363.gal : 3 ms
[2025-06-02 16:30:37] [INFO ] Time to serialize properties into /tmp/LTL6175530512597507157.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4214832314070673363.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17256911615502478235.hoa' '-atoms' '/tmp/LTL6175530512597507157.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6175530512597507157.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17256911615502478235.hoa
Detected timeout of ITS tools.
[2025-06-02 16:30:52] [INFO ] Flatten gal took : 12 ms
[2025-06-02 16:30:52] [INFO ] Flatten gal took : 11 ms
[2025-06-02 16:30:52] [INFO ] Time to serialize gal into /tmp/LTL3417243229201845143.gal : 2 ms
[2025-06-02 16:30:52] [INFO ] Time to serialize properties into /tmp/LTL9778702037825873153.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3417243229201845143.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9778702037825873153.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((F("((p227==0)||(p53==1))"))U((X("((p116==0)||(p289==1))"))&&(("((p72==0)||(p233==1))")||(G("((p227==0)||(p53==1))")))))))
Formula 0 simplified : X(G!"((p227==0)||(p53==1))" R (X!"((p116==0)||(p289==1))" | (!"((p72==0)||(p233==1))" & F!"((p227==0)||(p53==1))")))
Detected timeout of ITS tools.
[2025-06-02 16:31:07] [INFO ] Flatten gal took : 16 ms
[2025-06-02 16:31:07] [INFO ] Applying decomposition
[2025-06-02 16:31:07] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13400192810233382501.txt' '-o' '/tmp/graph13400192810233382501.bin' '-w' '/tmp/graph13400192810233382501.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13400192810233382501.bin' '-l' '-1' '-v' '-w' '/tmp/graph13400192810233382501.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:31:07] [INFO ] Decomposing Gal with order
[2025-06-02 16:31:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:31:07] [INFO ] Removed a total of 26 redundant transitions.
[2025-06-02 16:31:07] [INFO ] Flatten gal took : 48 ms
[2025-06-02 16:31:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-02 16:31:07] [INFO ] Time to serialize gal into /tmp/LTL4277729374829308026.gal : 6 ms
[2025-06-02 16:31:07] [INFO ] Time to serialize properties into /tmp/LTL12635956799303158490.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4277729374829308026.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12635956799303158490.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F("((i9.i3.u70.p227==0)||(i1.i2.u33.p53==1))"))U((X("((i6.u53.p116==0)||(i11.i2.u87.p289==1))"))&&(("((i1.i3.u25.p72==0)||(i9.i3...226
Formula 0 simplified : X(G!"((i9.i3.u70.p227==0)||(i1.i2.u33.p53==1))" R (X!"((i6.u53.p116==0)||(i11.i2.u87.p289==1))" | (!"((i1.i3.u25.p72==0)||(i9.i3.u71...217
Reverse transition relation is NOT exact ! Due to transitions i1.i2.u33.t57, i6.u53.t39, i9.i3.u71.t21, i12.u90.t3, Intersection with reachable at each st...215
Computing Next relation with stutter on 130321 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
614 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.1804,125328,1,0,166443,1994,3586,301332,469,7190,143605
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-416-LTLCardinality-14 finished in 213819 ms.
All properties solved by simple procedures.
Total runtime 294602 ms.

BK_STOP 1748881874006

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Parking-PT-416"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is Parking-PT-416, 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 r142-tall-174876812500419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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