About the Execution of ITS-Tools for Parking-PT-864
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFT?FFT?F?FFFF?F | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812600444.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-864, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812600444
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 880K
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K 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 427K 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-864-LTLFireability-00
FORMULA_NAME Parking-PT-864-LTLFireability-01
FORMULA_NAME Parking-PT-864-LTLFireability-02
FORMULA_NAME Parking-PT-864-LTLFireability-03
FORMULA_NAME Parking-PT-864-LTLFireability-04
FORMULA_NAME Parking-PT-864-LTLFireability-05
FORMULA_NAME Parking-PT-864-LTLFireability-06
FORMULA_NAME Parking-PT-864-LTLFireability-07
FORMULA_NAME Parking-PT-864-LTLFireability-08
FORMULA_NAME Parking-PT-864-LTLFireability-09
FORMULA_NAME Parking-PT-864-LTLFireability-10
FORMULA_NAME Parking-PT-864-LTLFireability-11
FORMULA_NAME Parking-PT-864-LTLFireability-12
FORMULA_NAME Parking-PT-864-LTLFireability-13
FORMULA_NAME Parking-PT-864-LTLFireability-14
FORMULA_NAME Parking-PT-864-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748889457767
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-864
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 18:37:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 18:37:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 18:37:39] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2025-06-02 18:37:39] [INFO ] Transformed 1185 places.
[2025-06-02 18:37:39] [INFO ] Transformed 1697 transitions.
[2025-06-02 18:37:39] [INFO ] Found NUPN structural information;
[2025-06-02 18:37:39] [INFO ] Parsed PT model containing 1185 places and 1697 transitions and 5073 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
FORMULA Parking-PT-864-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1177 transition count 1001
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1177 transition count 1001
Applied a total of 16 rules in 251 ms. Remains 1177 /1185 variables (removed 8) and now considering 1001/1009 (removed 8) transitions.
// Phase 1: matrix 1001 rows 1177 cols
[2025-06-02 18:37:39] [INFO ] Computed 280 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:37:40] [INFO ] Implicit Places using invariants in 912 ms returned [152, 160, 168, 176, 184, 192, 200, 208, 240, 242, 285, 301, 309, 317, 325, 333, 341, 373, 375, 418, 426, 434, 442, 450, 458, 466, 474, 506, 508, 551, 559, 567, 575, 583, 591, 599, 607, 639, 684, 692, 700, 708, 716, 724, 732, 740, 772, 774, 817, 825, 833, 841, 849, 857, 865, 873, 905, 907, 950, 958, 966, 974, 982, 990, 998, 1006, 1038, 1040, 1083, 1099, 1107, 1115, 1123, 1131, 1139, 1171, 1173]
Discarding 77 places :
Implicit Place search using SMT only with invariants took 948 ms to find 77 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1100/1185 places, 1001/1009 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 1039 transition count 940
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 1039 transition count 940
Applied a total of 122 rules in 148 ms. Remains 1039 /1100 variables (removed 61) and now considering 940/1001 (removed 61) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2025-06-02 18:37:40] [INFO ] Computed 203 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:37:41] [INFO ] Implicit Places using invariants in 869 ms returned []
[2025-06-02 18:37:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:37:41] [INFO ] State equation strengthened by 248 read => feed constraints.
[2025-06-02 18:37:45] [INFO ] Implicit Places using invariants and state equation in 4246 ms returned []
Implicit Place search using SMT with State Equation took 5118 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1039/1185 places, 940/1009 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6481 ms. Remains : 1039/1185 places, 940/1009 transitions.
Support contains 49 out of 1039 places after structural reductions.
[2025-06-02 18:37:46] [INFO ] Flatten gal took : 116 ms
[2025-06-02 18:37:46] [INFO ] Flatten gal took : 59 ms
[2025-06-02 18:37:46] [INFO ] Input system was already deterministic with 940 transitions.
RANDOM walk for 40000 steps (152 resets) in 2951 ms. (13 steps per ms) remains 6/33 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
[2025-06-02 18:37:47] [INFO ] Invariant cache hit.
[2025-06-02 18:37:47] [INFO ] State equation strengthened by 248 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/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 321/335 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 704/1039 variables, 192/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1039 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 940/1979 variables, 1039/1242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1979 variables, 248/1490 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1979 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1979 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1979/1979 variables, and 1490 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1315 ms.
Refiners :[Positive P Invariants (semi-flows): 203/203 constraints, State Equation: 1039/1039 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 321/335 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 704/1039 variables, 192/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:37:49] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1039 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1039 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 940/1979 variables, 1039/1243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1979 variables, 248/1491 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1979 variables, 6/1497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1979 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1979 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1979/1979 variables, and 1497 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3473 ms.
Refiners :[Positive P Invariants (semi-flows): 203/203 constraints, State Equation: 1039/1039 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4841ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 4 properties in 3482 ms.
Support contains 4 out of 1039 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1039/1039 places, 940/940 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1039 transition count 908
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1007 transition count 908
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1007 transition count 876
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 975 transition count 876
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 974 transition count 875
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 974 transition count 875
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 228 place count 925 transition count 826
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 230 place count 924 transition count 833
Free-agglomeration rule applied 251 times.
Iterating global reduction 2 with 251 rules applied. Total rules applied 481 place count 924 transition count 582
Reduce places removed 251 places and 0 transitions.
Graph (complete) has 1363 edges and 673 vertex of which 266 are kept as prefixes of interest. Removing 407 places using SCC suffix rule.2 ms
Discarding 407 places :
Also discarding 330 output transitions
Drop transitions (Output transitions of discarded places.) removed 330 transitions
Iterating post reduction 2 with 252 rules applied. Total rules applied 733 place count 266 transition count 252
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 771 place count 266 transition count 214
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 772 place count 266 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 773 place count 265 transition count 213
Applied a total of 773 rules in 246 ms. Remains 265 /1039 variables (removed 774) and now considering 213/940 (removed 727) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 265/1039 places, 213/940 transitions.
RANDOM walk for 40000 steps (8 resets) in 244 ms. (163 steps per ms) remains 1/2 properties
BEST_FIRST walk for 3140 steps (0 resets) in 12 ms. (241 steps per ms) remains 0/1 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' '!(F(p0))'
Support contains 2 out of 1039 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1039/1039 places, 940/940 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1039 transition count 909
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1008 transition count 909
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 62 place count 1008 transition count 877
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 126 place count 976 transition count 877
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 975 transition count 876
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 975 transition count 876
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 224 place count 927 transition count 828
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 226 place count 926 transition count 835
Applied a total of 226 rules in 161 ms. Remains 926 /1039 variables (removed 113) and now considering 835/940 (removed 105) transitions.
// Phase 1: matrix 835 rows 926 cols
[2025-06-02 18:37:57] [INFO ] Computed 203 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:37:57] [INFO ] Implicit Places using invariants in 421 ms returned [256, 516, 866]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 423 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 923/1039 places, 835/940 transitions.
Applied a total of 0 rules in 39 ms. Remains 923 /923 variables (removed 0) and now considering 835/835 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 623 ms. Remains : 923/1039 places, 835/940 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-00
Stuttering criterion allowed to conclude after 238 steps with 0 reset in 11 ms.
FORMULA Parking-PT-864-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-00 finished in 809 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((X(p1)||p0))&&(G(p2)||X(p3)))))'
Support contains 4 out of 1039 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1039/1039 places, 940/940 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1038 transition count 939
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1038 transition count 939
Applied a total of 2 rules in 55 ms. Remains 1038 /1039 variables (removed 1) and now considering 939/940 (removed 1) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2025-06-02 18:37:57] [INFO ] Computed 203 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:37:58] [INFO ] Implicit Places using invariants in 506 ms returned [274, 572, 967]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 507 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1039 places, 939/940 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 54 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2025-06-02 18:37:58] [INFO ] Computed 200 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:37:58] [INFO ] Implicit Places using invariants in 518 ms returned []
[2025-06-02 18:37:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:37:59] [INFO ] State equation strengthened by 248 read => feed constraints.
[2025-06-02 18:38:04] [INFO ] Implicit Places using invariants and state equation in 5741 ms returned []
Implicit Place search using SMT with State Equation took 6262 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1039 places, 937/940 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6879 ms. Remains : 1033/1039 places, 937/940 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3)), true, (NOT p2)]
Running random walk in product with property : Parking-PT-864-LTLFireability-01
Entered a terminal (fully accepting) state of product in 384 steps with 93 reset in 31 ms.
FORMULA Parking-PT-864-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-01 finished in 7198 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(p0)||X(F(p1))))'
Support contains 4 out of 1039 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1039/1039 places, 940/940 transitions.
Applied a total of 0 rules in 34 ms. Remains 1039 /1039 variables (removed 0) and now considering 940/940 (removed 0) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2025-06-02 18:38:04] [INFO ] Computed 203 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:38:05] [INFO ] Implicit Places using invariants in 457 ms returned [274, 968]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 461 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1037/1039 places, 940/940 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1035 transition count 938
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1035 transition count 938
Applied a total of 4 rules in 58 ms. Remains 1035 /1037 variables (removed 2) and now considering 938/940 (removed 2) transitions.
// Phase 1: matrix 938 rows 1035 cols
[2025-06-02 18:38:05] [INFO ] Computed 201 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:38:05] [INFO ] Implicit Places using invariants in 525 ms returned []
[2025-06-02 18:38:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:38:06] [INFO ] State equation strengthened by 248 read => feed constraints.
[2025-06-02 18:38:11] [INFO ] Implicit Places using invariants and state equation in 5763 ms returned []
Implicit Place search using SMT with State Equation took 6291 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1035/1039 places, 938/940 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6846 ms. Remains : 1035/1039 places, 938/940 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-864-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 2232 ms.
Product exploration explored 100000 steps with 50000 reset in 2243 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 p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 25 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-864-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-864-LTLFireability-02 finished in 11490 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(X(F((p0&&F((p1||G(p2))))))))'
Support contains 6 out of 1039 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1039/1039 places, 940/940 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1038 transition count 939
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1038 transition count 939
Applied a total of 2 rules in 50 ms. Remains 1038 /1039 variables (removed 1) and now considering 939/940 (removed 1) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2025-06-02 18:38:16] [INFO ] Computed 203 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:38:16] [INFO ] Implicit Places using invariants in 482 ms returned [274, 572, 967]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 486 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1039 places, 939/940 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 52 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2025-06-02 18:38:16] [INFO ] Computed 200 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:38:17] [INFO ] Implicit Places using invariants in 482 ms returned []
[2025-06-02 18:38:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:38:17] [INFO ] State equation strengthened by 248 read => feed constraints.
[2025-06-02 18:38:23] [INFO ] Implicit Places using invariants and state equation in 5747 ms returned []
Implicit Place search using SMT with State Equation took 6235 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1039 places, 937/940 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6823 ms. Remains : 1033/1039 places, 937/940 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Parking-PT-864-LTLFireability-03
Product exploration explored 100000 steps with 407 reset in 817 ms.
Product exploration explored 100000 steps with 404 reset in 873 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 (NOT p1) p2), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 66 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (153 resets) in 604 ms. (66 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
[2025-06-02 18:38:25] [INFO ] Invariant cache hit.
[2025-06-02 18:38:25] [INFO ] State equation strengthened by 248 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 161/165 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 868/1033 variables, 196/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 937/1970 variables, 1033/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1970 variables, 248/1481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1970/1970 variables, and 1481 constraints, problems are : Problem set: 0 solved, 2 unsolved in 683 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 161/165 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 868/1033 variables, 196/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 937/1970 variables, 1033/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1970 variables, 248/1481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 2/1483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1970 variables, 0/1483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1970 variables, 0/1483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1970/1970 variables, and 1483 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1073 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1773ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 343 ms.
Support contains 4 out of 1033 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1033 transition count 905
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1001 transition count 905
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1001 transition count 873
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 969 transition count 873
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 224 place count 921 transition count 825
Free-agglomeration rule applied 262 times.
Iterating global reduction 2 with 262 rules applied. Total rules applied 486 place count 921 transition count 563
Reduce places removed 262 places and 0 transitions.
Graph (complete) has 1326 edges and 659 vertex of which 179 are kept as prefixes of interest. Removing 480 places using SCC suffix rule.1 ms
Discarding 480 places :
Also discarding 396 output transitions
Drop transitions (Output transitions of discarded places.) removed 396 transitions
Iterating post reduction 2 with 263 rules applied. Total rules applied 749 place count 179 transition count 167
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 773 place count 179 transition count 143
Applied a total of 773 rules in 91 ms. Remains 179 /1033 variables (removed 854) and now considering 143/937 (removed 794) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 179/1033 places, 143/937 transitions.
RANDOM walk for 40000 steps (339 resets) in 117 ms. (338 steps per ms) remains 2/2 properties
BEST_FIRST walk for 2153 steps (0 resets) in 9 ms. (215 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 1033 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 64 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2025-06-02 18:38:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:38:28] [INFO ] Implicit Places using invariants in 500 ms returned []
[2025-06-02 18:38:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:38:29] [INFO ] State equation strengthened by 248 read => feed constraints.
[2025-06-02 18:38:34] [INFO ] Implicit Places using invariants and state equation in 5701 ms returned []
Implicit Place search using SMT with State Equation took 6206 ms to find 0 implicit places.
Running 936 sub problems to find dead transitions.
[2025-06-02 18:38:34] [INFO ] Invariant cache hit.
[2025-06-02 18:38:34] [INFO ] State equation strengthened by 248 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1032 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 936 unsolved
SMT process timed out in 30293ms, After SMT, problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 30299ms
Finished structural reductions in LTL mode , in 1 iterations and 36576 ms. Remains : 1033/1033 places, 937/937 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 (NOT p1) p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 60 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (153 resets) in 439 ms. (90 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
[2025-06-02 18:39:05] [INFO ] Invariant cache hit.
[2025-06-02 18:39:05] [INFO ] State equation strengthened by 248 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 161/165 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 868/1033 variables, 196/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 937/1970 variables, 1033/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1970 variables, 248/1481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1970/1970 variables, and 1481 constraints, problems are : Problem set: 0 solved, 2 unsolved in 730 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 161/165 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 868/1033 variables, 196/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 937/1970 variables, 1033/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1970 variables, 248/1481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 2/1483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1970 variables, 0/1483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1970 variables, 0/1483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1970/1970 variables, and 1483 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1101 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1848ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 354 ms.
Support contains 4 out of 1033 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1033 transition count 905
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1001 transition count 905
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1001 transition count 873
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 969 transition count 873
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 224 place count 921 transition count 825
Free-agglomeration rule applied 262 times.
Iterating global reduction 2 with 262 rules applied. Total rules applied 486 place count 921 transition count 563
Reduce places removed 262 places and 0 transitions.
Graph (complete) has 1326 edges and 659 vertex of which 179 are kept as prefixes of interest. Removing 480 places using SCC suffix rule.0 ms
Discarding 480 places :
Also discarding 396 output transitions
Drop transitions (Output transitions of discarded places.) removed 396 transitions
Iterating post reduction 2 with 263 rules applied. Total rules applied 749 place count 179 transition count 167
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 773 place count 179 transition count 143
Applied a total of 773 rules in 71 ms. Remains 179 /1033 variables (removed 854) and now considering 143/937 (removed 794) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 179/1033 places, 143/937 transitions.
RANDOM walk for 40000 steps (330 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
BEST_FIRST walk for 1211 steps (0 resets) in 5 ms. (201 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p2)]
False Knowledge obtained : [(F p1), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 1 factoid took 156 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 407 reset in 782 ms.
Product exploration explored 100000 steps with 408 reset in 905 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 1033 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1033 transition count 937
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 32 Pre rules applied. Total rules applied 32 place count 1033 transition count 937
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 64 place count 1033 transition count 937
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 96 place count 1001 transition count 905
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 128 place count 1001 transition count 905
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 176 place count 1001 transition count 937
Deduced a syphon composed of 80 places in 1 ms
Applied a total of 176 rules in 208 ms. Remains 1001 /1033 variables (removed 32) and now considering 937/937 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:39:10] [INFO ] Redundant transitions in 75 ms returned []
Running 936 sub problems to find dead transitions.
// Phase 1: matrix 937 rows 1001 cols
[2025-06-02 18:39:10] [INFO ] Computed 200 invariants in 2 ms
[2025-06-02 18:39:10] [INFO ] State equation strengthened by 376 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 936 unsolved
SMT process timed out in 30247ms, After SMT, problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 30250ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/1033 places, 937/937 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30571 ms. Remains : 1001/1033 places, 937/937 transitions.
Built C files in :
/tmp/ltsmin16786979768287118850
[2025-06-02 18:39:40] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16786979768287118850
Running compilation step : cd /tmp/ltsmin16786979768287118850;'/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 1703 ms.
Running link step : cd /tmp/ltsmin16786979768287118850;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin16786979768287118850;'/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/stateBased1485779225030236808.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1033 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 25 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2025-06-02 18:39:55] [INFO ] Computed 200 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:39:56] [INFO ] Implicit Places using invariants in 538 ms returned []
[2025-06-02 18:39:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:39:56] [INFO ] State equation strengthened by 248 read => feed constraints.
[2025-06-02 18:40:02] [INFO ] Implicit Places using invariants and state equation in 5753 ms returned []
Implicit Place search using SMT with State Equation took 6299 ms to find 0 implicit places.
Running 936 sub problems to find dead transitions.
[2025-06-02 18:40:02] [INFO ] Invariant cache hit.
[2025-06-02 18:40:02] [INFO ] State equation strengthened by 248 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1032 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 936 unsolved
SMT process timed out in 30205ms, After SMT, problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 30208ms
Finished structural reductions in LTL mode , in 1 iterations and 36538 ms. Remains : 1033/1033 places, 937/937 transitions.
Built C files in :
/tmp/ltsmin13941925983970445084
[2025-06-02 18:40:32] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13941925983970445084
Running compilation step : cd /tmp/ltsmin13941925983970445084;'/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 1544 ms.
Running link step : cd /tmp/ltsmin13941925983970445084;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13941925983970445084;'/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/stateBased508526298181298046.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 18:40:47] [INFO ] Flatten gal took : 54 ms
[2025-06-02 18:40:47] [INFO ] Flatten gal took : 37 ms
[2025-06-02 18:40:47] [INFO ] Time to serialize gal into /tmp/LTL15603861037975123891.gal : 8 ms
[2025-06-02 18:40:47] [INFO ] Time to serialize properties into /tmp/LTL6702161961317454577.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/LTL15603861037975123891.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4122959359021667850.hoa' '-atoms' '/tmp/LTL6702161961317454577.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/LTL6702161961317454577.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4122959359021667850.hoa
Detected timeout of ITS tools.
[2025-06-02 18:41:02] [INFO ] Flatten gal took : 36 ms
[2025-06-02 18:41:02] [INFO ] Flatten gal took : 34 ms
[2025-06-02 18:41:02] [INFO ] Time to serialize gal into /tmp/LTL14873671911951825088.gal : 6 ms
[2025-06-02 18:41:02] [INFO ] Time to serialize properties into /tmp/LTL12075271302193753929.ltl : 6 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/LTL14873671911951825088.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12075271302193753929.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...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F((F(("((p271==1)&&(p372==1))")||(G("((p396==0)||(p488==0))"))))&&("((p919==0)||(p955==0))"))))))
Formula 0 simplified : XXG(!"((p919==0)||(p955==0))" | G(!"((p271==1)&&(p372==1))" & F!"((p396==0)||(p488==0))"))
Detected timeout of ITS tools.
[2025-06-02 18:41:18] [INFO ] Flatten gal took : 29 ms
[2025-06-02 18:41:18] [INFO ] Applying decomposition
[2025-06-02 18:41:18] [INFO ] Flatten gal took : 29 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/graph11416392565831661606.txt' '-o' '/tmp/graph11416392565831661606.bin' '-w' '/tmp/graph11416392565831661606.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11416392565831661606.bin' '-l' '-1' '-v' '-w' '/tmp/graph11416392565831661606.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:41:18] [INFO ] Decomposing Gal with order
[2025-06-02 18:41:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:41:18] [INFO ] Removed a total of 118 redundant transitions.
[2025-06-02 18:41:18] [INFO ] Flatten gal took : 96 ms
[2025-06-02 18:41:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2025-06-02 18:41:18] [INFO ] Time to serialize gal into /tmp/LTL913284326138776116.gal : 15 ms
[2025-06-02 18:41:18] [INFO ] Time to serialize properties into /tmp/LTL1099062263740454573.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/LTL913284326138776116.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1099062263740454573.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...253
Read 1 LTL properties
Checking formula 0 : !((X(X(F((F(("((i4.u106.p271==1)&&(i4.u131.p372==1))")||(G("((i5.u141.p396==0)||(i5.u163.p488==0))"))))&&("((i10.i2.i3.u294.p919==0)||...181
Formula 0 simplified : XXG(!"((i10.i2.i3.u294.p919==0)||(i11.u311.p955==0))" | G(!"((i4.u106.p271==1)&&(i4.u131.p372==1))" & F!"((i5.u141.p396==0)||(i5.u16...169
Detected timeout of ITS tools.
Treatment of property Parking-PT-864-LTLFireability-03 finished in 197127 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(X(X(F(p0))))&&F(p1)))'
Support contains 2 out of 1039 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1039/1039 places, 940/940 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1038 transition count 939
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1038 transition count 939
Applied a total of 2 rules in 40 ms. Remains 1038 /1039 variables (removed 1) and now considering 939/940 (removed 1) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2025-06-02 18:41:33] [INFO ] Computed 203 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:41:34] [INFO ] Implicit Places using invariants in 537 ms returned [274, 572, 967]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 538 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1039 places, 939/940 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 41 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2025-06-02 18:41:34] [INFO ] Computed 200 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:41:34] [INFO ] Implicit Places using invariants in 484 ms returned []
[2025-06-02 18:41:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:41:34] [INFO ] State equation strengthened by 248 read => feed constraints.
[2025-06-02 18:41:40] [INFO ] Implicit Places using invariants and state equation in 5961 ms returned []
Implicit Place search using SMT with State Equation took 6459 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1039 places, 937/940 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7078 ms. Remains : 1033/1039 places, 937/940 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-05
Stuttering criterion allowed to conclude after 286 steps with 0 reset in 4 ms.
FORMULA Parking-PT-864-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-05 finished in 7288 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(X(X(F(p0)))))'
Support contains 1 out of 1039 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1039/1039 places, 940/940 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1038 transition count 939
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1038 transition count 939
Applied a total of 2 rules in 45 ms. Remains 1038 /1039 variables (removed 1) and now considering 939/940 (removed 1) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2025-06-02 18:41:40] [INFO ] Computed 203 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:41:41] [INFO ] Implicit Places using invariants in 490 ms returned [274, 572, 967]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 491 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1039 places, 939/940 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 44 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2025-06-02 18:41:41] [INFO ] Computed 200 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:41:41] [INFO ] Implicit Places using invariants in 492 ms returned []
[2025-06-02 18:41:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:41:42] [INFO ] State equation strengthened by 248 read => feed constraints.
[2025-06-02 18:41:47] [INFO ] Implicit Places using invariants and state equation in 5928 ms returned []
Implicit Place search using SMT with State Equation took 6422 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1039 places, 937/940 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7003 ms. Remains : 1033/1039 places, 937/940 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-06
Product exploration explored 100000 steps with 25000 reset in 1914 ms.
Product exploration explored 100000 steps with 25000 reset in 1999 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 55 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 14348 steps (53 resets) in 147 ms. (96 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1033 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 30 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2025-06-02 18:41:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:41:53] [INFO ] Implicit Places using invariants in 478 ms returned []
[2025-06-02 18:41:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:41:53] [INFO ] State equation strengthened by 248 read => feed constraints.
[2025-06-02 18:41:58] [INFO ] Implicit Places using invariants and state equation in 5866 ms returned []
Implicit Place search using SMT with State Equation took 6346 ms to find 0 implicit places.
Running 936 sub problems to find dead transitions.
[2025-06-02 18:41:58] [INFO ] Invariant cache hit.
[2025-06-02 18:41:58] [INFO ] State equation strengthened by 248 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1032 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 936 unsolved
SMT process timed out in 30191ms, After SMT, problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 30195ms
Finished structural reductions in LTL mode , in 1 iterations and 36581 ms. Remains : 1033/1033 places, 937/937 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 14503 steps (52 resets) in 136 ms. (105 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1898 ms.
Product exploration explored 100000 steps with 25000 reset in 1998 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1033 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1033 transition count 937
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 32 Pre rules applied. Total rules applied 32 place count 1033 transition count 937
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 64 place count 1033 transition count 937
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 96 place count 1001 transition count 905
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 128 place count 1001 transition count 905
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 175 place count 1001 transition count 936
Deduced a syphon composed of 79 places in 0 ms
Applied a total of 175 rules in 92 ms. Remains 1001 /1033 variables (removed 32) and now considering 936/937 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:42:34] [INFO ] Redundant transitions in 34 ms returned []
Running 935 sub problems to find dead transitions.
// Phase 1: matrix 936 rows 1001 cols
[2025-06-02 18:42:34] [INFO ] Computed 200 invariants in 3 ms
[2025-06-02 18:42:34] [INFO ] State equation strengthened by 375 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 935 unsolved
SMT process timed out in 30212ms, After SMT, problems are : Problem set: 0 solved, 935 unsolved
Search for dead transitions found 0 dead transitions in 30214ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/1033 places, 936/937 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30351 ms. Remains : 1001/1033 places, 936/937 transitions.
Built C files in :
/tmp/ltsmin8184152395456705945
[2025-06-02 18:43:04] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8184152395456705945
Running compilation step : cd /tmp/ltsmin8184152395456705945;'/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 1563 ms.
Running link step : cd /tmp/ltsmin8184152395456705945;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8184152395456705945;'/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/stateBased4977504446417839131.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 1033 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 20 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2025-06-02 18:43:19] [INFO ] Computed 200 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:43:19] [INFO ] Implicit Places using invariants in 468 ms returned []
[2025-06-02 18:43:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:43:20] [INFO ] State equation strengthened by 248 read => feed constraints.
[2025-06-02 18:43:25] [INFO ] Implicit Places using invariants and state equation in 5855 ms returned []
Implicit Place search using SMT with State Equation took 6327 ms to find 0 implicit places.
Running 936 sub problems to find dead transitions.
[2025-06-02 18:43:25] [INFO ] Invariant cache hit.
[2025-06-02 18:43:25] [INFO ] State equation strengthened by 248 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1032 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 936 unsolved
SMT process timed out in 30201ms, After SMT, problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 30205ms
Finished structural reductions in LTL mode , in 1 iterations and 36558 ms. Remains : 1033/1033 places, 937/937 transitions.
Built C files in :
/tmp/ltsmin16297267148047010184
[2025-06-02 18:43:55] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16297267148047010184
Running compilation step : cd /tmp/ltsmin16297267148047010184;'/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 1572 ms.
Running link step : cd /tmp/ltsmin16297267148047010184;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16297267148047010184;'/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/stateBased12942946607009464471.hoa' '--buchi-type=spotba'
LTSmin run took 5477 ms.
FORMULA Parking-PT-864-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-864-LTLFireability-06 finished in 142320 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)))'
Support contains 2 out of 1039 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1039/1039 places, 940/940 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1039 transition count 908
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1007 transition count 908
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1007 transition count 876
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 975 transition count 876
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 974 transition count 875
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 974 transition count 875
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 228 place count 925 transition count 826
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 230 place count 924 transition count 833
Applied a total of 230 rules in 110 ms. Remains 924 /1039 variables (removed 115) and now considering 833/940 (removed 107) transitions.
// Phase 1: matrix 833 rows 924 cols
[2025-06-02 18:44:03] [INFO ] Computed 203 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:44:03] [INFO ] Implicit Places using invariants in 467 ms returned [256, 516, 864]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 468 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 921/1039 places, 833/940 transitions.
Applied a total of 0 rules in 29 ms. Remains 921 /921 variables (removed 0) and now considering 833/833 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 609 ms. Remains : 921/1039 places, 833/940 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-07
Product exploration explored 100000 steps with 396 reset in 725 ms.
Product exploration explored 100000 steps with 396 reset in 834 ms.
Computed a total of 1 stabilizing places and 9 stable transitions
Computed a total of 1 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (158 resets) in 353 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 362425 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 362425 steps, saw 108617 distinct states, run finished after 3009 ms. (steps per millisecond=120 ) properties seen :0
// Phase 1: matrix 833 rows 921 cols
[2025-06-02 18:44:08] [INFO ] Computed 200 invariants in 7 ms
[2025-06-02 18:44:08] [INFO ] State equation strengthened by 344 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 851/921 variables, 198/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/921 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 833/1754 variables, 921/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1754 variables, 344/1465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1754 variables, 0/1465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1754 variables, 0/1465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1754/1754 variables, and 1465 constraints, problems are : Problem set: 0 solved, 1 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 921/921 constraints, ReadFeed: 344/344 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) 68/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 851/921 variables, 198/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/921 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 833/1754 variables, 921/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1754 variables, 344/1465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1754 variables, 1/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1754 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1754 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1754/1754 variables, and 1466 constraints, problems are : Problem set: 0 solved, 1 unsolved in 908 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 921/921 constraints, ReadFeed: 344/344 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1375ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 198 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Support contains 2 out of 921 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 921/921 places, 833/833 transitions.
Applied a total of 0 rules in 35 ms. Remains 921 /921 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2025-06-02 18:44:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:44:10] [INFO ] Implicit Places using invariants in 404 ms returned []
[2025-06-02 18:44:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:44:10] [INFO ] State equation strengthened by 344 read => feed constraints.
[2025-06-02 18:44:16] [INFO ] Implicit Places using invariants and state equation in 6024 ms returned []
Implicit Place search using SMT with State Equation took 6429 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:44:16] [INFO ] Redundant transitions in 12 ms returned []
Running 824 sub problems to find dead transitions.
[2025-06-02 18:44:16] [INFO ] Invariant cache hit.
[2025-06-02 18:44:16] [INFO ] State equation strengthened by 344 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/920 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 824 unsolved
At refinement iteration 1 (OVERLAPS) 1/921 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 824 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 921/1754 variables, and 200 constraints, problems are : Problem set: 0 solved, 824 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/921 constraints, ReadFeed: 0/344 constraints, PredecessorRefiner: 824/824 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 824 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/920 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 824 unsolved
At refinement iteration 1 (OVERLAPS) 1/921 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 824 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 1)
(s5 1)
(s6 0)
(s7 0)
(s8 1)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(s19 1)
(s20 0)
(s21 0)
(s22 1)
(s23 1)
(s24 0)
(s25 0)
(s26 1)
(s27 1)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(s36 1)
(s37 1)
(s38 0)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 1)
(s47 0)
(s48 1)
(s49 0)
(s50 1)
(s51 1)
(s52 0)
(s53 0)
(s54 1)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 1)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 1)
(s81 0)
(s82 1)
(s83 1)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 1)
(s96 0)
(s97 1)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 1)
(s105 0)
(s106 1)
(s107 0)
(s108 1)
(s109 0)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 0)
(s116 1)
(s117 0)
(s118 1)
(s119 0)
(s120 1)
(s121 0)
(s122 1)
(s123 1)
(s124 0)
(s125 0)
(s126 1)
(s127 1)
(s128 0)
(s129 0)
(s130 1)
(s131 1)
(s132 0)
(s133 0)
(s134 1)
(s135 1)
(s136 0)
(s137 0)
(s138 1)
(s139 1)
(s140 0)
(s141 0)
(s142 1)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 1)
(s215 0)
(s216 0)
(s217 1)
(s218 1)
(s219 0)
(s220 0)
(s221 1)
(s222 1)
(s223 0)
(s224 0)
(s225 1)
(s226 1)
(s227 0)
(s228 0)
(s229 1)
(s230 1)
(s231 0)
(s232 0)
(s233 1)
(s234 1)
(s235 0)
(s236 0)
(s237 1)
(s238 1)
(s239 0)
(s240 0)
(s241 1)
(s242 1)
(s243 0)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 1)
(s315 1)
(s316 0)
(s317 0)
(s318 1)
(s319 1)
(s320 0)
(s321 0)
(s322 1)
(s323 1)
(s324 0)
(s325 0)
(s326 1)
(s327 1)
(s328 0)
(s329 0)
(s330 1)
(s331 1)
(s332 0)
(s333 0)
(s334 1)
(s335 1)
(s336 0)
(s337 0)
(s338 1)
(s339 1)
(s340 0)
(s341 0)
(s342 1)
(s343 1)
(s344 0)
(s345 0)
(s346 1)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 1)
(s414 1)
(s415 0)
(s416 1)
(s417 0)
(s418 0)
(s419 1)
(s420 1)
(s421 0)
(s422 0)
(s423 1)
(s424 1)
(s425 0)
(s426 0)
(s427 1)
(s428 1)
(s429 0)
(s430 0)
(s431 1)
(s432 1)
(s433 0)
(s434 0)
(s435 1)
(s436 1)
(s437 0)
(s438 0)
(s439 1)
(s440 1)
(s441 0)
(s442 0)
(s443 1)
(s444 1)
(s445 0)
(s446 0)
(s447 1)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 1)
(s515 0)
(s516 1)
(s517 1)
(s518 0)
(s519 0)
(s520 1)
(s521 1)
(s522 0)
(s523 0)
(s524 1)
(s525 1)
(s526 0)
(s527 0)
(s528 1)
(s529 1)
(s530 0)
(s531 0)
(s532 1)
(s533 1)
(s534 0)
(s535 0)
(s536 1)
(s537 1)
(s538 0)
(s539 0)
(s540 1)
(s541 1)
(s542 0)
(s543 0)
(s544 1)
(s545 1)
(s546 0)
(s547 0)
(s548 1)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 1)
(s616 1)
(s617 0)
(s618 1)
(s619 0)
(s620 0)
(s621 1)
(s622 1)
(s623 0)
(s624 0)
(s625 1)
(s626 1)
(s627 0)
(s628 0)
(s629 1)
(s630 1)
(s631 0)
(s632 0)
(s633 1)
(s634 1)
(s635 0)
(s636 0)
(s637 1)
(s638 1)
(s639 0)
(s640 0)
(s641 1)
(s642 1)
(s643 0)
(s644 0)
(s645 1)
(s646 1)
(s647 0)
(s648 0)
(s649 1)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 1)
(s717 0)
(s718 1)
(s719 1)
(s720 0)
(s721 0)
(s722 1)
(s723 1)
(s724 0)
(s725 0)
(s726 1)
(s727 1)
(s728 0)
(s729 0)
(s730 1)
(s731 1)
(s732 0)
(s733 0)
(s734 1)
(s735 1)
(s736 0)
(s737 0)
(s738 1)
(s739 1)
(s740 0)
(s741 0)
(s742 1)
(s743 1)
(s744 0)
(s745 0)
(s746 1)
(s747 1)
(s748 0)
(s749 0)
(s750 1)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 1)
(s818 1)
(s819 0)
(s820 1)
(s821 0)
(s822 0)
(s823 1)
(s824 1)
(s825 0)
(s826 0)
(s827 1)
(s828 1)
(s829 0)
(s830 0)
(s831 1)
(s832 1)
(s833 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 921/1754 variables, and 200 constraints, problems are : Problem set: 0 solved, 824 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/921 constraints, ReadFeed: 0/344 constraints, PredecessorRefiner: 0/824 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60891ms problems are : Problem set: 0 solved, 824 unsolved
Search for dead transitions found 0 dead transitions in 60893ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67381 ms. Remains : 921/921 places, 833/833 transitions.
Computed a total of 1 stabilizing places and 9 stable transitions
Computed a total of 1 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 40000 steps (155 resets) in 406 ms. (98 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 362191 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 362191 steps, saw 108595 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
[2025-06-02 18:45:20] [INFO ] Invariant cache hit.
[2025-06-02 18:45:20] [INFO ] State equation strengthened by 344 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 851/921 variables, 198/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/921 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 833/1754 variables, 921/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1754 variables, 344/1465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1754 variables, 0/1465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1754 variables, 0/1465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1754/1754 variables, and 1465 constraints, problems are : Problem set: 0 solved, 1 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 921/921 constraints, ReadFeed: 344/344 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) 68/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 851/921 variables, 198/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/921 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 833/1754 variables, 921/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1754 variables, 344/1465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1754 variables, 1/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1754 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1754 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1754/1754 variables, and 1466 constraints, problems are : Problem set: 0 solved, 1 unsolved in 905 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 921/921 constraints, ReadFeed: 344/344 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1426ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 193 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=48 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 396 reset in 780 ms.
Product exploration explored 100000 steps with 393 reset in 930 ms.
Built C files in :
/tmp/ltsmin13826249634751311573
[2025-06-02 18:45:24] [INFO ] Computing symmetric may disable matrix : 833 transitions.
[2025-06-02 18:45:24] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:45:24] [INFO ] Computing symmetric may enable matrix : 833 transitions.
[2025-06-02 18:45:24] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:45:24] [INFO ] Computing Do-Not-Accords matrix : 833 transitions.
[2025-06-02 18:45:24] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:45:24] [INFO ] Built C files in 179ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13826249634751311573
Running compilation step : cd /tmp/ltsmin13826249634751311573;'/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 2339 ms.
Running link step : cd /tmp/ltsmin13826249634751311573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin13826249634751311573;'/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/stateBased11759020319338574698.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 921 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 921/921 places, 833/833 transitions.
Applied a total of 0 rules in 38 ms. Remains 921 /921 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2025-06-02 18:45:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:45:39] [INFO ] Implicit Places using invariants in 443 ms returned []
[2025-06-02 18:45:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:45:40] [INFO ] State equation strengthened by 344 read => feed constraints.
[2025-06-02 18:45:45] [INFO ] Implicit Places using invariants and state equation in 6056 ms returned []
Implicit Place search using SMT with State Equation took 6505 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:45:45] [INFO ] Redundant transitions in 5 ms returned []
Running 824 sub problems to find dead transitions.
[2025-06-02 18:45:45] [INFO ] Invariant cache hit.
[2025-06-02 18:45:45] [INFO ] State equation strengthened by 344 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/920 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 824 unsolved
At refinement iteration 1 (OVERLAPS) 1/921 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 824 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 921/1754 variables, and 200 constraints, problems are : Problem set: 0 solved, 824 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/921 constraints, ReadFeed: 0/344 constraints, PredecessorRefiner: 824/824 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 824 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/920 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 824 unsolved
At refinement iteration 1 (OVERLAPS) 1/921 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 824 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 921/1754 variables, and 200 constraints, problems are : Problem set: 0 solved, 824 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/921 constraints, ReadFeed: 0/344 constraints, PredecessorRefiner: 0/824 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61000ms problems are : Problem set: 0 solved, 824 unsolved
Search for dead transitions found 0 dead transitions in 61002ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67563 ms. Remains : 921/921 places, 833/833 transitions.
Built C files in :
/tmp/ltsmin194075976371745250
[2025-06-02 18:46:46] [INFO ] Computing symmetric may disable matrix : 833 transitions.
[2025-06-02 18:46:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:46:46] [INFO ] Computing symmetric may enable matrix : 833 transitions.
[2025-06-02 18:46:46] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:46:46] [INFO ] Computing Do-Not-Accords matrix : 833 transitions.
[2025-06-02 18:46:46] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:46:46] [INFO ] Built C files in 173ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin194075976371745250
Running compilation step : cd /tmp/ltsmin194075976371745250;'/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 2373 ms.
Running link step : cd /tmp/ltsmin194075976371745250;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin194075976371745250;'/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/stateBased6613440052213638454.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 18:47:01] [INFO ] Flatten gal took : 51 ms
[2025-06-02 18:47:01] [INFO ] Flatten gal took : 51 ms
[2025-06-02 18:47:01] [INFO ] Time to serialize gal into /tmp/LTL4827549088120871481.gal : 6 ms
[2025-06-02 18:47:01] [INFO ] Time to serialize properties into /tmp/LTL4658753854506036284.prop : 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/LTL4827549088120871481.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8952862334247763511.hoa' '-atoms' '/tmp/LTL4658753854506036284.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...317
Loading property file /tmp/LTL4658753854506036284.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8952862334247763511.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
[2025-06-02 18:47:17] [INFO ] Flatten gal took : 54 ms
[2025-06-02 18:47:17] [INFO ] Flatten gal took : 52 ms
[2025-06-02 18:47:17] [INFO ] Time to serialize gal into /tmp/LTL6328385483977017535.gal : 6 ms
[2025-06-02 18:47:17] [INFO ] Time to serialize properties into /tmp/LTL3801310426743370836.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/LTL6328385483977017535.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3801310426743370836.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 : !((F(G("((p272==0)||(p328==0))"))))
Formula 0 simplified : GF!"((p272==0)||(p328==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
[2025-06-02 18:47:32] [INFO ] Flatten gal took : 48 ms
[2025-06-02 18:47:32] [INFO ] Applying decomposition
[2025-06-02 18:47:32] [INFO ] Flatten gal took : 45 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/graph17328166606965148972.txt' '-o' '/tmp/graph17328166606965148972.bin' '-w' '/tmp/graph17328166606965148972.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17328166606965148972.bin' '-l' '-1' '-v' '-w' '/tmp/graph17328166606965148972.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:47:32] [INFO ] Decomposing Gal with order
[2025-06-02 18:47:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:47:32] [INFO ] Removed a total of 1839 redundant transitions.
[2025-06-02 18:47:32] [INFO ] Flatten gal took : 63 ms
[2025-06-02 18:47:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 146 labels/synchronizations in 109 ms.
[2025-06-02 18:47:32] [INFO ] Time to serialize gal into /tmp/LTL12641261513738288398.gal : 9 ms
[2025-06-02 18:47:32] [INFO ] Time to serialize properties into /tmp/LTL13137156799404188668.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/LTL12641261513738288398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13137156799404188668.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...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((i2.u107.p272==0)||(i2.u117.p328==0))"))))
Formula 0 simplified : GF!"((i2.u107.p272==0)||(i2.u117.p328==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
Treatment of property Parking-PT-864-LTLFireability-07 finished in 224646 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(X(G((X(X(X(X(F(p1)))))||p0)))))'
Support contains 4 out of 1039 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1039/1039 places, 940/940 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1038 transition count 939
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1038 transition count 939
Applied a total of 2 rules in 46 ms. Remains 1038 /1039 variables (removed 1) and now considering 939/940 (removed 1) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2025-06-02 18:47:47] [INFO ] Computed 203 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:47:48] [INFO ] Implicit Places using invariants in 493 ms returned [274, 572]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 495 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1039 places, 939/940 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1035 transition count 938
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1035 transition count 938
Applied a total of 2 rules in 41 ms. Remains 1035 /1036 variables (removed 1) and now considering 938/939 (removed 1) transitions.
// Phase 1: matrix 938 rows 1035 cols
[2025-06-02 18:47:48] [INFO ] Computed 201 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:47:48] [INFO ] Implicit Places using invariants in 480 ms returned []
[2025-06-02 18:47:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:47:49] [INFO ] State equation strengthened by 248 read => feed constraints.
[2025-06-02 18:47:55] [INFO ] Implicit Places using invariants and state equation in 6895 ms returned []
Implicit Place search using SMT with State Equation took 7379 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1035/1039 places, 938/940 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7962 ms. Remains : 1035/1039 places, 938/940 transitions.
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Parking-PT-864-LTLFireability-08
Stuttering criterion allowed to conclude after 282 steps with 0 reset in 2 ms.
FORMULA Parking-PT-864-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-08 finished in 8233 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)||((G(p0)||(p0&&F(p1)))&&F((G(!p2)&&X(X(F(p3)))))))))'
Support contains 5 out of 1039 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1039/1039 places, 940/940 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1038 transition count 939
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1038 transition count 939
Applied a total of 2 rules in 46 ms. Remains 1038 /1039 variables (removed 1) and now considering 939/940 (removed 1) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2025-06-02 18:47:56] [INFO ] Computed 203 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:47:56] [INFO ] Implicit Places using invariants in 482 ms returned [274, 572, 967]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 483 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1039 places, 939/940 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 56 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2025-06-02 18:47:56] [INFO ] Computed 200 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:47:57] [INFO ] Implicit Places using invariants in 472 ms returned []
[2025-06-02 18:47:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:47:57] [INFO ] State equation strengthened by 248 read => feed constraints.
[2025-06-02 18:48:02] [INFO ] Implicit Places using invariants and state equation in 5888 ms returned []
Implicit Place search using SMT with State Equation took 6362 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1039 places, 937/940 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6947 ms. Remains : 1033/1039 places, 937/940 transitions.
Stuttering acceptance computed with spot in 419 ms :[(NOT p0), (AND (NOT p0) p2), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : Parking-PT-864-LTLFireability-09
Product exploration explored 100000 steps with 771 reset in 830 ms.
Product exploration explored 100000 steps with 724 reset in 963 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 (NOT p2) p1 p3), (X (AND (NOT p2) p0)), (X (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND (NOT p2) p0))), (X (X (NOT p2))), (X (X p3)), (X (X p0)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 21 factoid took 299 ms. Reduced automaton from 11 states, 36 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (153 resets) in 563 ms. (70 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
[2025-06-02 18:48:06] [INFO ] Invariant cache hit.
[2025-06-02 18:48:06] [INFO ] State equation strengthened by 248 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 159/163 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 870/1033 variables, 197/200 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 0/200 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 937/1970 variables, 1033/1233 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1970 variables, 248/1481 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1970/1970 variables, and 1481 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1180 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 159/163 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 870/1033 variables, 197/200 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:07] [INFO ] Deduced a trap composed of 67 places in 56 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 1/201 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1033 variables, 0/201 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 937/1970 variables, 1033/1234 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 248/1482 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1970 variables, 3/1485 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1970 variables, 0/1485 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1970 variables, 0/1485 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1970/1970 variables, and 1485 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1526 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2732ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 1378 ms.
Support contains 4 out of 1033 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1033 transition count 906
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1002 transition count 906
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 62 place count 1002 transition count 875
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 124 place count 971 transition count 875
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 218 place count 924 transition count 828
Free-agglomeration rule applied 263 times.
Iterating global reduction 2 with 263 rules applied. Total rules applied 481 place count 924 transition count 565
Reduce places removed 263 places and 0 transitions.
Graph (complete) has 1325 edges and 661 vertex of which 266 are kept as prefixes of interest. Removing 395 places using SCC suffix rule.0 ms
Discarding 395 places :
Also discarding 320 output transitions
Drop transitions (Output transitions of discarded places.) removed 320 transitions
Iterating post reduction 2 with 264 rules applied. Total rules applied 745 place count 266 transition count 245
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 775 place count 266 transition count 215
Applied a total of 775 rules in 83 ms. Remains 266 /1033 variables (removed 767) and now considering 215/937 (removed 722) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 266/1033 places, 215/937 transitions.
RANDOM walk for 32008 steps (6 resets) in 103 ms. (307 steps per ms) remains 0/3 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1 p3), (X (AND (NOT p2) p0)), (X (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND (NOT p2) p0))), (X (X (NOT p2))), (X (X p3)), (X (X p0)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p0 (NOT p2)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) p3))), (F p2), (F (NOT (OR p0 p3))), (F (NOT p3)), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT p0))]
Knowledge based reduction with 22 factoid took 523 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 1033 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 23 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2025-06-02 18:48:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:48:11] [INFO ] Implicit Places using invariants in 484 ms returned []
[2025-06-02 18:48:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:48:12] [INFO ] State equation strengthened by 248 read => feed constraints.
[2025-06-02 18:48:17] [INFO ] Implicit Places using invariants and state equation in 5896 ms returned []
Implicit Place search using SMT with State Equation took 6382 ms to find 0 implicit places.
Running 936 sub problems to find dead transitions.
[2025-06-02 18:48:17] [INFO ] Invariant cache hit.
[2025-06-02 18:48:17] [INFO ] State equation strengthened by 248 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1032 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 936 unsolved
SMT process timed out in 30232ms, After SMT, problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 30236ms
Finished structural reductions in LTL mode , in 1 iterations and 36646 ms. Remains : 1033/1033 places, 937/937 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 (NOT p2) p3), (X (NOT p2)), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 120 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (154 resets) in 535 ms. (74 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
[2025-06-02 18:48:48] [INFO ] Invariant cache hit.
[2025-06-02 18:48:48] [INFO ] State equation strengthened by 248 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 159/163 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 870/1033 variables, 197/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 937/1970 variables, 1033/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1970 variables, 248/1481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1970/1970 variables, and 1481 constraints, problems are : Problem set: 0 solved, 2 unsolved in 961 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 159/163 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 870/1033 variables, 197/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:49] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:49] [INFO ] Deduced a trap composed of 67 places in 45 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1033 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 937/1970 variables, 1033/1235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 248/1483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1970 variables, 2/1485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1970 variables, 0/1485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1970 variables, 0/1485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1970/1970 variables, and 1485 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1301 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2273ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 751 ms.
Support contains 2 out of 1033 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1033 transition count 905
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1001 transition count 905
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1001 transition count 873
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 969 transition count 873
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 224 place count 921 transition count 825
Free-agglomeration rule applied 263 times.
Iterating global reduction 2 with 263 rules applied. Total rules applied 487 place count 921 transition count 562
Reduce places removed 263 places and 0 transitions.
Graph (complete) has 1323 edges and 658 vertex of which 178 are kept as prefixes of interest. Removing 480 places using SCC suffix rule.0 ms
Discarding 480 places :
Also discarding 396 output transitions
Drop transitions (Output transitions of discarded places.) removed 396 transitions
Iterating post reduction 2 with 264 rules applied. Total rules applied 751 place count 178 transition count 166
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 775 place count 178 transition count 142
Applied a total of 775 rules in 83 ms. Remains 178 /1033 variables (removed 855) and now considering 142/937 (removed 795) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 178/1033 places, 142/937 transitions.
RANDOM walk for 725 steps (0 resets) in 6 ms. (103 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p2) p3), (X (NOT p2)), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p3))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F p2), (F (NOT (OR p0 p3))), (F (NOT p3))]
Knowledge based reduction with 7 factoid took 224 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 386 reset in 777 ms.
Product exploration explored 100000 steps with 387 reset in 867 ms.
Applying partial POR strategy [false, false, false, false, true]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 1033 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1033 transition count 937
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 31 Pre rules applied. Total rules applied 31 place count 1033 transition count 937
Deduced a syphon composed of 62 places in 1 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 62 place count 1033 transition count 937
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 93 place count 1002 transition count 906
Deduced a syphon composed of 31 places in 1 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 124 place count 1002 transition count 906
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 171 place count 1002 transition count 937
Deduced a syphon composed of 78 places in 0 ms
Applied a total of 171 rules in 90 ms. Remains 1002 /1033 variables (removed 31) and now considering 937/937 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:48:54] [INFO ] Redundant transitions in 6 ms returned []
Running 936 sub problems to find dead transitions.
// Phase 1: matrix 937 rows 1002 cols
[2025-06-02 18:48:54] [INFO ] Computed 200 invariants in 2 ms
[2025-06-02 18:48:54] [INFO ] State equation strengthened by 374 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 936 unsolved
SMT process timed out in 30198ms, After SMT, problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 30201ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1002/1033 places, 937/937 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30313 ms. Remains : 1002/1033 places, 937/937 transitions.
Built C files in :
/tmp/ltsmin6518249541263644237
[2025-06-02 18:49:24] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6518249541263644237
Running compilation step : cd /tmp/ltsmin6518249541263644237;'/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 1553 ms.
Running link step : cd /tmp/ltsmin6518249541263644237;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6518249541263644237;'/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/stateBased18364786744203304495.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1033 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 27 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2025-06-02 18:49:39] [INFO ] Computed 200 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:49:40] [INFO ] Implicit Places using invariants in 468 ms returned []
[2025-06-02 18:49:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:49:40] [INFO ] State equation strengthened by 248 read => feed constraints.
[2025-06-02 18:49:45] [INFO ] Implicit Places using invariants and state equation in 5760 ms returned []
Implicit Place search using SMT with State Equation took 6230 ms to find 0 implicit places.
Running 936 sub problems to find dead transitions.
[2025-06-02 18:49:45] [INFO ] Invariant cache hit.
[2025-06-02 18:49:45] [INFO ] State equation strengthened by 248 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1032 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 936 unsolved
SMT process timed out in 30174ms, After SMT, problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 30176ms
Finished structural reductions in LTL mode , in 1 iterations and 36437 ms. Remains : 1033/1033 places, 937/937 transitions.
Built C files in :
/tmp/ltsmin9044827119382384687
[2025-06-02 18:50:16] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9044827119382384687
Running compilation step : cd /tmp/ltsmin9044827119382384687;'/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 1576 ms.
Running link step : cd /tmp/ltsmin9044827119382384687;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9044827119382384687;'/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/stateBased17324353870863032560.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 18:50:31] [INFO ] Flatten gal took : 22 ms
[2025-06-02 18:50:31] [INFO ] Flatten gal took : 22 ms
[2025-06-02 18:50:31] [INFO ] Time to serialize gal into /tmp/LTL10858858052784489983.gal : 4 ms
[2025-06-02 18:50:31] [INFO ] Time to serialize properties into /tmp/LTL15861645967159247219.prop : 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/LTL10858858052784489983.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9248717335016809372.hoa' '-atoms' '/tmp/LTL15861645967159247219.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...319
Loading property file /tmp/LTL15861645967159247219.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9248717335016809372.hoa
Detected timeout of ITS tools.
[2025-06-02 18:50:46] [INFO ] Flatten gal took : 21 ms
[2025-06-02 18:50:46] [INFO ] Flatten gal took : 22 ms
[2025-06-02 18:50:46] [INFO ] Time to serialize gal into /tmp/LTL11354087631547575023.gal : 5 ms
[2025-06-02 18:50:46] [INFO ] Time to serialize properties into /tmp/LTL13035118824423496672.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/LTL11354087631547575023.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13035118824423496672.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...277
Read 1 LTL properties
Checking formula 0 : !((F((G("(p290!=1)"))||((F((G("((p16!=1)||(p344!=1))"))&&(X(X(F("(p606!=1)"))))))&&((G("(p290!=1)"))||(("(p290!=1)")&&(F("(p530!=1)"))...161
Formula 0 simplified : G(F!"(p290!=1)" & (G(F!"((p16!=1)||(p344!=1))" | XXG!"(p606!=1)") | (F!"(p290!=1)" & (!"(p290!=1)" | G!"(p530!=1)"))))
Detected timeout of ITS tools.
[2025-06-02 18:51:01] [INFO ] Flatten gal took : 20 ms
[2025-06-02 18:51:01] [INFO ] Applying decomposition
[2025-06-02 18:51:01] [INFO ] Flatten gal took : 20 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/graph10353388149680155073.txt' '-o' '/tmp/graph10353388149680155073.bin' '-w' '/tmp/graph10353388149680155073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10353388149680155073.bin' '-l' '-1' '-v' '-w' '/tmp/graph10353388149680155073.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:51:01] [INFO ] Decomposing Gal with order
[2025-06-02 18:51:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:51:01] [INFO ] Removed a total of 119 redundant transitions.
[2025-06-02 18:51:01] [INFO ] Flatten gal took : 39 ms
[2025-06-02 18:51:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-06-02 18:51:01] [INFO ] Time to serialize gal into /tmp/LTL15258516606866531606.gal : 10 ms
[2025-06-02 18:51:01] [INFO ] Time to serialize properties into /tmp/LTL5560828935691277200.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/LTL15258516606866531606.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5560828935691277200.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 : !((F((G("(i4.u112.p290!=1)"))||((F((G("((i2.u7.p16!=1)||(i3.i2.i1.u119.p344!=1))"))&&(X(X(F("(i6.u197.p606!=1)"))))))&&((G("(i4.u112.p...221
Formula 0 simplified : G(F!"(i4.u112.p290!=1)" & (G(F!"((i2.u7.p16!=1)||(i3.i2.i1.u119.p344!=1))" | XXG!"(i6.u197.p606!=1)") | (F!"(i4.u112.p290!=1)" & (!"...201
Detected timeout of ITS tools.
Treatment of property Parking-PT-864-LTLFireability-09 finished in 200731 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&&G((F(p0)&&X(p1))))))'
Support contains 3 out of 1039 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1039/1039 places, 940/940 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1039 transition count 908
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1007 transition count 908
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1007 transition count 876
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 975 transition count 876
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 974 transition count 875
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 974 transition count 875
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 226 place count 926 transition count 827
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 228 place count 925 transition count 834
Applied a total of 228 rules in 108 ms. Remains 925 /1039 variables (removed 114) and now considering 834/940 (removed 106) transitions.
// Phase 1: matrix 834 rows 925 cols
[2025-06-02 18:51:16] [INFO ] Computed 203 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:51:17] [INFO ] Implicit Places using invariants in 413 ms returned [256, 517, 865]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 415 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 922/1039 places, 834/940 transitions.
Applied a total of 0 rules in 29 ms. Remains 922 /922 variables (removed 0) and now considering 834/834 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 552 ms. Remains : 922/1039 places, 834/940 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-10
Stuttering criterion allowed to conclude after 9457 steps with 85 reset in 96 ms.
FORMULA Parking-PT-864-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-10 finished in 792 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)))'
Support contains 1 out of 1039 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1039/1039 places, 940/940 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1039 transition count 908
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1007 transition count 908
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1007 transition count 876
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 975 transition count 876
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 974 transition count 875
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 974 transition count 875
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 228 place count 925 transition count 826
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 230 place count 924 transition count 833
Applied a total of 230 rules in 112 ms. Remains 924 /1039 variables (removed 115) and now considering 833/940 (removed 107) transitions.
// Phase 1: matrix 833 rows 924 cols
[2025-06-02 18:51:17] [INFO ] Computed 203 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:51:18] [INFO ] Implicit Places using invariants in 429 ms returned [256, 516, 864]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 430 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 921/1039 places, 833/940 transitions.
Applied a total of 0 rules in 29 ms. Remains 921 /921 variables (removed 0) and now considering 833/833 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 572 ms. Remains : 921/1039 places, 833/940 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-11
Stuttering criterion allowed to conclude after 447 steps with 1 reset in 3 ms.
FORMULA Parking-PT-864-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-11 finished in 661 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(!p0) U p1))'
Support contains 4 out of 1039 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1039/1039 places, 940/940 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1039 transition count 908
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1007 transition count 908
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1007 transition count 876
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 975 transition count 876
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 974 transition count 875
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 974 transition count 875
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 228 place count 925 transition count 826
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 230 place count 924 transition count 833
Applied a total of 230 rules in 98 ms. Remains 924 /1039 variables (removed 115) and now considering 833/940 (removed 107) transitions.
[2025-06-02 18:51:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:51:18] [INFO ] Implicit Places using invariants in 421 ms returned [256, 516, 864]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 422 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 921/1039 places, 833/940 transitions.
Applied a total of 0 rules in 31 ms. Remains 921 /921 variables (removed 0) and now considering 833/833 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 551 ms. Remains : 921/1039 places, 833/940 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), true, p0]
Running random walk in product with property : Parking-PT-864-LTLFireability-12
Product exploration explored 100000 steps with 395 reset in 772 ms.
Entered a terminal (fully accepting) state of product in 82381 steps with 324 reset in 685 ms.
FORMULA Parking-PT-864-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-12 finished in 2104 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' '!(((!p0&&X(p1)) U G(p2)))'
Support contains 4 out of 1039 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1039/1039 places, 940/940 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1038 transition count 939
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1038 transition count 939
Applied a total of 2 rules in 51 ms. Remains 1038 /1039 variables (removed 1) and now considering 939/940 (removed 1) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2025-06-02 18:51:20] [INFO ] Computed 203 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:51:20] [INFO ] Implicit Places using invariants in 491 ms returned [572, 967]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 493 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1039 places, 939/940 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1035 transition count 938
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1035 transition count 938
Applied a total of 2 rules in 40 ms. Remains 1035 /1036 variables (removed 1) and now considering 938/939 (removed 1) transitions.
// Phase 1: matrix 938 rows 1035 cols
[2025-06-02 18:51:20] [INFO ] Computed 201 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:51:21] [INFO ] Implicit Places using invariants in 485 ms returned []
[2025-06-02 18:51:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:51:21] [INFO ] State equation strengthened by 248 read => feed constraints.
[2025-06-02 18:51:29] [INFO ] Implicit Places using invariants and state equation in 7773 ms returned []
Implicit Place search using SMT with State Equation took 8264 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1035/1039 places, 938/940 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8848 ms. Remains : 1035/1039 places, 938/940 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Parking-PT-864-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-13 finished in 9046 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((X(p0)&&G((p1&&X((p1 U (X(p2)||G(p1))))))))))'
Support contains 3 out of 1039 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1039/1039 places, 940/940 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1038 transition count 939
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1038 transition count 939
Applied a total of 2 rules in 47 ms. Remains 1038 /1039 variables (removed 1) and now considering 939/940 (removed 1) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2025-06-02 18:51:29] [INFO ] Computed 203 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:51:29] [INFO ] Implicit Places using invariants in 477 ms returned [274, 572, 967]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 478 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1039 places, 939/940 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 46 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2025-06-02 18:51:29] [INFO ] Computed 200 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:51:30] [INFO ] Implicit Places using invariants in 472 ms returned []
[2025-06-02 18:51:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:51:30] [INFO ] State equation strengthened by 248 read => feed constraints.
[2025-06-02 18:51:36] [INFO ] Implicit Places using invariants and state equation in 5873 ms returned []
Implicit Place search using SMT with State Equation took 6348 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1039 places, 937/940 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6924 ms. Remains : 1033/1039 places, 937/940 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Parking-PT-864-LTLFireability-14
Product exploration explored 100000 steps with 1338 reset in 1011 ms.
Product exploration explored 100000 steps with 1322 reset in 1125 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 p1 p0 p2), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 84 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (154 resets) in 463 ms. (86 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 3/3 properties
[2025-06-02 18:51:39] [INFO ] Invariant cache hit.
[2025-06-02 18:51:39] [INFO ] State equation strengthened by 248 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 160/163 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 870/1033 variables, 197/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 937/1970 variables, 1033/1233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1970 variables, 248/1481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1970/1970 variables, and 1481 constraints, problems are : Problem set: 0 solved, 3 unsolved in 639 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 160/163 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 870/1033 variables, 197/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:51:40] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1033 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 937/1970 variables, 1033/1234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 248/1482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1970 variables, 3/1485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1970 variables, 0/1485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1970 variables, 0/1485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1970/1970 variables, and 1485 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1413 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2066ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 204 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=29 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 7 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT p0)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 p0))), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 323 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 1033 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 19 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2025-06-02 18:51:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:51:42] [INFO ] Implicit Places using invariants in 475 ms returned []
[2025-06-02 18:51:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:51:43] [INFO ] State equation strengthened by 248 read => feed constraints.
[2025-06-02 18:51:48] [INFO ] Implicit Places using invariants and state equation in 5927 ms returned []
Implicit Place search using SMT with State Equation took 6404 ms to find 0 implicit places.
Running 936 sub problems to find dead transitions.
[2025-06-02 18:51:48] [INFO ] Invariant cache hit.
[2025-06-02 18:51:48] [INFO ] State equation strengthened by 248 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1032 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 936 unsolved
SMT process timed out in 30172ms, After SMT, problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 30174ms
Finished structural reductions in LTL mode , in 1 iterations and 36602 ms. Remains : 1033/1033 places, 937/937 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 p1 p0 p2), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 109 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (152 resets) in 514 ms. (77 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
[2025-06-02 18:52:19] [INFO ] Invariant cache hit.
[2025-06-02 18:52:19] [INFO ] State equation strengthened by 248 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 160/163 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 870/1033 variables, 197/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 937/1970 variables, 1033/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1970 variables, 248/1481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1970/1970 variables, and 1481 constraints, problems are : Problem set: 0 solved, 2 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 160/163 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 870/1033 variables, 197/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:20] [INFO ] Deduced a trap composed of 67 places in 50 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1033 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 937/1970 variables, 1033/1234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 248/1482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1970 variables, 2/1484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1970 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1970 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1970/1970 variables, and 1484 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1230 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1799ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 198 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=22 )
Parikh walk visited 2 properties in 9 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT p0)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 p0))), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 283 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1305 reset in 993 ms.
Product exploration explored 100000 steps with 1325 reset in 1113 ms.
Built C files in :
/tmp/ltsmin11674756001340975203
[2025-06-02 18:52:24] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11674756001340975203
Running compilation step : cd /tmp/ltsmin11674756001340975203;'/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 1537 ms.
Running link step : cd /tmp/ltsmin11674756001340975203;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11674756001340975203;'/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/stateBased5170606263467599947.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1033 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 28 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2025-06-02 18:52:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:52:40] [INFO ] Implicit Places using invariants in 521 ms returned []
[2025-06-02 18:52:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:52:40] [INFO ] State equation strengthened by 248 read => feed constraints.
[2025-06-02 18:52:45] [INFO ] Implicit Places using invariants and state equation in 5797 ms returned []
Implicit Place search using SMT with State Equation took 6320 ms to find 0 implicit places.
Running 936 sub problems to find dead transitions.
[2025-06-02 18:52:45] [INFO ] Invariant cache hit.
[2025-06-02 18:52:45] [INFO ] State equation strengthened by 248 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)timeout
(s413 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1032 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 936 unsolved
SMT process timed out in 30193ms, After SMT, problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 30197ms
Finished structural reductions in LTL mode , in 1 iterations and 36549 ms. Remains : 1033/1033 places, 937/937 transitions.
Built C files in :
/tmp/ltsmin5112296286086660083
[2025-06-02 18:53:16] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5112296286086660083
Running compilation step : cd /tmp/ltsmin5112296286086660083;'/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 1612 ms.
Running link step : cd /tmp/ltsmin5112296286086660083;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5112296286086660083;'/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/stateBased13413370223232128621.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 18:53:31] [INFO ] Flatten gal took : 21 ms
[2025-06-02 18:53:31] [INFO ] Flatten gal took : 21 ms
[2025-06-02 18:53:31] [INFO ] Time to serialize gal into /tmp/LTL4965364498290826087.gal : 3 ms
[2025-06-02 18:53:31] [INFO ] Time to serialize properties into /tmp/LTL14264623514603639669.prop : 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/LTL4965364498290826087.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12319098492751649028.hoa' '-atoms' '/tmp/LTL14264623514603639669.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...319
Loading property file /tmp/LTL14264623514603639669.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12319098492751649028.hoa
Detected timeout of ITS tools.
[2025-06-02 18:53:46] [INFO ] Flatten gal took : 20 ms
[2025-06-02 18:53:46] [INFO ] Flatten gal took : 20 ms
[2025-06-02 18:53:46] [INFO ] Time to serialize gal into /tmp/LTL12335218399694411402.gal : 3 ms
[2025-06-02 18:53:46] [INFO ] Time to serialize properties into /tmp/LTL17789187111697908170.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/LTL12335218399694411402.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17789187111697908170.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...277
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(p416==0)"))&&(G(("(p1009!=1)")&&(X(("(p1009!=1)")U((X("(p270!=1)"))||(G("(p1009!=1)")))))))))))
Formula 0 simplified : XG(X!"(p416==0)" | F(!"(p1009!=1)" | X(!"(p1009!=1)" M X!"(p270!=1)")))
Detected timeout of ITS tools.
[2025-06-02 18:54:01] [INFO ] Flatten gal took : 21 ms
[2025-06-02 18:54:01] [INFO ] Applying decomposition
[2025-06-02 18:54:01] [INFO ] Flatten gal took : 20 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/graph16551305708179048093.txt' '-o' '/tmp/graph16551305708179048093.bin' '-w' '/tmp/graph16551305708179048093.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16551305708179048093.bin' '-l' '-1' '-v' '-w' '/tmp/graph16551305708179048093.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:54:01] [INFO ] Decomposing Gal with order
[2025-06-02 18:54:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:54:01] [INFO ] Removed a total of 114 redundant transitions.
[2025-06-02 18:54:01] [INFO ] Flatten gal took : 34 ms
[2025-06-02 18:54:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-02 18:54:01] [INFO ] Time to serialize gal into /tmp/LTL14661228764859863683.gal : 9 ms
[2025-06-02 18:54:01] [INFO ] Time to serialize properties into /tmp/LTL18279006825546144187.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/LTL14661228764859863683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18279006825546144187.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...256
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(i6.u150.p416==0)"))&&(G(("(i12.u314.p1009!=1)")&&(X(("(i12.u314.p1009!=1)")U((X("(i5.u105.p270!=1)"))||(G("(i12.u314.p1009...171
Formula 0 simplified : XG(X!"(i6.u150.p416==0)" | F(!"(i12.u314.p1009!=1)" | X(!"(i12.u314.p1009!=1)" M X!"(i5.u105.p270!=1)")))
Reverse transition relation is NOT exact ! Due to transitions i3.u93.t240, i5.u133.t206, i6.u173.t172, i7.u212.t138, i8.u251.t104, i10.u290.t70, i12.u328.t...277
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
Treatment of property Parking-PT-864-LTLFireability-14 finished in 167503 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(X(G((p0&&X(p1))))))'
Support contains 4 out of 1039 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1039/1039 places, 940/940 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1038 transition count 939
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1038 transition count 939
Applied a total of 2 rules in 48 ms. Remains 1038 /1039 variables (removed 1) and now considering 939/940 (removed 1) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2025-06-02 18:54:16] [INFO ] Computed 203 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:54:17] [INFO ] Implicit Places using invariants in 483 ms returned [274, 572, 967]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 485 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1039 places, 939/940 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 41 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2025-06-02 18:54:17] [INFO ] Computed 200 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:54:17] [INFO ] Implicit Places using invariants in 467 ms returned []
[2025-06-02 18:54:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:54:18] [INFO ] State equation strengthened by 248 read => feed constraints.
[2025-06-02 18:54:23] [INFO ] Implicit Places using invariants and state equation in 5932 ms returned []
Implicit Place search using SMT with State Equation took 6401 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1039 places, 937/940 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6975 ms. Remains : 1033/1039 places, 937/940 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-864-LTLFireability-15
Entered a terminal (fully accepting) state of product in 208 steps with 0 reset in 4 ms.
FORMULA Parking-PT-864-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-15 finished in 7184 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(X(F((p0&&F((p1||G(p2))))))))'
Found a Shortening insensitive property : Parking-PT-864-LTLFireability-03
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 1039 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1039/1039 places, 940/940 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1039 transition count 908
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1007 transition count 908
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1007 transition count 876
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 975 transition count 876
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 974 transition count 875
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 974 transition count 875
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 228 place count 925 transition count 826
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 230 place count 924 transition count 833
Applied a total of 230 rules in 96 ms. Remains 924 /1039 variables (removed 115) and now considering 833/940 (removed 107) transitions.
// Phase 1: matrix 833 rows 924 cols
[2025-06-02 18:54:24] [INFO ] Computed 203 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:54:24] [INFO ] Implicit Places using invariants in 440 ms returned [256, 516, 864]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 442 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 921/1039 places, 833/940 transitions.
Applied a total of 0 rules in 21 ms. Remains 921 /921 variables (removed 0) and now considering 833/833 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 560 ms. Remains : 921/1039 places, 833/940 transitions.
Running random walk in product with property : Parking-PT-864-LTLFireability-03
Product exploration explored 100000 steps with 415 reset in 796 ms.
Product exploration explored 100000 steps with 411 reset in 874 ms.
Computed a total of 1 stabilizing places and 9 stable transitions
Computed a total of 1 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (155 resets) in 367 ms. (108 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
// Phase 1: matrix 833 rows 921 cols
[2025-06-02 18:54:26] [INFO ] Computed 200 invariants in 2 ms
[2025-06-02 18:54:26] [INFO ] State equation strengthened by 344 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 135/139 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 782/921 variables, 196/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/921 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 833/1754 variables, 921/1121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1754 variables, 344/1465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1754 variables, 0/1465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1754 variables, 0/1465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1754/1754 variables, and 1465 constraints, problems are : Problem set: 0 solved, 2 unsolved in 679 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 921/921 constraints, ReadFeed: 344/344 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 135/139 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 782/921 variables, 196/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/921 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 833/1754 variables, 921/1121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1754 variables, 344/1465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1754 variables, 2/1467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1754 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1754 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1754/1754 variables, and 1467 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1034 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 921/921 constraints, ReadFeed: 344/344 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1730ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 794 ms.
Support contains 4 out of 921 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 921/921 places, 833/833 transitions.
Free-agglomeration rule applied 253 times.
Iterating global reduction 0 with 253 rules applied. Total rules applied 253 place count 921 transition count 580
Reduce places removed 253 places and 0 transitions.
Graph (complete) has 1343 edges and 668 vertex of which 179 are kept as prefixes of interest. Removing 489 places using SCC suffix rule.1 ms
Discarding 489 places :
Also discarding 405 output transitions
Drop transitions (Output transitions of discarded places.) removed 405 transitions
Iterating post reduction 0 with 254 rules applied. Total rules applied 507 place count 179 transition count 175
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 539 place count 179 transition count 143
Applied a total of 539 rules in 41 ms. Remains 179 /921 variables (removed 742) and now considering 143/833 (removed 690) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 179/921 places, 143/833 transitions.
RANDOM walk for 40000 steps (321 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
BEST_FIRST walk for 1197 steps (0 resets) in 7 ms. (149 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 4 factoid took 187 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 921 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 921/921 places, 833/833 transitions.
Applied a total of 0 rules in 20 ms. Remains 921 /921 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2025-06-02 18:54:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:54:30] [INFO ] Implicit Places using invariants in 405 ms returned []
[2025-06-02 18:54:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:54:30] [INFO ] State equation strengthened by 344 read => feed constraints.
[2025-06-02 18:54:36] [INFO ] Implicit Places using invariants and state equation in 5863 ms returned []
Implicit Place search using SMT with State Equation took 6270 ms to find 0 implicit places.
Running 824 sub problems to find dead transitions.
[2025-06-02 18:54:36] [INFO ] Invariant cache hit.
[2025-06-02 18:54:36] [INFO ] State equation strengthened by 344 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/920 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 824 unsolved
At refinement iteration 1 (OVERLAPS) 1/921 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 824 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 921/1754 variables, and 200 constraints, problems are : Problem set: 0 solved, 824 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/921 constraints, ReadFeed: 0/344 constraints, PredecessorRefiner: 824/824 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 824 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/920 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 824 unsolved
At refinement iteration 1 (OVERLAPS) 1/921 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 824 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 921/1754 variables, and 200 constraints, problems are : Problem set: 0 solved, 824 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/921 constraints, ReadFeed: 0/344 constraints, PredecessorRefiner: 0/824 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60883ms problems are : Problem set: 0 solved, 824 unsolved
Search for dead transitions found 0 dead transitions in 60886ms
Finished structural reductions in LTL mode , in 1 iterations and 67182 ms. Remains : 921/921 places, 833/833 transitions.
Computed a total of 1 stabilizing places and 9 stable transitions
Computed a total of 1 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (157 resets) in 531 ms. (75 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
[2025-06-02 18:55:37] [INFO ] Invariant cache hit.
[2025-06-02 18:55:37] [INFO ] State equation strengthened by 344 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 135/139 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 782/921 variables, 196/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/921 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 833/1754 variables, 921/1121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1754 variables, 344/1465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1754 variables, 0/1465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1754 variables, 0/1465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1754/1754 variables, and 1465 constraints, problems are : Problem set: 0 solved, 2 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 921/921 constraints, ReadFeed: 344/344 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 135/139 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 782/921 variables, 196/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/921 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 833/1754 variables, 921/1121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1754 variables, 344/1465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1754 variables, 2/1467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1754 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1754 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1754/1754 variables, and 1467 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1126 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 921/921 constraints, ReadFeed: 344/344 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1785ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 699 ms.
Support contains 4 out of 921 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 921/921 places, 833/833 transitions.
Free-agglomeration rule applied 253 times.
Iterating global reduction 0 with 253 rules applied. Total rules applied 253 place count 921 transition count 580
Reduce places removed 253 places and 0 transitions.
Graph (complete) has 1343 edges and 668 vertex of which 179 are kept as prefixes of interest. Removing 489 places using SCC suffix rule.1 ms
Discarding 489 places :
Also discarding 405 output transitions
Drop transitions (Output transitions of discarded places.) removed 405 transitions
Iterating post reduction 0 with 254 rules applied. Total rules applied 507 place count 179 transition count 175
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 539 place count 179 transition count 143
Applied a total of 539 rules in 58 ms. Remains 179 /921 variables (removed 742) and now considering 143/833 (removed 690) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 179/921 places, 143/833 transitions.
RANDOM walk for 40000 steps (325 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
BEST_FIRST walk for 1963 steps (0 resets) in 7 ms. (245 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p2)]
False Knowledge obtained : [(F p1), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 408 reset in 831 ms.
Product exploration explored 100000 steps with 415 reset in 932 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 921 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 921/921 places, 833/833 transitions.
Applied a total of 0 rules in 34 ms. Remains 921 /921 variables (removed 0) and now considering 833/833 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:55:42] [INFO ] Redundant transitions in 5 ms returned []
Running 824 sub problems to find dead transitions.
[2025-06-02 18:55:42] [INFO ] Invariant cache hit.
[2025-06-02 18:55:42] [INFO ] State equation strengthened by 344 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/920 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 824 unsolved
At refinement iteration 1 (OVERLAPS) 1/921 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 824 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 921/1754 variables, and 200 constraints, problems are : Problem set: 0 solved, 824 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/921 constraints, ReadFeed: 0/344 constraints, PredecessorRefiner: 824/824 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 824 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/920 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 824 unsolved
At refinement iteration 1 (OVERLAPS) 1/921 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 824 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 921/1754 variables, and 200 constraints, problems are : Problem set: 0 solved, 824 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/921 constraints, ReadFeed: 0/344 constraints, PredecessorRefiner: 0/824 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60966ms problems are : Problem set: 0 solved, 824 unsolved
Search for dead transitions found 0 dead transitions in 60968ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61015 ms. Remains : 921/921 places, 833/833 transitions.
Built C files in :
/tmp/ltsmin15591513315447531201
[2025-06-02 18:56:43] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15591513315447531201
Running compilation step : cd /tmp/ltsmin15591513315447531201;'/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 1485 ms.
Running link step : cd /tmp/ltsmin15591513315447531201;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15591513315447531201;'/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/stateBased13556410293607268194.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 921 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 921/921 places, 833/833 transitions.
Applied a total of 0 rules in 21 ms. Remains 921 /921 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2025-06-02 18:56:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:56:59] [INFO ] Implicit Places using invariants in 389 ms returned []
[2025-06-02 18:56:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:56:59] [INFO ] State equation strengthened by 344 read => feed constraints.
[2025-06-02 18:57:05] [INFO ] Implicit Places using invariants and state equation in 5862 ms returned []
Implicit Place search using SMT with State Equation took 6254 ms to find 0 implicit places.
Running 824 sub problems to find dead transitions.
[2025-06-02 18:57:05] [INFO ] Invariant cache hit.
[2025-06-02 18:57:05] [INFO ] State equation strengthened by 344 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/920 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 824 unsolved
At refinement iteration 1 (OVERLAPS) 1/921 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 824 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 921/1754 variables, and 200 constraints, problems are : Problem set: 0 solved, 824 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/921 constraints, ReadFeed: 0/344 constraints, PredecessorRefiner: 824/824 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 824 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/920 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 824 unsolved
At refinement iteration 1 (OVERLAPS) 1/921 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 824 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 921/1754 variables, and 200 constraints, problems are : Problem set: 0 solved, 824 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/921 constraints, ReadFeed: 0/344 constraints, PredecessorRefiner: 0/824 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60873ms problems are : Problem set: 0 solved, 824 unsolved
Search for dead transitions found 0 dead transitions in 60876ms
Finished structural reductions in LTL mode , in 1 iterations and 67155 ms. Remains : 921/921 places, 833/833 transitions.
Built C files in :
/tmp/ltsmin12755464172436198264
[2025-06-02 18:58:06] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12755464172436198264
Running compilation step : cd /tmp/ltsmin12755464172436198264;'/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 1426 ms.
Running link step : cd /tmp/ltsmin12755464172436198264;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12755464172436198264;'/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/stateBased11856346912938329873.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 18:58:21] [INFO ] Flatten gal took : 42 ms
[2025-06-02 18:58:21] [INFO ] Flatten gal took : 41 ms
[2025-06-02 18:58:21] [INFO ] Time to serialize gal into /tmp/LTL535065386891684218.gal : 5 ms
[2025-06-02 18:58:21] [INFO ] Time to serialize properties into /tmp/LTL527427687212134980.prop : 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/LTL535065386891684218.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7987902935326640780.hoa' '-atoms' '/tmp/LTL527427687212134980.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...315
Loading property file /tmp/LTL527427687212134980.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7987902935326640780.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
[2025-06-02 18:58:36] [INFO ] Flatten gal took : 43 ms
[2025-06-02 18:58:36] [INFO ] Flatten gal took : 42 ms
[2025-06-02 18:58:36] [INFO ] Time to serialize gal into /tmp/LTL6987561272900153613.gal : 4 ms
[2025-06-02 18:58:36] [INFO ] Time to serialize properties into /tmp/LTL18404356493829936239.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/LTL6987561272900153613.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18404356493829936239.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...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((F(("((p271==1)&&(p372==1))")||(G("((p396==0)||(p488==0))"))))&&("((p919==0)||(p955==0))"))))))
Formula 0 simplified : XXG(!"((p919==0)||(p955==0))" | G(!"((p271==1)&&(p372==1))" & F!"((p396==0)||(p488==0))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
[2025-06-02 18:58:51] [INFO ] Flatten gal took : 59 ms
[2025-06-02 18:58:51] [INFO ] Applying decomposition
[2025-06-02 18:58:51] [INFO ] Flatten gal took : 43 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/graph3604040093242016295.txt' '-o' '/tmp/graph3604040093242016295.bin' '-w' '/tmp/graph3604040093242016295.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3604040093242016295.bin' '-l' '-1' '-v' '-w' '/tmp/graph3604040093242016295.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:58:51] [INFO ] Decomposing Gal with order
[2025-06-02 18:58:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:58:51] [INFO ] Removed a total of 1839 redundant transitions.
[2025-06-02 18:58:51] [INFO ] Flatten gal took : 43 ms
[2025-06-02 18:58:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 146 labels/synchronizations in 45 ms.
[2025-06-02 18:58:52] [INFO ] Time to serialize gal into /tmp/LTL14971301658503439814.gal : 8 ms
[2025-06-02 18:58:52] [INFO ] Time to serialize properties into /tmp/LTL13402876705126927279.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/LTL14971301658503439814.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13402876705126927279.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...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F((F(("((i3.u108.p271==1)&&(i3.u132.p372==1))")||(G("((i4.u142.p396==0)||(i4.u163.p488==0))"))))&&("((i12.u289.p919==0)||(i12.u...175
Formula 0 simplified : XXG(!"((i12.u289.p919==0)||(i12.u325.p955==0))" | G(!"((i3.u108.p271==1)&&(i3.u132.p372==1))" & F!"((i4.u142.p396==0)||(i4.u163.p488...163
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
Treatment of property Parking-PT-864-LTLFireability-03 finished in 283074 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)))'
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)||((G(p0)||(p0&&F(p1)))&&F((G(!p2)&&X(X(F(p3)))))))))'
Found a Shortening insensitive property : Parking-PT-864-LTLFireability-09
Stuttering acceptance computed with spot in 513 ms :[(NOT p0), (AND (NOT p0) p2), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
Support contains 5 out of 1039 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1039/1039 places, 940/940 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1039 transition count 909
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1008 transition count 909
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 62 place count 1008 transition count 878
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 124 place count 977 transition count 878
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 976 transition count 877
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 976 transition count 877
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 222 place count 928 transition count 829
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 224 place count 927 transition count 836
Applied a total of 224 rules in 114 ms. Remains 927 /1039 variables (removed 112) and now considering 836/940 (removed 104) transitions.
// Phase 1: matrix 836 rows 927 cols
[2025-06-02 18:59:07] [INFO ] Computed 203 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:59:08] [INFO ] Implicit Places using invariants in 463 ms returned [257, 519, 867]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 464 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 924/1039 places, 836/940 transitions.
Applied a total of 0 rules in 22 ms. Remains 924 /924 variables (removed 0) and now considering 836/836 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 601 ms. Remains : 924/1039 places, 836/940 transitions.
Running random walk in product with property : Parking-PT-864-LTLFireability-09
Product exploration explored 100000 steps with 769 reset in 840 ms.
Product exploration explored 100000 steps with 722 reset in 978 ms.
Computed a total of 1 stabilizing places and 9 stable transitions
Computed a total of 1 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1 p3), (X (AND (NOT p2) p0)), (X (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND (NOT p2) p0))), (X (X (NOT p2))), (X (X p3)), (X (X p0)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 21 factoid took 306 ms. Reduced automaton from 11 states, 36 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (156 resets) in 462 ms. (86 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
// Phase 1: matrix 836 rows 924 cols
[2025-06-02 18:59:11] [INFO ] Computed 200 invariants in 3 ms
[2025-06-02 18:59:11] [INFO ] State equation strengthened by 343 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 136/140 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 784/924 variables, 197/200 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/924 variables, 0/200 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 836/1760 variables, 924/1124 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1760 variables, 343/1467 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1760 variables, 0/1467 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1760 variables, 0/1467 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1760/1760 variables, and 1467 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1207 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 924/924 constraints, ReadFeed: 343/343 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 136/140 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 784/924 variables, 197/200 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/924 variables, 0/200 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 836/1760 variables, 924/1124 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1760 variables, 343/1467 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1760 variables, 3/1470 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1760 variables, 0/1470 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1760 variables, 0/1470 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1760/1760 variables, and 1470 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1408 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 924/924 constraints, ReadFeed: 343/343 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2631ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 928 ms.
Support contains 3 out of 924 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 924/924 places, 836/836 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 924 transition count 835
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 923 transition count 835
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 923 transition count 834
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 4 place count 922 transition count 834
Free-agglomeration rule applied 254 times.
Iterating global reduction 2 with 254 rules applied. Total rules applied 258 place count 922 transition count 580
Reduce places removed 254 places and 0 transitions.
Graph (complete) has 1340 edges and 668 vertex of which 179 are kept as prefixes of interest. Removing 489 places using SCC suffix rule.0 ms
Discarding 489 places :
Also discarding 405 output transitions
Drop transitions (Output transitions of discarded places.) removed 405 transitions
Iterating post reduction 2 with 255 rules applied. Total rules applied 513 place count 179 transition count 175
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 545 place count 179 transition count 143
Applied a total of 545 rules in 48 ms. Remains 179 /924 variables (removed 745) and now considering 143/836 (removed 693) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 179/924 places, 143/836 transitions.
RANDOM walk for 541 steps (0 resets) in 8 ms. (60 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1 p3), (X (AND (NOT p2) p0)), (X (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND (NOT p2) p0))), (X (X (NOT p2))), (X (X p3)), (X (X p0)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p0 (NOT p2)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) p3))), (F p2), (F (NOT (OR p0 p3))), (F (NOT p3)), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT p0))]
Knowledge based reduction with 22 factoid took 609 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 924 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 924/924 places, 836/836 transitions.
Applied a total of 0 rules in 22 ms. Remains 924 /924 variables (removed 0) and now considering 836/836 (removed 0) transitions.
[2025-06-02 18:59:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:59:16] [INFO ] Implicit Places using invariants in 451 ms returned []
[2025-06-02 18:59:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:59:16] [INFO ] State equation strengthened by 343 read => feed constraints.
[2025-06-02 18:59:22] [INFO ] Implicit Places using invariants and state equation in 5804 ms returned []
Implicit Place search using SMT with State Equation took 6257 ms to find 0 implicit places.
Running 827 sub problems to find dead transitions.
[2025-06-02 18:59:22] [INFO ] Invariant cache hit.
[2025-06-02 18:59:22] [INFO ] State equation strengthened by 343 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/923 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 827 unsolved
At refinement iteration 1 (OVERLAPS) 1/924 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 827 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 1.0)
(s421 1.0)
(s422 0.0)
(s423 0.0)
(s424 1.0)
(s425 1.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 1.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 timeout
1.0)
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 924/1760 variables, and 200 constraints, problems are : Problem set: 0 solved, 827 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/924 constraints, ReadFeed: 0/343 constraints, PredecessorRefiner: 827/827 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 827 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/923 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 827 unsolved
At refinement iteration 1 (OVERLAPS) 1/924 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 827 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 924/1760 variables, and 200 constraints, problems are : Problem set: 0 solved, 827 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/924 constraints, ReadFeed: 0/343 constraints, PredecessorRefiner: 0/827 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60895ms problems are : Problem set: 0 solved, 827 unsolved
Search for dead transitions found 0 dead transitions in 60899ms
Finished structural reductions in LTL mode , in 1 iterations and 67183 ms. Remains : 924/924 places, 836/836 transitions.
Computed a total of 1 stabilizing places and 9 stable transitions
Computed a total of 1 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p3), (X (NOT p2)), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 115 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (156 resets) in 392 ms. (101 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
[2025-06-02 19:00:23] [INFO ] Invariant cache hit.
[2025-06-02 19:00:23] [INFO ] State equation strengthened by 343 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 136/140 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 784/924 variables, 197/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/924 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 836/1760 variables, 924/1124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1760 variables, 343/1467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1760 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1760 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1760/1760 variables, and 1467 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1030 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 924/924 constraints, ReadFeed: 343/343 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 136/140 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 784/924 variables, 197/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/924 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 836/1760 variables, 924/1124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1760 variables, 343/1467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1760 variables, 2/1469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1760 variables, 0/1469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1760 variables, 0/1469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1760/1760 variables, and 1469 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1195 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 924/924 constraints, ReadFeed: 343/343 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2232ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 786 ms.
Support contains 2 out of 924 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 924/924 places, 836/836 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 924 transition count 835
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 923 transition count 835
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 923 transition count 834
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 4 place count 922 transition count 834
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 2 with 2 rules applied. Total rules applied 6 place count 921 transition count 833
Free-agglomeration rule applied 254 times.
Iterating global reduction 2 with 254 rules applied. Total rules applied 260 place count 921 transition count 579
Reduce places removed 254 places and 0 transitions.
Graph (complete) has 1340 edges and 667 vertex of which 178 are kept as prefixes of interest. Removing 489 places using SCC suffix rule.1 ms
Discarding 489 places :
Also discarding 405 output transitions
Drop transitions (Output transitions of discarded places.) removed 405 transitions
Iterating post reduction 2 with 255 rules applied. Total rules applied 515 place count 178 transition count 174
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 547 place count 178 transition count 142
Applied a total of 547 rules in 62 ms. Remains 178 /924 variables (removed 746) and now considering 142/836 (removed 694) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 178/924 places, 142/836 transitions.
RANDOM walk for 790 steps (0 resets) in 8 ms. (87 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p2) p3), (X (NOT p2)), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p3))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F p2), (F (NOT (OR p0 p3))), (F (NOT p3))]
Knowledge based reduction with 7 factoid took 327 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 394 reset in 762 ms.
Product exploration explored 100000 steps with 393 reset in 870 ms.
Applying partial POR strategy [false, false, false, false, true]
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 924 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 924/924 places, 836/836 transitions.
Applied a total of 0 rules in 30 ms. Remains 924 /924 variables (removed 0) and now considering 836/836 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:00:29] [INFO ] Redundant transitions in 6 ms returned []
Running 827 sub problems to find dead transitions.
[2025-06-02 19:00:29] [INFO ] Invariant cache hit.
[2025-06-02 19:00:29] [INFO ] State equation strengthened by 343 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/923 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 827 unsolved
At refinement iteration 1 (OVERLAPS) 1/924 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 827 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 924/1760 variables, and 200 constraints, problems are : Problem set: 0 solved, 827 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/924 constraints, ReadFeed: 0/343 constraints, PredecessorRefiner: 827/827 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 827 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/923 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 827 unsolved
At refinement iteration 1 (OVERLAPS) 1/924 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 827 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 1)
(s5 1)
(s6 0)
(s7 0)
(s8 1)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(s19 1)
(s20 0)
(s21 0)
(s22 1)
(s23 1)
(s24 0)
(s25 0)
(s26 1)
(s27 1)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(s36 1)
(s37 1)
(s38 0)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 1)
(s47 0)
(s48 1)
(s49 0)
(s50 1)
(s51 1)
(s52 0)
(s53 0)
(s54 1)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 1)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 1)
(s81 0)
(s82 1)
(s83 1)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 1)
(s96 0)
(s97 1)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 1)
(s105 0)
(s106 1)
(s107 0)
(s108 1)
(s109 0)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 0)
(s116 1)
(s117 0)
(s118 1)
(s119 0)
(s120 1)
(s121 0)
(s122 1)
(s123 0)
(s124 1)
(s125 0)
(s126 1)
(s127 0)
(s128 1)
(s129 0)
(s130 1)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 1)
(s141 0)
(s142 1)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 1)
(s216 0)
(s217 1)
(s218 0)
(s219 1)
(s220 0)
(s221 1)
(s222 0)
(s223 1)
(s224 0)
(s225 1)
(s226 0)
(s227 1)
(s228 0)
(s229 1)
(s230 0)
(s231 1)
(s232 0)
(s233 1)
(s234 0)
(s235 1)
(s236 0)
(s237 1)
(s238 0)
(s239 1)
(s240 0)
(s241 1)
(s242 0)
(s243 1)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 1)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 1)
(s316 0)
(s317 1)
(s318 1)
(s319 0)
(s320 0)
(s321 1)
(s322 1)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s327 1)
(s328 0)
(s329 1)
(s330 1)
(s331 0)
(s332 0)
(s333 1)
(s334 0)
(s335 1)
(s336 0)
(s337 1)
(s338 1)
(s339 0)
(s340 0)
(s341 1)
(s342 0)
(s343 1)
(s344 0)
(s345 1)
(s346 1)
(s347 0)
(s348 0)
(s349 1)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 1)
(s416 0)
(s417 1)
(s418 0)
(s419 0)
(s420 1)
(s421 1)
(s422 0)
(s423 0)
(s424 1)
(s425 1)
(s426 0)
(s427 0)
(s428 1)
(s429 1)
(s430 0)
(s431 0)
(s432 1)
(s433 1)
(s434 0)
(s435 0)
(s436 1)
(s437 1)
(s438 0)
(s439 0)
(s440 1)
(s441 1)
(s442 0)
(s443 0)
(s444 1)
(s445 1)
(s446 0)
(s447 0)
(s448 1)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 1)
(s518 0)
(s519 1)
(s520 1)
(s521 0)
(s522 0)
(s523 1)
(s524 1)
(s525 0)
(s526 0)
(s527 1)
(s528 1)
(s529 0)
(s530 0)
(s531 1)
(s532 1)
(s533 0)
(s534 0)
(s535 1)
(s536 1)
(s537 0)
(s538 0)
(s539 1)
(s540 1)
(s541 0)
(s542 0)
(s543 1)
(s544 1)
(s545 0)
(s546 0)
(s547 1)
(s548 1)
(s549 0)
(s550 0)
(s551 1)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 1)
(s619 1)
(s620 0)
(s621 1)
(s622 0)
(s623 0)
(s624 1)
(s625 1)
(s626 0)
(s627 0)
(s628 1)
(s629 1)
(s630 0)
(s631 0)
(s632 1)
(s633 1)
(s634 0)
(s635 0)
(s636 1)
(s637 1)
(s638 0)
(s639 0)
(s640 1)
(s641 1)
(s642 0)
(s643 0)
(s644 1)
(s645 1)
(s646 0)
(s647 0)
(s648 1)
(s649 1)
(s650 0)
(s651 0)
(s652 1)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 1)
(s720 0)
(s721 1)
(s722 1)
(s723 0)
(s724 0)
(s725 1)
(s726 1)
(s727 0)
(s728 0)
(s729 1)
(s730 1)
(s731 0)
(s732 0)
(s733 1)
(s734 1)
(s735 0)
(s736 0)
(s737 1)
(s738 1)
(s739 0)
(s740 0)
(s741 1)
(s742 1)
(s743 0)
(s744 0)
(s745 1)
(s746 1)
(s747 0)
(s748 0)
(s749 1)
(s750 1)
(s751 0)
(s752 0)
(s753 1)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 1)
(s821 1)
(s822 0)
(s823 1)
(s824 0)
(s825 0)
(s826 1)
(s827 1)
(s828 0)
(s829 0)
(s830 1)
(s831 1)
(s832 0)
(s833 0)
(s834 1)
(s835 1)
(s836 0)
(s837 0)
(s838 1)
(s839 1)
(s840 0)
(s841 0)
(s842 1)
(s843 1)
(s844 0)
(s845 0)
(s846 1)
(s847 1)
(s848 0)
(s849 0)
(s850 1)
(s851 1)
(s852 0)
(s853 0)
(s854 1)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 924/1760 variables, and 200 constraints, problems are : Problem set: 0 solved, 827 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/924 constraints, ReadFeed: 0/343 constraints, PredecessorRefiner: 0/827 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60925ms problems are : Problem set: 0 solved, 827 unsolved
Search for dead transitions found 0 dead transitions in 60927ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60974 ms. Remains : 924/924 places, 836/836 transitions.
Built C files in :
/tmp/ltsmin6663044566712787865
[2025-06-02 19:01:30] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6663044566712787865
Running compilation step : cd /tmp/ltsmin6663044566712787865;'/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 1480 ms.
Running link step : cd /tmp/ltsmin6663044566712787865;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6663044566712787865;'/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/stateBased16628937438626439234.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 924 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 924/924 places, 836/836 transitions.
Applied a total of 0 rules in 24 ms. Remains 924 /924 variables (removed 0) and now considering 836/836 (removed 0) transitions.
[2025-06-02 19:01:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:01:46] [INFO ] Implicit Places using invariants in 446 ms returned []
[2025-06-02 19:01:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:01:46] [INFO ] State equation strengthened by 343 read => feed constraints.
[2025-06-02 19:01:51] [INFO ] Implicit Places using invariants and state equation in 5715 ms returned []
Implicit Place search using SMT with State Equation took 6165 ms to find 0 implicit places.
Running 827 sub problems to find dead transitions.
[2025-06-02 19:01:51] [INFO ] Invariant cache hit.
[2025-06-02 19:01:51] [INFO ] State equation strengthened by 343 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/923 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 827 unsolved
At refinement iteration 1 (OVERLAPS) 1/924 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 827 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 924/1760 variables, and 200 constraints, problems are : Problem set: 0 solved, 827 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/924 constraints, ReadFeed: 0/343 constraints, PredecessorRefiner: 827/827 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 827 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/923 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 827 unsolved
At refinement iteration 1 (OVERLAPS) 1/924 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 827 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 1)
(s5 1)
(s6 0)
(s7 0)
(s8 1)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(s19 1)
(s20 0)
(s21 0)
(s22 1)
(s23 1)
(s24 0)
(s25 0)
(s26 1)
(s27 1)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(s36 1)
(s37 1)
(s38 0)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 1)
(s47 0)
(s48 1)
(s49 0)
(s50 1)
(s51 1)
(s52 0)
(s53 0)
(s54 1)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 1)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 1)
(s81 0)
(s82 1)
(s83 1)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 1)
(s96 0)
(s97 1)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 1)
(s105 0)
(s106 1)
(s107 0)
(s108 1)
(s109 0)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 0)
(s116 1)
(s117 0)
(s118 1)
(s119 0)
(s120 1)
(s121 1)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 1)
(s127 0)
(s128 1)
(s129 1)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 1)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 1)
(s143 0)
(s144 1)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 1)
(s215 0)
(s216 0)
(s217 1)
(s218 1)
(s219 0)
(s220 0)
(s221 1)
(s222 1)
(s223 0)
(s224 0)
(s225 1)
(s226 1)
(s227 0)
(s228 0)
(s229 1)
(s230 1)
(s231 0)
(s232 0)
(s233 1)
(s234 1)
(s235 0)
(s236 0)
(s237 1)
(s238 1)
(s239 0)
(s240 0)
(s241 1)
(s242 1)
(s243 0)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 1)
(s316 1)
(s317 0)
(s318 0)
(s319 1)
(s320 1)
(s321 0)
(s322 0)
(s323 1)
(s324 1)
(s325 0)
(s326 0)
(s327 1)
(s328 1)
(s329 0)
(s330 0)
(s331 1)
(s332 1)
(s333 0)
(s334 0)
(s335 1)
(s336 1)
(s337 0)
(s338 0)
(s339 1)
(s340 1)
(s341 0)
(s342 0)
(s343 1)
(s344 1)
(s345 0)
(s346 0)
(s347 1)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 924/1760 variables, and 200 constraints, problems are : Problem set: 0 solved, 827 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/924 constraints, ReadFeed: 0/343 constraints, PredecessorRefiner: 0/827 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60920ms problems are : Problem set: 0 solved, 827 unsolved
Search for dead transitions found 0 dead transitions in 60923ms
Finished structural reductions in LTL mode , in 1 iterations and 67116 ms. Remains : 924/924 places, 836/836 transitions.
Built C files in :
/tmp/ltsmin294933845140064370
[2025-06-02 19:02:52] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin294933845140064370
Running compilation step : cd /tmp/ltsmin294933845140064370;'/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 1469 ms.
Running link step : cd /tmp/ltsmin294933845140064370;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin294933845140064370;'/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/stateBased15419760004199332521.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 19:03:08] [INFO ] Flatten gal took : 43 ms
[2025-06-02 19:03:08] [INFO ] Flatten gal took : 43 ms
[2025-06-02 19:03:08] [INFO ] Time to serialize gal into /tmp/LTL9719530643693606660.gal : 5 ms
[2025-06-02 19:03:08] [INFO ] Time to serialize properties into /tmp/LTL1637521468209557284.prop : 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/LTL9719530643693606660.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3913017817977835211.hoa' '-atoms' '/tmp/LTL1637521468209557284.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...317
Loading property file /tmp/LTL1637521468209557284.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3913017817977835211.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
[2025-06-02 19:03:23] [INFO ] Flatten gal took : 43 ms
[2025-06-02 19:03:23] [INFO ] Flatten gal took : 43 ms
[2025-06-02 19:03:23] [INFO ] Time to serialize gal into /tmp/LTL6904551070206932532.gal : 4 ms
[2025-06-02 19:03:23] [INFO ] Time to serialize properties into /tmp/LTL16005737601273986568.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/LTL6904551070206932532.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16005737601273986568.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...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(p290!=1)"))||((F((G("((p16!=1)||(p344!=1))"))&&(X(X(F("(p606!=1)"))))))&&((G("(p290!=1)"))||(("(p290!=1)")&&(F("(p530!=1)"))...161
Formula 0 simplified : G(F!"(p290!=1)" & (G(F!"((p16!=1)||(p344!=1))" | XXG!"(p606!=1)") | (F!"(p290!=1)" & (!"(p290!=1)" | G!"(p530!=1)"))))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
[2025-06-02 19:03:38] [INFO ] Flatten gal took : 48 ms
[2025-06-02 19:03:38] [INFO ] Applying decomposition
[2025-06-02 19:03:38] [INFO ] Flatten gal took : 43 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/graph1945318867271437592.txt' '-o' '/tmp/graph1945318867271437592.bin' '-w' '/tmp/graph1945318867271437592.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1945318867271437592.bin' '-l' '-1' '-v' '-w' '/tmp/graph1945318867271437592.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:03:38] [INFO ] Decomposing Gal with order
[2025-06-02 19:03:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:03:38] [INFO ] Removed a total of 1838 redundant transitions.
[2025-06-02 19:03:38] [INFO ] Flatten gal took : 43 ms
[2025-06-02 19:03:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 144 labels/synchronizations in 44 ms.
[2025-06-02 19:03:38] [INFO ] Time to serialize gal into /tmp/LTL10569055606922164948.gal : 10 ms
[2025-06-02 19:03:38] [INFO ] Time to serialize properties into /tmp/LTL4278757060360923144.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/LTL10569055606922164948.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4278757060360923144.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 : !((F((G("(i4.u112.p290!=1)"))||((F((G("((i1.u7.p16!=1)||(i9.i1.i0.i0.u119.p344!=1))"))&&(X(X(F("(i6.u195.p606!=1)"))))))&&((G("(i4.u11...224
Formula 0 simplified : G(F!"(i4.u112.p290!=1)" & (G(F!"((i1.u7.p16!=1)||(i9.i1.i0.i0.u119.p344!=1))" | XXG!"(i6.u195.p606!=1)") | (F!"(i4.u112.p290!=1)" & ...204
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
Treatment of property Parking-PT-864-LTLFireability-09 finished in 286589 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((X(p0)&&G((p1&&X((p1 U (X(p2)||G(p1))))))))))'
Found a Shortening insensitive property : Parking-PT-864-LTLFireability-14
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 1039 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1039/1039 places, 940/940 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1039 transition count 909
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 1008 transition count 908
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 1007 transition count 908
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 64 place count 1007 transition count 877
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 126 place count 976 transition count 877
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 975 transition count 876
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 975 transition count 876
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 224 place count 927 transition count 828
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 226 place count 926 transition count 835
Applied a total of 226 rules in 98 ms. Remains 926 /1039 variables (removed 113) and now considering 835/940 (removed 105) transitions.
// Phase 1: matrix 835 rows 926 cols
[2025-06-02 19:03:54] [INFO ] Computed 203 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:03:54] [INFO ] Implicit Places using invariants in 451 ms returned [256, 517, 866]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 455 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 923/1039 places, 835/940 transitions.
Applied a total of 0 rules in 20 ms. Remains 923 /923 variables (removed 0) and now considering 835/835 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 574 ms. Remains : 923/1039 places, 835/940 transitions.
Running random walk in product with property : Parking-PT-864-LTLFireability-14
Product exploration explored 100000 steps with 1374 reset in 1012 ms.
Product exploration explored 100000 steps with 1321 reset in 1087 ms.
Computed a total of 1 stabilizing places and 9 stable transitions
Computed a total of 1 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 99 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (157 resets) in 441 ms. (90 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
// Phase 1: matrix 835 rows 923 cols
[2025-06-02 19:03:57] [INFO ] Computed 200 invariants in 2 ms
[2025-06-02 19:03:57] [INFO ] State equation strengthened by 343 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 136/139 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 784/923 variables, 197/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/923 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 835/1758 variables, 923/1123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1758 variables, 343/1466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1758 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1758 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1758/1758 variables, and 1466 constraints, problems are : Problem set: 0 solved, 2 unsolved in 734 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 923/923 constraints, ReadFeed: 343/343 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 136/139 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 784/923 variables, 197/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/923 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 835/1758 variables, 923/1123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1758 variables, 343/1466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1758 variables, 2/1468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1758 variables, 0/1468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1758 variables, 0/1468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1758/1758 variables, and 1468 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1211 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 923/923 constraints, ReadFeed: 343/343 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1957ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 198 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=24 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 9 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT p0)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 p0))), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 263 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 298 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 923/923 places, 835/835 transitions.
Applied a total of 0 rules in 21 ms. Remains 923 /923 variables (removed 0) and now considering 835/835 (removed 0) transitions.
[2025-06-02 19:04:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:04:00] [INFO ] Implicit Places using invariants in 408 ms returned []
[2025-06-02 19:04:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:04:01] [INFO ] State equation strengthened by 343 read => feed constraints.
[2025-06-02 19:04:07] [INFO ] Implicit Places using invariants and state equation in 6799 ms returned []
Implicit Place search using SMT with State Equation took 7210 ms to find 0 implicit places.
Running 826 sub problems to find dead transitions.
[2025-06-02 19:04:07] [INFO ] Invariant cache hit.
[2025-06-02 19:04:07] [INFO ] State equation strengthened by 343 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/922 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 826 unsolved
At refinement iteration 1 (OVERLAPS) 1/923 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 826 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 923/1758 variables, and 200 constraints, problems are : Problem set: 0 solved, 826 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/923 constraints, ReadFeed: 0/343 constraints, PredecessorRefiner: 826/826 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 826 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/922 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 826 unsolved
At refinement iteration 1 (OVERLAPS) 1/923 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 826 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 923/1758 variables, and 200 constraints, problems are : Problem set: 0 solved, 826 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/923 constraints, ReadFeed: 0/343 constraints, PredecessorRefiner: 0/826 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60936ms problems are : Problem set: 0 solved, 826 unsolved
Search for dead transitions found 0 dead transitions in 60937ms
Finished structural reductions in LTL mode , in 1 iterations and 68173 ms. Remains : 923/923 places, 835/835 transitions.
Computed a total of 1 stabilizing places and 9 stable transitions
Computed a total of 1 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 115 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (156 resets) in 414 ms. (96 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
[2025-06-02 19:05:08] [INFO ] Invariant cache hit.
[2025-06-02 19:05:08] [INFO ] State equation strengthened by 343 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 135/137 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 786/923 variables, 198/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/923 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 835/1758 variables, 923/1123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1758 variables, 343/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1758 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1758 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1758/1758 variables, and 1466 constraints, problems are : Problem set: 0 solved, 1 unsolved in 686 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 923/923 constraints, ReadFeed: 343/343 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) 135/137 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 786/923 variables, 198/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/923 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 835/1758 variables, 923/1123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1758 variables, 343/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1758 variables, 1/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1758 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1758 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1758/1758 variables, and 1467 constraints, problems are : Problem set: 0 solved, 1 unsolved in 915 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 923/923 constraints, ReadFeed: 343/343 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1610ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 99 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT p0)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 p0))), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 283 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1389 reset in 1010 ms.
Product exploration explored 100000 steps with 1414 reset in 1134 ms.
Built C files in :
/tmp/ltsmin2556251309043559718
[2025-06-02 19:05:14] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2556251309043559718
Running compilation step : cd /tmp/ltsmin2556251309043559718;'/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 1438 ms.
Running link step : cd /tmp/ltsmin2556251309043559718;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2556251309043559718;'/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/stateBased3731831123568870452.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 923/923 places, 835/835 transitions.
Applied a total of 0 rules in 24 ms. Remains 923 /923 variables (removed 0) and now considering 835/835 (removed 0) transitions.
[2025-06-02 19:05:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:05:29] [INFO ] Implicit Places using invariants in 391 ms returned []
[2025-06-02 19:05:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:05:29] [INFO ] State equation strengthened by 343 read => feed constraints.
[2025-06-02 19:05:36] [INFO ] Implicit Places using invariants and state equation in 6756 ms returned []
Implicit Place search using SMT with State Equation took 7149 ms to find 0 implicit places.
Running 826 sub problems to find dead transitions.
[2025-06-02 19:05:36] [INFO ] Invariant cache hit.
[2025-06-02 19:05:36] [INFO ] State equation strengthened by 343 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/922 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 826 unsolved
At refinement iteration 1 (OVERLAPS) 1/923 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 826 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 923/1758 variables, and 200 constraints, problems are : Problem set: 0 solved, 826 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/923 constraints, ReadFeed: 0/343 constraints, PredecessorRefiner: 826/826 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 826 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/922 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 826 unsolved
At refinement iteration 1 (OVERLAPS) 1/923 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 826 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 923/1758 variables, and 200 constraints, problems are : Problem set: 0 solved, 826 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/923 constraints, ReadFeed: 0/343 constraints, PredecessorRefiner: 0/826 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60861ms problems are : Problem set: 0 solved, 826 unsolved
Search for dead transitions found 0 dead transitions in 60864ms
Finished structural reductions in LTL mode , in 1 iterations and 68041 ms. Remains : 923/923 places, 835/835 transitions.
Built C files in :
/tmp/ltsmin4326877772579037611
[2025-06-02 19:06:37] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4326877772579037611
Running compilation step : cd /tmp/ltsmin4326877772579037611;'/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 1430 ms.
Running link step : cd /tmp/ltsmin4326877772579037611;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4326877772579037611;'/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/stateBased12076065634678744586.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 19:06:52] [INFO ] Flatten gal took : 52 ms
[2025-06-02 19:06:52] [INFO ] Flatten gal took : 44 ms
[2025-06-02 19:06:52] [INFO ] Time to serialize gal into /tmp/LTL9420346217782621485.gal : 5 ms
[2025-06-02 19:06:52] [INFO ] Time to serialize properties into /tmp/LTL18250308846307168747.prop : 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/LTL9420346217782621485.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11556800358603908732.hoa' '-atoms' '/tmp/LTL18250308846307168747.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...319
Loading property file /tmp/LTL18250308846307168747.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11556800358603908732.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
[2025-06-02 19:07:07] [INFO ] Flatten gal took : 44 ms
[2025-06-02 19:07:07] [INFO ] Flatten gal took : 43 ms
[2025-06-02 19:07:07] [INFO ] Time to serialize gal into /tmp/LTL17325461506845285560.gal : 4 ms
[2025-06-02 19:07:07] [INFO ] Time to serialize properties into /tmp/LTL13251488700216219257.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/LTL17325461506845285560.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13251488700216219257.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...277
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(p416==0)"))&&(G(("(p1009!=1)")&&(X(("(p1009!=1)")U((X("(p270!=1)"))||(G("(p1009!=1)")))))))))))
Formula 0 simplified : XG(X!"(p416==0)" | F(!"(p1009!=1)" | X(!"(p1009!=1)" M X!"(p270!=1)")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
[2025-06-02 19:07:22] [INFO ] Flatten gal took : 48 ms
[2025-06-02 19:07:22] [INFO ] Applying decomposition
[2025-06-02 19:07:22] [INFO ] Flatten gal took : 44 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/graph6650489060091266908.txt' '-o' '/tmp/graph6650489060091266908.bin' '-w' '/tmp/graph6650489060091266908.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6650489060091266908.bin' '-l' '-1' '-v' '-w' '/tmp/graph6650489060091266908.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:07:22] [INFO ] Decomposing Gal with order
[2025-06-02 19:07:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:07:22] [INFO ] Removed a total of 1838 redundant transitions.
[2025-06-02 19:07:22] [INFO ] Flatten gal took : 42 ms
[2025-06-02 19:07:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 144 labels/synchronizations in 44 ms.
[2025-06-02 19:07:22] [INFO ] Time to serialize gal into /tmp/LTL5959090434006828943.gal : 8 ms
[2025-06-02 19:07:22] [INFO ] Time to serialize properties into /tmp/LTL4788862633652521341.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/LTL5959090434006828943.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4788862633652521341.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...254
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(i8.u152.p416==0)"))&&(G(("(i12.u313.p1009!=1)")&&(X(("(i12.u313.p1009!=1)")U((X("(i6.u108.p270!=1)"))||(G("(i12.u313.p1009...171
Formula 0 simplified : XG(X!"(i8.u152.p416==0)" | F(!"(i12.u313.p1009!=1)" | X(!"(i12.u313.p1009!=1)" M X!"(i6.u108.p270!=1)")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
Treatment of property Parking-PT-864-LTLFireability-14 finished in 224210 ms.
[2025-06-02 19:07:37] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13009749636842996766
[2025-06-02 19:07:38] [INFO ] Applying decomposition
[2025-06-02 19:07:38] [INFO ] Computing symmetric may disable matrix : 940 transitions.
[2025-06-02 19:07:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 19:07:38] [INFO ] Computing symmetric may enable matrix : 940 transitions.
[2025-06-02 19:07:38] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 19:07:38] [INFO ] Flatten gal took : 30 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/graph7343524722332250934.txt' '-o' '/tmp/graph7343524722332250934.bin' '-w' '/tmp/graph7343524722332250934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7343524722332250934.bin' '-l' '-1' '-v' '-w' '/tmp/graph7343524722332250934.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:07:38] [INFO ] Decomposing Gal with order
[2025-06-02 19:07:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:07:38] [INFO ] Removed a total of 115 redundant transitions.
[2025-06-02 19:07:38] [INFO ] Flatten gal took : 31 ms
[2025-06-02 19:07:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-02 19:07:38] [INFO ] Time to serialize gal into /tmp/LTLFireability1451565903314069438.gal : 7 ms
[2025-06-02 19:07:38] [INFO ] Time to serialize properties into /tmp/LTLFireability16491026641012468797.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/LTLFireability1451565903314069438.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16491026641012468797.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...277
Read 4 LTL properties
[2025-06-02 19:07:38] [INFO ] Computing Do-Not-Accords matrix : 940 transitions.
[2025-06-02 19:07:38] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 19:07:38] [INFO ] Built C files in 230ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13009749636842996766
Running compilation step : cd /tmp/ltsmin13009749636842996766;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '180' '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'
Checking formula 0 : !((X(X(F(("((i0.u294.p919==0)||(i10.u329.p955==0))")&&(F(("((i4.u109.p271==1)&&(i4.u133.p372==1))")||(G("((i6.u143.p396==0)||(i6.u166....174
Formula 0 simplified : XXG(!"((i0.u294.p919==0)||(i10.u329.p955==0))" | G(!"((i4.u109.p271==1)&&(i4.u133.p372==1))" & F!"((i6.u143.p396==0)||(i6.u166.p488=...162
Compilation finished in 2636 ms.
Running link step : cd /tmp/ltsmin13009749636842996766;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin13009749636842996766;'/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' '--ltl' 'X(X(<>(((LTLAPp0==true)&&<>(((LTLAPp1==true)||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin13009749636842996766;'/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' '--ltl' 'X(X(<>(((LTLAPp0==true)&&<>(((LTLAPp1==true)||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13009749636842996766;'/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' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions i1.u96.t240, i4.u135.t206, i6.u175.t172, i7.u215.t138, i8.u253.t104, i9.u292.t70, i10.u330.t3...270
Computing Next relation with stutter on 5.35201e+12 deadlock states
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin13009749636842996766;'/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' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13009749636842996766;'/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' '--ltl' '<>(([]((LTLAPp4==true))||(([]((LTLAPp4==true))||((LTLAPp4==true)&&<>((LTLAPp5==true))))&&<>(([](!(LTLAPp6==true))&&X(X(<>((LTLAPp7==true)))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin13009749636842996766;'/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' '--ltl' '<>(([]((LTLAPp4==true))||(([]((LTLAPp4==true))||((LTLAPp4==true)&&<>((LTLAPp5==true))))&&<>(([](!(LTLAPp6==true))&&X(X(<>((LTLAPp7==true)))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13009749636842996766;'/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' '--ltl' 'X(<>((X((LTLAPp8==true))&&[](((LTLAPp9==true)&&X(((LTLAPp9==true) U (X((LTLAPp10==true))||[]((LTLAPp9==true))))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin13009749636842996766;'/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' '--ltl' 'X(<>((X((LTLAPp8==true))&&[](((LTLAPp9==true)&&X(((LTLAPp9==true) U (X((LTLAPp10==true))||[]((LTLAPp9==true))))))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin13009749636842996766;'/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' '--ltl' 'X(X(<>(((LTLAPp0==true)&&<>(((LTLAPp1==true)||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-02 19:37:37] [INFO ] Applying decomposition
BK_TIME_CONFINEMENT_REACHED
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-864"
export BK_EXAMINATION="LTLFireability"
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-864, examination is LTLFireability"
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-174876812600444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-864.tgz
mv Parking-PT-864 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;