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 |
| 7028.228 | 1693220.00 | 4387679.00 | 3365.80 | FFFFTFFFFTFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r268-smll-171654406900100.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool 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 r268-smll-171654406900100
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 20:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 20:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 19:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 19:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 427K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1716671659816
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 202405141337
[2024-05-25 21:14:21] [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]
[2024-05-25 21:14:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 21:14:21] [INFO ] Load time of PNML (sax parser for PT used): 317 ms
[2024-05-25 21:14:21] [INFO ] Transformed 1185 places.
[2024-05-25 21:14:21] [INFO ] Transformed 1697 transitions.
[2024-05-25 21:14:21] [INFO ] Found NUPN structural information;
[2024-05-25 21:14:21] [INFO ] Parsed PT model containing 1185 places and 1697 transitions and 5073 arcs in 488 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 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-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1178 transition count 1002
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1178 transition count 1002
Applied a total of 14 rules in 259 ms. Remains 1178 /1185 variables (removed 7) and now considering 1002/1009 (removed 7) transitions.
// Phase 1: matrix 1002 rows 1178 cols
[2024-05-25 21:14:22] [INFO ] Computed 280 invariants in 62 ms
[2024-05-25 21:14:24] [INFO ] Implicit Places using invariants in 1941 ms returned [152, 160, 168, 176, 184, 192, 200, 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, 641, 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, 1084, 1092, 1100, 1108, 1116, 1124, 1132, 1140, 1174]
Discarding 77 places :
Implicit Place search using SMT only with invariants took 1994 ms to find 77 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1101/1185 places, 1002/1009 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 1040 transition count 941
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 1040 transition count 941
Applied a total of 122 rules in 164 ms. Remains 1040 /1101 variables (removed 61) and now considering 941/1002 (removed 61) transitions.
// Phase 1: matrix 941 rows 1040 cols
[2024-05-25 21:14:24] [INFO ] Computed 203 invariants in 21 ms
[2024-05-25 21:14:25] [INFO ] Implicit Places using invariants in 1004 ms returned []
[2024-05-25 21:14:25] [INFO ] Invariant cache hit.
[2024-05-25 21:14:26] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 21:14:29] [INFO ] Implicit Places using invariants and state equation in 4061 ms returned []
Implicit Place search using SMT with State Equation took 5070 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1040/1185 places, 941/1009 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7515 ms. Remains : 1040/1185 places, 941/1009 transitions.
Support contains 51 out of 1040 places after structural reductions.
[2024-05-25 21:14:30] [INFO ] Flatten gal took : 190 ms
[2024-05-25 21:14:30] [INFO ] Flatten gal took : 100 ms
[2024-05-25 21:14:30] [INFO ] Input system was already deterministic with 941 transitions.
Support contains 49 out of 1040 places (down from 51) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 35 to 34
RANDOM walk for 40000 steps (152 resets) in 4328 ms. (9 steps per ms) remains 8/34 properties
BEST_FIRST walk for 40004 steps (8 resets) in 369 ms. (108 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 372 ms. (107 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 363 ms. (109 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 354 ms. (112 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 352 ms. (113 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 394 ms. (101 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 8/8 properties
[2024-05-25 21:14:32] [INFO ] Invariant cache hit.
[2024-05-25 21:14:32] [INFO ] State equation strengthened by 248 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 401/417 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 623/1040 variables, 191/203 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-25 21:14:33] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1040 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1040 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 941/1981 variables, 1040/1244 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1981 variables, 248/1492 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1981 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/1981 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1981/1981 variables, and 1492 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3510 ms.
Refiners :[Positive P Invariants (semi-flows): 203/203 constraints, State Equation: 1040/1040 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 401/417 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 623/1040 variables, 191/203 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1040 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1040 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 941/1981 variables, 1040/1244 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1981 variables, 248/1492 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1981 variables, 8/1500 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1981 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/1981 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1981/1981 variables, and 1500 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3711 ms.
Refiners :[Positive P Invariants (semi-flows): 203/203 constraints, State Equation: 1040/1040 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 7309ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Finished Parikh walk after 231 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=46 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 2331 ms.
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(!p1&&X((!p1 U (X(!p2)||G(!p1))))))))'
Support contains 6 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 112 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-25 21:14:43] [INFO ] Computed 203 invariants in 18 ms
[2024-05-25 21:14:44] [INFO ] Implicit Places using invariants in 1117 ms returned [195, 276, 1034]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1124 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1033 transition count 937
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1033 transition count 937
Applied a total of 6 rules in 86 ms. Remains 1033 /1036 variables (removed 3) and now considering 937/940 (removed 3) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-25 21:14:44] [INFO ] Computed 200 invariants in 9 ms
[2024-05-25 21:14:45] [INFO ] Implicit Places using invariants in 1085 ms returned []
[2024-05-25 21:14:45] [INFO ] Invariant cache hit.
[2024-05-25 21:14:46] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 21:14:49] [INFO ] Implicit Places using invariants and state equation in 4111 ms returned []
Implicit Place search using SMT with State Equation took 5212 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6536 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 611 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Running random walk in product with property : Parking-PT-864-LTLFireability-00
Product exploration explored 100000 steps with 388 reset in 1793 ms.
Product exploration explored 100000 steps with 388 reset in 1477 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) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 158 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
RANDOM walk for 40000 steps (156 resets) in 1384 ms. (28 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 581 ms. (68 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 337 ms. (118 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 801 ms. (49 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 457 ms. (87 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 596 ms. (67 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 8/8 properties
[2024-05-25 21:14:55] [INFO ] Invariant cache hit.
[2024-05-25 21:14:55] [INFO ] State equation strengthened by 248 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 161/167 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 866/1033 variables, 195/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 937/1970 variables, 1033/1233 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1970 variables, 248/1481 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1970/1970 variables, and 1481 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2431 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 161/167 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 866/1033 variables, 195/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-25 21:14:58] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1033 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 937/1970 variables, 1033/1234 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 248/1482 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1970 variables, 8/1490 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1970 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/1970 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1970/1970 variables, and 1490 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3624 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 6114ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 4 properties in 3211 ms.
Support contains 6 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 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 222 place count 922 transition count 826
Free-agglomeration rule applied 260 times.
Iterating global reduction 2 with 260 rules applied. Total rules applied 482 place count 922 transition count 566
Reduce places removed 260 places and 0 transitions.
Graph (complete) has 1330 edges and 662 vertex of which 182 are kept as prefixes of interest. Removing 480 places using SCC suffix rule.3 ms
Discarding 480 places :
Also discarding 396 output transitions
Drop transitions (Output transitions of discarded places.) removed 396 transitions
Iterating post reduction 2 with 261 rules applied. Total rules applied 743 place count 182 transition count 170
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 767 place count 182 transition count 146
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 768 place count 182 transition count 146
Applied a total of 768 rules in 347 ms. Remains 182 /1033 variables (removed 851) and now considering 146/937 (removed 791) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 347 ms. Remains : 182/1033 places, 146/937 transitions.
RANDOM walk for 40000 steps (393 resets) in 415 ms. (96 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/2 properties
BEST_FIRST walk for 8797 steps (9 resets) in 31 ms. (274 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (OR p1 p0) (OR p1 (NOT p2))))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) p0))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (OR (NOT p1) p0) (OR (NOT p1) (NOT p2))))), (F p1), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 19 factoid took 675 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 350 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 315 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Support contains 6 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 127 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2024-05-25 21:15:07] [INFO ] Invariant cache hit.
[2024-05-25 21:15:08] [INFO ] Implicit Places using invariants in 971 ms returned []
[2024-05-25 21:15:08] [INFO ] Invariant cache hit.
[2024-05-25 21:15:09] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 21:15:12] [INFO ] Implicit Places using invariants and state equation in 4319 ms returned []
Implicit Place search using SMT with State Equation took 5293 ms to find 0 implicit places.
Running 936 sub problems to find dead transitions.
[2024-05-25 21:15:12] [INFO ] Invariant cache hit.
[2024-05-25 21:15:12] [INFO ] State equation strengthened by 248 read => feed constraints.
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 30434ms, After SMT, problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 30452ms
Finished structural reductions in LTL mode , in 1 iterations and 35880 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 p1) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 175 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 326 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
RANDOM walk for 40000 steps (154 resets) in 1380 ms. (28 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 8/8 properties
[2024-05-25 21:15:44] [INFO ] Invariant cache hit.
[2024-05-25 21:15:44] [INFO ] State equation strengthened by 248 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 161/167 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 866/1033 variables, 195/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 937/1970 variables, 1033/1233 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1970 variables, 248/1481 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1970/1970 variables, and 1481 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1993 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 161/167 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 866/1033 variables, 195/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-25 21:15:47] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1033 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 937/1970 variables, 1033/1234 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 248/1482 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1970 variables, 8/1490 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1970 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/1970 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1970/1970 variables, and 1490 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3474 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 5488ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 4 properties in 3221 ms.
Support contains 6 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 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 222 place count 922 transition count 826
Free-agglomeration rule applied 260 times.
Iterating global reduction 2 with 260 rules applied. Total rules applied 482 place count 922 transition count 566
Reduce places removed 260 places and 0 transitions.
Graph (complete) has 1330 edges and 662 vertex of which 182 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 261 rules applied. Total rules applied 743 place count 182 transition count 170
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 767 place count 182 transition count 146
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 768 place count 182 transition count 146
Applied a total of 768 rules in 164 ms. Remains 182 /1033 variables (removed 851) and now considering 146/937 (removed 791) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 182/1033 places, 146/937 transitions.
RANDOM walk for 40000 steps (428 resets) in 231 ms. (172 steps per ms) remains 2/4 properties
BEST_FIRST walk for 34376 steps (10 resets) in 67 ms. (505 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (OR p1 p0) (OR p1 (NOT p2))))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) p0))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (OR (NOT p1) p0) (OR (NOT p1) (NOT p2))))), (F p1), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 19 factoid took 566 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 313 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 430 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Product exploration explored 100000 steps with 388 reset in 1514 ms.
Product exploration explored 100000 steps with 391 reset in 1387 ms.
Built C files in :
/tmp/ltsmin14429359749231183389
[2024-05-25 21:15:58] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14429359749231183389
Running compilation step : cd /tmp/ltsmin14429359749231183389;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14429359749231183389;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14429359749231183389;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 6 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 26 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2024-05-25 21:16:01] [INFO ] Invariant cache hit.
[2024-05-25 21:16:02] [INFO ] Implicit Places using invariants in 1089 ms returned []
[2024-05-25 21:16:02] [INFO ] Invariant cache hit.
[2024-05-25 21:16:03] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 21:16:07] [INFO ] Implicit Places using invariants and state equation in 4528 ms returned []
Implicit Place search using SMT with State Equation took 5623 ms to find 0 implicit places.
Running 936 sub problems to find dead transitions.
[2024-05-25 21:16:07] [INFO ] Invariant cache hit.
[2024-05-25 21:16:07] [INFO ] State equation strengthened by 248 read => feed constraints.
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 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 30359ms, After SMT, problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 30380ms
Finished structural reductions in LTL mode , in 1 iterations and 36035 ms. Remains : 1033/1033 places, 937/937 transitions.
Built C files in :
/tmp/ltsmin8759601439479919166
[2024-05-25 21:16:37] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8759601439479919166
Running compilation step : cd /tmp/ltsmin8759601439479919166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8759601439479919166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8759601439479919166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-25 21:16:40] [INFO ] Flatten gal took : 82 ms
[2024-05-25 21:16:40] [INFO ] Flatten gal took : 75 ms
[2024-05-25 21:16:41] [INFO ] Time to serialize gal into /tmp/LTL2033627919379734469.gal : 35 ms
[2024-05-25 21:16:41] [INFO ] Time to serialize properties into /tmp/LTL13552987116185807728.prop : 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2033627919379734469.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8111198320732896323.hoa' '-atoms' '/tmp/LTL13552987116185807728.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13552987116185807728.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8111198320732896323.hoa
Detected timeout of ITS tools.
[2024-05-25 21:16:56] [INFO ] Flatten gal took : 51 ms
[2024-05-25 21:16:56] [INFO ] Flatten gal took : 41 ms
[2024-05-25 21:16:56] [INFO ] Time to serialize gal into /tmp/LTL1979135719384249015.gal : 9 ms
[2024-05-25 21:16:56] [INFO ] Time to serialize properties into /tmp/LTL5206604330090797809.ltl : 4 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1979135719384249015.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5206604330090797809.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((X("((p394==0)||(p438==0))"))||((X((!("((p130==1)&&(p179==1))"))U((X(!("((p399==1)&&(p451==1))")))||(G(!("((p130==1)&&(p179==1))"...193
Formula 0 simplified : F(X!"((p394==0)||(p438==0))" & (!"((p130!=1)||(p179!=1))" | X("((p130==1)&&(p179==1))" M X"((p399==1)&&(p451==1))")))
Detected timeout of ITS tools.
[2024-05-25 21:17:11] [INFO ] Flatten gal took : 66 ms
[2024-05-25 21:17:11] [INFO ] Applying decomposition
[2024-05-25 21:17:11] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14412580559585916275.txt' '-o' '/tmp/graph14412580559585916275.bin' '-w' '/tmp/graph14412580559585916275.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14412580559585916275.bin' '-l' '-1' '-v' '-w' '/tmp/graph14412580559585916275.weights' '-q' '0' '-e' '0.001'
[2024-05-25 21:17:11] [INFO ] Decomposing Gal with order
[2024-05-25 21:17:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 21:17:12] [INFO ] Removed a total of 117 redundant transitions.
[2024-05-25 21:17:12] [INFO ] Flatten gal took : 189 ms
[2024-05-25 21:17:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 23 ms.
[2024-05-25 21:17:12] [INFO ] Time to serialize gal into /tmp/LTL18107013727286333359.gal : 24 ms
[2024-05-25 21:17:12] [INFO ] Time to serialize properties into /tmp/LTL8156119608874733575.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18107013727286333359.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8156119608874733575.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X("((i10.u141.p394==0)||(i10.u173.p438==0))"))||((X((!("((i3.u66.p130==1)&&(i3.u79.p179==1))"))U((X(!("((i10.u144.p399==1)&&(i10...271
Formula 0 simplified : F(X!"((i10.u141.p394==0)||(i10.u173.p438==0))" & (!"((i3.u66.p130!=1)||(i3.u79.p179!=1))" | X("((i3.u66.p130==1)&&(i3.u79.p179==1))"...204
Detected timeout of ITS tools.
Treatment of property Parking-PT-864-LTLFireability-00 finished in 164157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 62 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-25 21:17:27] [INFO ] Computed 203 invariants in 13 ms
[2024-05-25 21:17:28] [INFO ] Implicit Places using invariants in 1183 ms returned [195, 276, 1034]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1193 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1033 transition count 937
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1033 transition count 937
Applied a total of 6 rules in 53 ms. Remains 1033 /1036 variables (removed 3) and now considering 937/940 (removed 3) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-25 21:17:28] [INFO ] Computed 200 invariants in 6 ms
[2024-05-25 21:17:29] [INFO ] Implicit Places using invariants in 974 ms returned []
[2024-05-25 21:17:29] [INFO ] Invariant cache hit.
[2024-05-25 21:17:30] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 21:17:33] [INFO ] Implicit Places using invariants and state equation in 3427 ms returned []
Implicit Place search using SMT with State Equation took 4411 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5719 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-01
Stuttering criterion allowed to conclude after 259 steps with 0 reset in 6 ms.
FORMULA Parking-PT-864-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-01 finished in 5848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X(G(p1))))&&p0))))'
Support contains 2 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 96 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-25 21:17:33] [INFO ] Computed 203 invariants in 6 ms
[2024-05-25 21:17:34] [INFO ] Implicit Places using invariants in 1271 ms returned [195, 276, 1034]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1273 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1033 transition count 937
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1033 transition count 937
Applied a total of 6 rules in 86 ms. Remains 1033 /1036 variables (removed 3) and now considering 937/940 (removed 3) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-25 21:17:34] [INFO ] Computed 200 invariants in 6 ms
[2024-05-25 21:17:35] [INFO ] Implicit Places using invariants in 1154 ms returned []
[2024-05-25 21:17:35] [INFO ] Invariant cache hit.
[2024-05-25 21:17:36] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 21:17:40] [INFO ] Implicit Places using invariants and state equation in 4314 ms returned []
Implicit Place search using SMT with State Equation took 5470 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6926 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 285 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-864-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-02 finished in 7236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 2 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 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 1040 transition count 910
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1009 transition count 910
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 1009 transition count 879
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 978 transition count 879
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 977 transition count 878
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 977 transition count 878
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 228 place count 926 transition count 827
Applied a total of 228 rules in 210 ms. Remains 926 /1040 variables (removed 114) and now considering 827/941 (removed 114) transitions.
// Phase 1: matrix 827 rows 926 cols
[2024-05-25 21:17:40] [INFO ] Computed 203 invariants in 6 ms
[2024-05-25 21:17:41] [INFO ] Implicit Places using invariants in 1016 ms returned [181, 257, 922]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1018 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 923/1040 places, 827/941 transitions.
Applied a total of 0 rules in 40 ms. Remains 923 /923 variables (removed 0) and now considering 827/827 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1268 ms. Remains : 923/1040 places, 827/941 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-03
Stuttering criterion allowed to conclude after 464 steps with 1 reset in 7 ms.
FORMULA Parking-PT-864-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-03 finished in 1377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)||(p1&&F((!p2&&X(p3))))))))'
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 51 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-25 21:17:41] [INFO ] Computed 203 invariants in 13 ms
[2024-05-25 21:17:42] [INFO ] Implicit Places using invariants in 1112 ms returned [276, 1034]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1114 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1037/1040 places, 940/941 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 92 ms. Remains 1035 /1037 variables (removed 2) and now considering 938/940 (removed 2) transitions.
// Phase 1: matrix 938 rows 1035 cols
[2024-05-25 21:17:43] [INFO ] Computed 201 invariants in 6 ms
[2024-05-25 21:17:44] [INFO ] Implicit Places using invariants in 1138 ms returned []
[2024-05-25 21:17:44] [INFO ] Invariant cache hit.
[2024-05-25 21:17:45] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 21:17:49] [INFO ] Implicit Places using invariants and state equation in 4991 ms returned []
Implicit Place search using SMT with State Equation took 6131 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1035/1040 places, 938/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7391 ms. Remains : 1035/1040 places, 938/941 transitions.
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 3793 ms.
Product exploration explored 100000 steps with 50000 reset in 4301 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 38 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-864-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-864-LTLFireability-04 finished in 15811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X((X(X(G(X(G(p0))))) U p1))))))'
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 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 1040 transition count 910
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1009 transition count 910
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 1009 transition count 879
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 124 place count 978 transition count 879
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 977 transition count 878
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 977 transition count 878
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 228 place count 926 transition count 827
Applied a total of 228 rules in 186 ms. Remains 926 /1040 variables (removed 114) and now considering 827/941 (removed 114) transitions.
// Phase 1: matrix 827 rows 926 cols
[2024-05-25 21:17:57] [INFO ] Computed 203 invariants in 5 ms
[2024-05-25 21:17:58] [INFO ] Implicit Places using invariants in 948 ms returned [181, 257, 922]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 953 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 923/1040 places, 827/941 transitions.
Applied a total of 0 rules in 34 ms. Remains 923 /923 variables (removed 0) and now considering 827/827 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1174 ms. Remains : 923/1040 places, 827/941 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-864-LTLFireability-05
Stuttering criterion allowed to conclude after 257 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 1501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 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 1040 transition count 909
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 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 64 place count 1008 transition count 877
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 976 transition count 877
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 975 transition count 876
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 975 transition count 876
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 232 place count 924 transition count 825
Applied a total of 232 rules in 171 ms. Remains 924 /1040 variables (removed 116) and now considering 825/941 (removed 116) transitions.
// Phase 1: matrix 825 rows 924 cols
[2024-05-25 21:17:59] [INFO ] Computed 203 invariants in 5 ms
[2024-05-25 21:18:00] [INFO ] Implicit Places using invariants in 901 ms returned [181, 257, 920]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 903 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 921/1040 places, 825/941 transitions.
Applied a total of 0 rules in 51 ms. Remains 921 /921 variables (removed 0) and now considering 825/825 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1126 ms. Remains : 921/1040 places, 825/941 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-06
Stuttering criterion allowed to conclude after 258 steps with 0 reset in 6 ms.
FORMULA Parking-PT-864-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-06 finished in 1193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)||(p1 U p2)))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 84 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-25 21:18:00] [INFO ] Computed 203 invariants in 7 ms
[2024-05-25 21:18:01] [INFO ] Implicit Places using invariants in 1284 ms returned [195, 276, 1034]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1291 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1033 transition count 937
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1033 transition count 937
Applied a total of 6 rules in 85 ms. Remains 1033 /1036 variables (removed 3) and now considering 937/940 (removed 3) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-25 21:18:01] [INFO ] Computed 200 invariants in 4 ms
[2024-05-25 21:18:02] [INFO ] Implicit Places using invariants in 1167 ms returned []
[2024-05-25 21:18:02] [INFO ] Invariant cache hit.
[2024-05-25 21:18:03] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 21:18:07] [INFO ] Implicit Places using invariants and state equation in 5044 ms returned []
Implicit Place search using SMT with State Equation took 6213 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7673 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-864-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-07 finished in 7894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U G(p1))))'
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 88 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-25 21:18:08] [INFO ] Computed 203 invariants in 6 ms
[2024-05-25 21:18:09] [INFO ] Implicit Places using invariants in 1354 ms returned [195, 276]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1356 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1037/1040 places, 940/941 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 51 ms. Remains 1035 /1037 variables (removed 2) and now considering 938/940 (removed 2) transitions.
// Phase 1: matrix 938 rows 1035 cols
[2024-05-25 21:18:09] [INFO ] Computed 201 invariants in 5 ms
[2024-05-25 21:18:10] [INFO ] Implicit Places using invariants in 847 ms returned []
[2024-05-25 21:18:10] [INFO ] Invariant cache hit.
[2024-05-25 21:18:11] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 21:18:14] [INFO ] Implicit Places using invariants and state equation in 3748 ms returned []
Implicit Place search using SMT with State Equation took 4600 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1035/1040 places, 938/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6096 ms. Remains : 1035/1040 places, 938/941 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : Parking-PT-864-LTLFireability-08
Entered a terminal (fully accepting) state of product in 150 steps with 35 reset in 4 ms.
FORMULA Parking-PT-864-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-08 finished in 6320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0) U p0))||(X(!(G(!p1)||p2)) U p1)))'
Support contains 5 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 53 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-25 21:18:14] [INFO ] Computed 203 invariants in 3 ms
[2024-05-25 21:18:15] [INFO ] Implicit Places using invariants in 1145 ms returned [195, 276, 1034]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1152 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1033 transition count 937
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1033 transition count 937
Applied a total of 6 rules in 51 ms. Remains 1033 /1036 variables (removed 3) and now considering 937/940 (removed 3) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-25 21:18:15] [INFO ] Computed 200 invariants in 3 ms
[2024-05-25 21:18:16] [INFO ] Implicit Places using invariants in 1006 ms returned []
[2024-05-25 21:18:16] [INFO ] Invariant cache hit.
[2024-05-25 21:18:17] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 21:18:20] [INFO ] Implicit Places using invariants and state equation in 3727 ms returned []
Implicit Place search using SMT with State Equation took 4747 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6007 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Running random walk in product with property : Parking-PT-864-LTLFireability-10
Stuttering criterion allowed to conclude after 257 steps with 0 reset in 4 ms.
FORMULA Parking-PT-864-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-10 finished in 6246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((p1 U (p2||G(p1))))||p0))))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Applied a total of 0 rules in 32 ms. Remains 1040 /1040 variables (removed 0) and now considering 941/941 (removed 0) transitions.
// Phase 1: matrix 941 rows 1040 cols
[2024-05-25 21:18:20] [INFO ] Computed 203 invariants in 4 ms
[2024-05-25 21:18:21] [INFO ] Implicit Places using invariants in 859 ms returned [195, 276, 1035]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 886 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1037/1040 places, 941/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1034 transition count 938
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1034 transition count 938
Applied a total of 6 rules in 57 ms. Remains 1034 /1037 variables (removed 3) and now considering 938/941 (removed 3) transitions.
// Phase 1: matrix 938 rows 1034 cols
[2024-05-25 21:18:21] [INFO ] Computed 200 invariants in 12 ms
[2024-05-25 21:18:22] [INFO ] Implicit Places using invariants in 978 ms returned []
[2024-05-25 21:18:22] [INFO ] Invariant cache hit.
[2024-05-25 21:18:23] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 21:18:26] [INFO ] Implicit Places using invariants and state equation in 3767 ms returned []
Implicit Place search using SMT with State Equation took 4758 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1034/1040 places, 938/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5734 ms. Remains : 1034/1040 places, 938/941 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-11
Product exploration explored 100000 steps with 387 reset in 1238 ms.
Product exploration explored 100000 steps with 390 reset in 1387 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 (NOT p2) p1 p0), (X p0), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 110 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (155 resets) in 750 ms. (53 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) p1 p0), (X p0), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p0) p2)))), (F (NOT p1)), (F p2), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 8 factoid took 302 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 1034 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1034/1034 places, 938/938 transitions.
Applied a total of 0 rules in 25 ms. Remains 1034 /1034 variables (removed 0) and now considering 938/938 (removed 0) transitions.
[2024-05-25 21:18:30] [INFO ] Invariant cache hit.
[2024-05-25 21:18:31] [INFO ] Implicit Places using invariants in 921 ms returned []
[2024-05-25 21:18:31] [INFO ] Invariant cache hit.
[2024-05-25 21:18:32] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 21:18:34] [INFO ] Implicit Places using invariants and state equation in 3478 ms returned []
Implicit Place search using SMT with State Equation took 4405 ms to find 0 implicit places.
Running 937 sub problems to find dead transitions.
[2024-05-25 21:18:34] [INFO ] Invariant cache hit.
[2024-05-25 21:18:34] [INFO ] State equation strengthened by 248 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1033 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 937 unsolved
SMT process timed out in 30327ms, After SMT, problems are : Problem set: 0 solved, 937 unsolved
Search for dead transitions found 0 dead transitions in 30340ms
Finished structural reductions in LTL mode , in 1 iterations and 34772 ms. Remains : 1034/1034 places, 938/938 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 (NOT p2) p0), (X p0), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 121 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (154 resets) in 710 ms. (56 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 (NOT p2) p0), (X p0), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p0) p2)))), (F (NOT p1)), (F p2), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 8 factoid took 322 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 176 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 184 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 391 reset in 1386 ms.
Entered a terminal (fully accepting) state of product in 28526 steps with 109 reset in 397 ms.
FORMULA Parking-PT-864-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-11 finished in 47635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U p1))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 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 1040 transition count 909
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 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 64 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 128 place count 976 transition count 877
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 975 transition count 876
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 975 transition count 876
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 232 place count 924 transition count 825
Applied a total of 232 rules in 104 ms. Remains 924 /1040 variables (removed 116) and now considering 825/941 (removed 116) transitions.
// Phase 1: matrix 825 rows 924 cols
[2024-05-25 21:19:08] [INFO ] Computed 203 invariants in 4 ms
[2024-05-25 21:19:09] [INFO ] Implicit Places using invariants in 1002 ms returned [181, 257, 920]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1005 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 921/1040 places, 825/941 transitions.
Applied a total of 0 rules in 42 ms. Remains 921 /921 variables (removed 0) and now considering 825/825 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1153 ms. Remains : 921/1040 places, 825/941 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), true, p0]
Running random walk in product with property : Parking-PT-864-LTLFireability-12
Product exploration explored 100000 steps with 396 reset in 1251 ms.
Product exploration explored 100000 steps with 396 reset in 1494 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 (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 113 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), true, p0]
RANDOM walk for 40000 steps (154 resets) in 724 ms. (55 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
// Phase 1: matrix 825 rows 921 cols
[2024-05-25 21:19:12] [INFO ] Computed 200 invariants in 3 ms
[2024-05-25 21:19:12] [INFO ] State equation strengthened by 344 read => feed constraints.
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
All remaining problems are real, not stopping.
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) 825/1746 variables, 921/1121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1746 variables, 344/1465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1746 variables, 0/1465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1746 variables, 0/1465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1746/1746 variables, and 1465 constraints, problems are : Problem set: 0 solved, 2 unsolved in 997 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]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 825/1746 variables, 921/1121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1746 variables, 344/1465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1746 variables, 2/1467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1746 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1746 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1746/1746 variables, and 1467 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1048 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]
After SMT, in 2069ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 204 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=34 )
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 7 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p0) p1)))
Knowledge based reduction with 9 factoid took 134 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-864-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-864-LTLFireability-12 finished in 6773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&X(p1)) U G(p2)))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 51 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-25 21:19:15] [INFO ] Computed 203 invariants in 5 ms
[2024-05-25 21:19:16] [INFO ] Implicit Places using invariants in 924 ms returned [195, 1034]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 932 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1037/1040 places, 940/941 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 76 ms. Remains 1035 /1037 variables (removed 2) and now considering 938/940 (removed 2) transitions.
// Phase 1: matrix 938 rows 1035 cols
[2024-05-25 21:19:16] [INFO ] Computed 201 invariants in 3 ms
[2024-05-25 21:19:17] [INFO ] Implicit Places using invariants in 960 ms returned []
[2024-05-25 21:19:17] [INFO ] Invariant cache hit.
[2024-05-25 21:19:17] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 21:19:21] [INFO ] Implicit Places using invariants and state equation in 3945 ms returned []
Implicit Place search using SMT with State Equation took 4909 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1035/1040 places, 938/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5969 ms. Remains : 1035/1040 places, 938/941 transitions.
Stuttering acceptance computed with spot in 178 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 0 ms.
FORMULA Parking-PT-864-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-13 finished in 6166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&G((p1&&X((p1 U (X(p2)||G(p1))))))))))'
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 56 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-25 21:19:21] [INFO ] Computed 203 invariants in 3 ms
[2024-05-25 21:19:22] [INFO ] Implicit Places using invariants in 759 ms returned [195, 276, 1034]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 777 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1033 transition count 937
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1033 transition count 937
Applied a total of 6 rules in 52 ms. Remains 1033 /1036 variables (removed 3) and now considering 937/940 (removed 3) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-25 21:19:22] [INFO ] Computed 200 invariants in 3 ms
[2024-05-25 21:19:23] [INFO ] Implicit Places using invariants in 778 ms returned []
[2024-05-25 21:19:23] [INFO ] Invariant cache hit.
[2024-05-25 21:19:23] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 21:19:26] [INFO ] Implicit Places using invariants and state equation in 3770 ms returned []
Implicit Place search using SMT with State Equation took 4555 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5441 ms. Remains : 1033/1040 places, 937/941 transitions.
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))]
Running random walk in product with property : Parking-PT-864-LTLFireability-14
Product exploration explored 100000 steps with 1375 reset in 1658 ms.
Product exploration explored 100000 steps with 1322 reset in 1780 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 p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 125 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 294 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 (153 resets) in 591 ms. (67 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
[2024-05-25 21:19:31] [INFO ] Invariant cache hit.
[2024-05-25 21:19:31] [INFO ] State equation strengthened by 248 read => feed constraints.
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) 159/161 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 872/1033 variables, 198/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 937/1970 variables, 1033/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1970 variables, 248/1481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1970/1970 variables, and 1481 constraints, problems are : Problem set: 0 solved, 1 unsolved in 773 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 159/161 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 872/1033 variables, 198/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 21:19:32] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 3 ms to minimize.
[2024-05-25 21:19:32] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1033 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 937/1970 variables, 1033/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 248/1483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1970 variables, 1/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1970 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1970 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1970/1970 variables, and 1484 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1123 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1914ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 122 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=40 )
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 p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 313 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 370 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 25 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2024-05-25 21:19:34] [INFO ] Invariant cache hit.
[2024-05-25 21:19:34] [INFO ] Implicit Places using invariants in 883 ms returned []
[2024-05-25 21:19:34] [INFO ] Invariant cache hit.
[2024-05-25 21:19:35] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 21:19:38] [INFO ] Implicit Places using invariants and state equation in 3751 ms returned []
Implicit Place search using SMT with State Equation took 4636 ms to find 0 implicit places.
Running 936 sub problems to find dead transitions.
[2024-05-25 21:19:38] [INFO ] Invariant cache hit.
[2024-05-25 21:19:38] [INFO ] State equation strengthened by 248 read => feed constraints.
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 30260ms, After SMT, problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 30271ms
Finished structural reductions in LTL mode , in 1 iterations and 34935 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 p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 117 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 292 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 624 ms. (64 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
[2024-05-25 21:20:09] [INFO ] Invariant cache hit.
[2024-05-25 21:20:09] [INFO ] State equation strengthened by 248 read => feed constraints.
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) 159/161 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 872/1033 variables, 198/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 937/1970 variables, 1033/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1970 variables, 248/1481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1970/1970 variables, and 1481 constraints, problems are : Problem set: 0 solved, 1 unsolved in 782 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 159/161 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 872/1033 variables, 198/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 21:20:10] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 3 ms to minimize.
[2024-05-25 21:20:10] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1033 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 937/1970 variables, 1033/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 248/1483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1970 variables, 1/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1970 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1970 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1970/1970 variables, and 1484 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1092 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1887ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 122 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=61 )
Parikh walk visited 1 properties in 3 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 p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 316 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 272 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 278 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 1288 reset in 1690 ms.
Product exploration explored 100000 steps with 1346 reset in 1825 ms.
Built C files in :
/tmp/ltsmin13515204064193601204
[2024-05-25 21:20:16] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13515204064193601204
Running compilation step : cd /tmp/ltsmin13515204064193601204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13515204064193601204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13515204064193601204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
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 27 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2024-05-25 21:20:19] [INFO ] Invariant cache hit.
[2024-05-25 21:20:20] [INFO ] Implicit Places using invariants in 759 ms returned []
[2024-05-25 21:20:20] [INFO ] Invariant cache hit.
[2024-05-25 21:20:20] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 21:20:24] [INFO ] Implicit Places using invariants and state equation in 3801 ms returned []
Implicit Place search using SMT with State Equation took 4566 ms to find 0 implicit places.
Running 936 sub problems to find dead transitions.
[2024-05-25 21:20:24] [INFO ] Invariant cache hit.
[2024-05-25 21:20:24] [INFO ] State equation strengthened by 248 read => feed constraints.
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 30301ms, After SMT, problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 30313ms
Finished structural reductions in LTL mode , in 1 iterations and 34911 ms. Remains : 1033/1033 places, 937/937 transitions.
Built C files in :
/tmp/ltsmin3612361212040845592
[2024-05-25 21:20:54] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3612361212040845592
Running compilation step : cd /tmp/ltsmin3612361212040845592;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3612361212040845592;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3612361212040845592;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-25 21:20:57] [INFO ] Flatten gal took : 48 ms
[2024-05-25 21:20:57] [INFO ] Flatten gal took : 38 ms
[2024-05-25 21:20:57] [INFO ] Time to serialize gal into /tmp/LTL9695589469266063238.gal : 9 ms
[2024-05-25 21:20:57] [INFO ] Time to serialize properties into /tmp/LTL859520657954578962.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9695589469266063238.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17804349385580822701.hoa' '-atoms' '/tmp/LTL859520657954578962.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL859520657954578962.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17804349385580822701.hoa
Detected timeout of ITS tools.
[2024-05-25 21:21:12] [INFO ] Flatten gal took : 34 ms
[2024-05-25 21:21:12] [INFO ] Flatten gal took : 33 ms
[2024-05-25 21:21:12] [INFO ] Time to serialize gal into /tmp/LTL15220672114562495826.gal : 7 ms
[2024-05-25 21:21:12] [INFO ] Time to serialize properties into /tmp/LTL10864743749465674610.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15220672114562495826.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10864743749465674610.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.202405141337/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.
[2024-05-25 21:21:27] [INFO ] Flatten gal took : 34 ms
[2024-05-25 21:21:27] [INFO ] Applying decomposition
[2024-05-25 21:21:27] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9276072788723934315.txt' '-o' '/tmp/graph9276072788723934315.bin' '-w' '/tmp/graph9276072788723934315.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9276072788723934315.bin' '-l' '-1' '-v' '-w' '/tmp/graph9276072788723934315.weights' '-q' '0' '-e' '0.001'
[2024-05-25 21:21:27] [INFO ] Decomposing Gal with order
[2024-05-25 21:21:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 21:21:27] [INFO ] Removed a total of 117 redundant transitions.
[2024-05-25 21:21:28] [INFO ] Flatten gal took : 76 ms
[2024-05-25 21:21:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2024-05-25 21:21:28] [INFO ] Time to serialize gal into /tmp/LTL17759639830177709611.gal : 14 ms
[2024-05-25 21:21:28] [INFO ] Time to serialize properties into /tmp/LTL9055852973693574626.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17759639830177709611.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9055852973693574626.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(i5.u150.p416==0)"))&&(G(("(i13.u317.p1009!=1)")&&(X(("(i13.u317.p1009!=1)")U((X("(i4.u106.p270!=1)"))||(G("(i13.u317.p1009...171
Formula 0 simplified : XG(X!"(i5.u150.p416==0)" | F(!"(i13.u317.p1009!=1)" | X(!"(i13.u317.p1009!=1)" M X!"(i4.u106.p270!=1)")))
Reverse transition relation is NOT exact ! Due to transitions i3.i1.i1.u94.t241, i4.u133.t207, i5.u171.t173, i8.u211.t139, i9.u251.t105, i11.u292.t71, i13....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 141815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p1))))))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 57 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2024-05-25 21:21:43] [INFO ] Computed 203 invariants in 8 ms
[2024-05-25 21:21:44] [INFO ] Implicit Places using invariants in 858 ms returned [195, 276, 1034]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 860 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1033 transition count 937
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1033 transition count 937
Applied a total of 6 rules in 53 ms. Remains 1033 /1036 variables (removed 3) and now considering 937/940 (removed 3) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-25 21:21:44] [INFO ] Computed 200 invariants in 3 ms
[2024-05-25 21:21:44] [INFO ] Implicit Places using invariants in 849 ms returned []
[2024-05-25 21:21:44] [INFO ] Invariant cache hit.
[2024-05-25 21:21:45] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 21:21:48] [INFO ] Implicit Places using invariants and state equation in 3594 ms returned []
Implicit Place search using SMT with State Equation took 4445 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5416 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 165 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 1214 steps with 4 reset in 17 ms.
FORMULA Parking-PT-864-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-15 finished in 5617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(!p1&&X((!p1 U (X(!p2)||G(!p1))))))))'
Found a Lengthening insensitive property : Parking-PT-864-LTLFireability-00
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Support contains 6 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1040/1040 places, 941/941 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 1040 transition count 909
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 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 64 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 128 place count 976 transition count 877
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 975 transition count 876
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 975 transition count 876
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 230 place count 925 transition count 826
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 231 place count 925 transition count 826
Applied a total of 231 rules in 121 ms. Remains 925 /1040 variables (removed 115) and now considering 826/941 (removed 115) transitions.
// Phase 1: matrix 826 rows 925 cols
[2024-05-25 21:21:49] [INFO ] Computed 203 invariants in 3 ms
[2024-05-25 21:21:50] [INFO ] Implicit Places using invariants in 783 ms returned [182, 258, 921]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 794 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 922/1040 places, 826/941 transitions.
Applied a total of 0 rules in 25 ms. Remains 922 /922 variables (removed 0) and now considering 826/826 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 941 ms. Remains : 922/1040 places, 826/941 transitions.
Running random walk in product with property : Parking-PT-864-LTLFireability-00
Product exploration explored 100000 steps with 394 reset in 1304 ms.
Product exploration explored 100000 steps with 395 reset in 1446 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) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 116 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
RANDOM walk for 40000 steps (156 resets) in 646 ms. (61 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 8/8 properties
// Phase 1: matrix 826 rows 922 cols
[2024-05-25 21:21:53] [INFO ] Computed 200 invariants in 2 ms
[2024-05-25 21:21:53] [INFO ] State equation strengthened by 344 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 136/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 780/922 variables, 195/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/922 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 826/1748 variables, 922/1122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1748 variables, 344/1466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1748 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/1748 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1748/1748 variables, and 1466 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1838 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 922/922 constraints, ReadFeed: 344/344 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 136/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 780/922 variables, 195/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/922 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 826/1748 variables, 922/1122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1748 variables, 344/1466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1748 variables, 8/1474 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1748 variables, 0/1474 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/1748 variables, 0/1474 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1748/1748 variables, and 1474 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2423 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 922/922 constraints, ReadFeed: 344/344 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 4281ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 6 properties in 2186 ms.
Support contains 6 out of 922 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 922/922 places, 826/826 transitions.
Free-agglomeration rule applied 260 times.
Iterating global reduction 0 with 260 rules applied. Total rules applied 260 place count 922 transition count 566
Reduce places removed 260 places and 0 transitions.
Graph (complete) has 1331 edges and 662 vertex of which 182 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 0 with 261 rules applied. Total rules applied 521 place count 182 transition count 170
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 545 place count 182 transition count 146
Applied a total of 545 rules in 51 ms. Remains 182 /922 variables (removed 740) and now considering 146/826 (removed 680) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 182/922 places, 146/826 transitions.
RANDOM walk for 40000 steps (397 resets) in 304 ms. (131 steps per ms) remains 1/2 properties
BEST_FIRST walk for 18659 steps (14 resets) in 31 ms. (583 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (OR p1 p0) (OR p1 (NOT p2))))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) p0))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (OR (NOT p1) p0) (OR (NOT p1) (NOT p2))))), (F p1), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 19 factoid took 471 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Support contains 6 out of 922 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 922/922 places, 826/826 transitions.
Applied a total of 0 rules in 18 ms. Remains 922 /922 variables (removed 0) and now considering 826/826 (removed 0) transitions.
[2024-05-25 21:22:01] [INFO ] Invariant cache hit.
[2024-05-25 21:22:02] [INFO ] Implicit Places using invariants in 924 ms returned []
[2024-05-25 21:22:02] [INFO ] Invariant cache hit.
[2024-05-25 21:22:02] [INFO ] State equation strengthened by 344 read => feed constraints.
[2024-05-25 21:22:05] [INFO ] Implicit Places using invariants and state equation in 3215 ms returned []
Implicit Place search using SMT with State Equation took 4144 ms to find 0 implicit places.
Running 825 sub problems to find dead transitions.
[2024-05-25 21:22:05] [INFO ] Invariant cache hit.
[2024-05-25 21:22:05] [INFO ] State equation strengthened by 344 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/921 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 1 (OVERLAPS) 1/922 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 825 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 922/1748 variables, and 200 constraints, problems are : Problem set: 0 solved, 825 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/922 constraints, ReadFeed: 0/344 constraints, PredecessorRefiner: 825/825 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 825 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/921 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 1 (OVERLAPS) 1/922 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/922 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 3 (OVERLAPS) 826/1748 variables, 922/1122 constraints. Problems are: Problem set: 0 solved, 825 unsolved
SMT process timed out in 60245ms, After SMT, problems are : Problem set: 0 solved, 825 unsolved
Search for dead transitions found 0 dead transitions in 60255ms
Finished structural reductions in LTL mode , in 1 iterations and 64421 ms. Remains : 922/922 places, 826/826 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 p1) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 151 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
RANDOM walk for 40000 steps (154 resets) in 1430 ms. (27 steps per ms) remains 5/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 5/5 properties
[2024-05-25 21:23:07] [INFO ] Invariant cache hit.
[2024-05-25 21:23:07] [INFO ] State equation strengthened by 344 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 136/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 780/922 variables, 195/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/922 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 826/1748 variables, 922/1122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1748 variables, 344/1466 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1748 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1748 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1748/1748 variables, and 1466 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1229 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 922/922 constraints, ReadFeed: 344/344 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 136/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 780/922 variables, 195/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/922 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 826/1748 variables, 922/1122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1748 variables, 344/1466 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1748 variables, 5/1471 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1748 variables, 0/1471 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/1748 variables, 0/1471 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1748/1748 variables, and 1471 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1522 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 922/922 constraints, ReadFeed: 344/344 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2785ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 10276 steps, including 48 resets, run visited all 5 properties in 290 ms. (steps per millisecond=35 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 291 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (OR p1 p0) (OR p1 (NOT p2))))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) p0))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (OR (NOT p1) p0) (OR (NOT p1) (NOT p2))))), (F p1), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 19 factoid took 461 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (OR (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Product exploration explored 100000 steps with 391 reset in 1335 ms.
Product exploration explored 100000 steps with 395 reset in 1483 ms.
Built C files in :
/tmp/ltsmin7230153015022652761
[2024-05-25 21:23:14] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7230153015022652761
Running compilation step : cd /tmp/ltsmin7230153015022652761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2976 ms.
Running link step : cd /tmp/ltsmin7230153015022652761;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin7230153015022652761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15150999700935584308.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 922 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 922/922 places, 826/826 transitions.
Applied a total of 0 rules in 23 ms. Remains 922 /922 variables (removed 0) and now considering 826/826 (removed 0) transitions.
[2024-05-25 21:23:29] [INFO ] Invariant cache hit.
[2024-05-25 21:23:30] [INFO ] Implicit Places using invariants in 899 ms returned []
[2024-05-25 21:23:30] [INFO ] Invariant cache hit.
[2024-05-25 21:23:30] [INFO ] State equation strengthened by 344 read => feed constraints.
[2024-05-25 21:23:33] [INFO ] Implicit Places using invariants and state equation in 3328 ms returned []
Implicit Place search using SMT with State Equation took 4236 ms to find 0 implicit places.
Running 825 sub problems to find dead transitions.
[2024-05-25 21:23:33] [INFO ] Invariant cache hit.
[2024-05-25 21:23:33] [INFO ] State equation strengthened by 344 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/921 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 1 (OVERLAPS) 1/922 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 825 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 922/1748 variables, and 200 constraints, problems are : Problem set: 0 solved, 825 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/922 constraints, ReadFeed: 0/344 constraints, PredecessorRefiner: 825/825 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 825 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/921 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 1 (OVERLAPS) 1/922 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/922 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 3 (OVERLAPS) 826/1748 variables, 922/1122 constraints. Problems are: Problem set: 0 solved, 825 unsolved
SMT process timed out in 60286ms, After SMT, problems are : Problem set: 0 solved, 825 unsolved
Search for dead transitions found 0 dead transitions in 60296ms
Finished structural reductions in LTL mode , in 1 iterations and 64559 ms. Remains : 922/922 places, 826/826 transitions.
Built C files in :
/tmp/ltsmin12915159017260647346
[2024-05-25 21:24:33] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12915159017260647346
Running compilation step : cd /tmp/ltsmin12915159017260647346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2947 ms.
Running link step : cd /tmp/ltsmin12915159017260647346;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin12915159017260647346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13746366640852901544.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 21:24:49] [INFO ] Flatten gal took : 32 ms
[2024-05-25 21:24:49] [INFO ] Flatten gal took : 30 ms
[2024-05-25 21:24:49] [INFO ] Time to serialize gal into /tmp/LTL9755260700630956769.gal : 5 ms
[2024-05-25 21:24:49] [INFO ] Time to serialize properties into /tmp/LTL3122856396949762196.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9755260700630956769.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17875297180018372600.hoa' '-atoms' '/tmp/LTL3122856396949762196.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3122856396949762196.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17875297180018372600.hoa
Detected timeout of ITS tools.
[2024-05-25 21:25:04] [INFO ] Flatten gal took : 26 ms
[2024-05-25 21:25:04] [INFO ] Flatten gal took : 25 ms
[2024-05-25 21:25:04] [INFO ] Time to serialize gal into /tmp/LTL13843770414395631763.gal : 5 ms
[2024-05-25 21:25:04] [INFO ] Time to serialize properties into /tmp/LTL11811690806718369433.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13843770414395631763.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11811690806718369433.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((X("((p394==0)||(p438==0))"))||((X((!("((p130==1)&&(p179==1))"))U((X(!("((p399==1)&&(p451==1))")))||(G(!("((p130==1)&&(p179==1))"...193
Formula 0 simplified : F(X!"((p394==0)||(p438==0))" & (!"((p130!=1)||(p179!=1))" | X("((p130==1)&&(p179==1))" M X"((p399==1)&&(p451==1))")))
Detected timeout of ITS tools.
[2024-05-25 21:25:19] [INFO ] Flatten gal took : 26 ms
[2024-05-25 21:25:19] [INFO ] Applying decomposition
[2024-05-25 21:25:19] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2667492595387215302.txt' '-o' '/tmp/graph2667492595387215302.bin' '-w' '/tmp/graph2667492595387215302.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2667492595387215302.bin' '-l' '-1' '-v' '-w' '/tmp/graph2667492595387215302.weights' '-q' '0' '-e' '0.001'
[2024-05-25 21:25:19] [INFO ] Decomposing Gal with order
[2024-05-25 21:25:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 21:25:19] [INFO ] Removed a total of 248 redundant transitions.
[2024-05-25 21:25:19] [INFO ] Flatten gal took : 51 ms
[2024-05-25 21:25:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 34 ms.
[2024-05-25 21:25:19] [INFO ] Time to serialize gal into /tmp/LTL10386124322281799714.gal : 12 ms
[2024-05-25 21:25:19] [INFO ] Time to serialize properties into /tmp/LTL1087878978190862257.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10386124322281799714.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1087878978190862257.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X("((i6.u140.p394==0)||(i6.u153.p438==0))"))||((X((!("((i2.u64.p130==1)&&(i2.u76.p179==1))"))U((X(!("((i6.u143.p399==1)&&(i6.u17...267
Formula 0 simplified : F(X!"((i6.u140.p394==0)||(i6.u153.p438==0))" & (!"((i2.u64.p130!=1)||(i2.u76.p179!=1))" | X("((i2.u64.p130==1)&&(i2.u76.p179==1))" M...200
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-00 finished in 225916 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(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 290 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 1040 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1040/1040 places, 941/941 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 1040 transition count 910
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 1009 transition count 909
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 1008 transition count 909
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 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 3 with 62 rules applied. Total rules applied 126 place count 977 transition count 878
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 976 transition count 877
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 976 transition count 877
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 228 place count 926 transition count 827
Applied a total of 228 rules in 153 ms. Remains 926 /1040 variables (removed 114) and now considering 827/941 (removed 114) transitions.
// Phase 1: matrix 827 rows 926 cols
[2024-05-25 21:25:35] [INFO ] Computed 203 invariants in 3 ms
[2024-05-25 21:25:36] [INFO ] Implicit Places using invariants in 933 ms returned [181, 257, 922]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 935 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 923/1040 places, 827/941 transitions.
Applied a total of 0 rules in 27 ms. Remains 923 /923 variables (removed 0) and now considering 827/827 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1123 ms. Remains : 923/1040 places, 827/941 transitions.
Running random walk in product with property : Parking-PT-864-LTLFireability-14
Product exploration explored 100000 steps with 1386 reset in 1674 ms.
Product exploration explored 100000 steps with 1338 reset in 1784 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 p0)), (X (X p1))]
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 279 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 724 ms. (55 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
// Phase 1: matrix 827 rows 923 cols
[2024-05-25 21:25:40] [INFO ] Computed 200 invariants in 2 ms
[2024-05-25 21:25:40] [INFO ] State equation strengthened by 343 read => feed constraints.
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) 827/1750 variables, 923/1123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1750 variables, 343/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1750 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1750 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1750/1750 variables, and 1466 constraints, problems are : Problem set: 0 solved, 1 unsolved in 901 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]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 827/1750 variables, 923/1123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1750 variables, 343/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1750 variables, 1/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1750 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1750 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1750/1750 variables, and 1467 constraints, problems are : Problem set: 0 solved, 1 unsolved in 983 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]
After SMT, in 1921ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 113 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=56 )
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 p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 321 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 358 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 310 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, 827/827 transitions.
Applied a total of 0 rules in 19 ms. Remains 923 /923 variables (removed 0) and now considering 827/827 (removed 0) transitions.
[2024-05-25 21:25:43] [INFO ] Invariant cache hit.
[2024-05-25 21:25:44] [INFO ] Implicit Places using invariants in 871 ms returned []
[2024-05-25 21:25:44] [INFO ] Invariant cache hit.
[2024-05-25 21:25:44] [INFO ] State equation strengthened by 343 read => feed constraints.
[2024-05-25 21:25:48] [INFO ] Implicit Places using invariants and state equation in 3984 ms returned []
Implicit Place search using SMT with State Equation took 4859 ms to find 0 implicit places.
Running 826 sub problems to find dead transitions.
[2024-05-25 21:25:48] [INFO ] Invariant cache hit.
[2024-05-25 21:25:48] [INFO ] State equation strengthened by 343 read => feed constraints.
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/1750 variables, and 200 constraints, problems are : Problem set: 0 solved, 826 unsolved in 30032 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]
Escalating to Integer solving :Problem set: 0 solved, 826 unsolved
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
At refinement iteration 2 (INCLUDED_ONLY) 0/923 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 826 unsolved
SMT process timed out in 60243ms, After SMT, problems are : Problem set: 0 solved, 826 unsolved
Search for dead transitions found 0 dead transitions in 60253ms
Finished structural reductions in LTL mode , in 1 iterations and 65133 ms. Remains : 923/923 places, 827/827 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 p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 124 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 284 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 (155 resets) in 1680 ms. (23 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
[2024-05-25 21:26:49] [INFO ] Invariant cache hit.
[2024-05-25 21:26:49] [INFO ] State equation strengthened by 343 read => feed constraints.
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) 827/1750 variables, 923/1123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1750 variables, 343/1466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1750 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1750 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1750/1750 variables, and 1466 constraints, problems are : Problem set: 0 solved, 2 unsolved in 950 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]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 827/1750 variables, 923/1123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1750 variables, 343/1466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1750 variables, 2/1468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1750 variables, 0/1468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1750 variables, 0/1468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1750/1750 variables, and 1468 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1207 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]
After SMT, in 2211ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 208 steps, including 0 resets, run visited all 2 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 )
Parikh walk visited 2 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 p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 319 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 278 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 319 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 299 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 1382 reset in 1658 ms.
Product exploration explored 100000 steps with 1323 reset in 1787 ms.
Built C files in :
/tmp/ltsmin4397367762039906815
[2024-05-25 21:26:56] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4397367762039906815
Running compilation step : cd /tmp/ltsmin4397367762039906815;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2896 ms.
Running link step : cd /tmp/ltsmin4397367762039906815;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin4397367762039906815;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4427754350940246044.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, 827/827 transitions.
Applied a total of 0 rules in 19 ms. Remains 923 /923 variables (removed 0) and now considering 827/827 (removed 0) transitions.
[2024-05-25 21:27:11] [INFO ] Invariant cache hit.
[2024-05-25 21:27:12] [INFO ] Implicit Places using invariants in 854 ms returned []
[2024-05-25 21:27:12] [INFO ] Invariant cache hit.
[2024-05-25 21:27:13] [INFO ] State equation strengthened by 343 read => feed constraints.
[2024-05-25 21:27:16] [INFO ] Implicit Places using invariants and state equation in 3746 ms returned []
Implicit Place search using SMT with State Equation took 4610 ms to find 0 implicit places.
Running 826 sub problems to find dead transitions.
[2024-05-25 21:27:16] [INFO ] Invariant cache hit.
[2024-05-25 21:27:16] [INFO ] State equation strengthened by 343 read => feed constraints.
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/1750 variables, and 200 constraints, problems are : Problem set: 0 solved, 826 unsolved in 30022 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]
Escalating to Integer solving :Problem set: 0 solved, 826 unsolved
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
At refinement iteration 2 (INCLUDED_ONLY) 0/923 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 826 unsolved
At refinement iteration 3 (OVERLAPS) 827/1750 variables, 923/1123 constraints. Problems are: Problem set: 0 solved, 826 unsolved
SMT process timed out in 60247ms, After SMT, problems are : Problem set: 0 solved, 826 unsolved
Search for dead transitions found 0 dead transitions in 60256ms
Finished structural reductions in LTL mode , in 1 iterations and 64890 ms. Remains : 923/923 places, 827/827 transitions.
Built C files in :
/tmp/ltsmin16098241260055919644
[2024-05-25 21:28:16] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16098241260055919644
Running compilation step : cd /tmp/ltsmin16098241260055919644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16098241260055919644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16098241260055919644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-25 21:28:19] [INFO ] Flatten gal took : 26 ms
[2024-05-25 21:28:19] [INFO ] Flatten gal took : 28 ms
[2024-05-25 21:28:19] [INFO ] Time to serialize gal into /tmp/LTL9961787775344852233.gal : 4 ms
[2024-05-25 21:28:19] [INFO ] Time to serialize properties into /tmp/LTL12678555350804119946.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9961787775344852233.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14559831904683105036.hoa' '-atoms' '/tmp/LTL12678555350804119946.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12678555350804119946.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14559831904683105036.hoa
Detected timeout of ITS tools.
[2024-05-25 21:28:34] [INFO ] Flatten gal took : 25 ms
[2024-05-25 21:28:34] [INFO ] Flatten gal took : 24 ms
[2024-05-25 21:28:34] [INFO ] Time to serialize gal into /tmp/LTL13353008984139989953.gal : 4 ms
[2024-05-25 21:28:34] [INFO ] Time to serialize properties into /tmp/LTL18079107387562530222.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13353008984139989953.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18079107387562530222.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.202405141337/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.
[2024-05-25 21:28:49] [INFO ] Flatten gal took : 25 ms
[2024-05-25 21:28:49] [INFO ] Applying decomposition
[2024-05-25 21:28:49] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4721927471865913861.txt' '-o' '/tmp/graph4721927471865913861.bin' '-w' '/tmp/graph4721927471865913861.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4721927471865913861.bin' '-l' '-1' '-v' '-w' '/tmp/graph4721927471865913861.weights' '-q' '0' '-e' '0.001'
[2024-05-25 21:28:49] [INFO ] Decomposing Gal with order
[2024-05-25 21:28:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 21:28:50] [INFO ] Removed a total of 247 redundant transitions.
[2024-05-25 21:28:50] [INFO ] Flatten gal took : 45 ms
[2024-05-25 21:28:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 18 ms.
[2024-05-25 21:28:50] [INFO ] Time to serialize gal into /tmp/LTL18226244519650427542.gal : 12 ms
[2024-05-25 21:28:50] [INFO ] Time to serialize properties into /tmp/LTL14257088899490774620.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18226244519650427542.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14257088899490774620.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(i7.u147.p416==0)"))&&(G(("(i12.u306.p1009!=1)")&&(X(("(i12.u306.p1009!=1)")U((X("(i6.u105.p270!=1)"))||(G("(i12.u306.p1009...171
Formula 0 simplified : XG(X!"(i7.u147.p416==0)" | F(!"(i12.u306.p1009!=1)" | X(!"(i12.u306.p1009!=1)" M X!"(i6.u105.p270!=1)")))
Detected timeout of ITS tools.
Treatment of property Parking-PT-864-LTLFireability-14 finished in 210477 ms.
[2024-05-25 21:29:05] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7105764708633823354
[2024-05-25 21:29:05] [INFO ] Computing symmetric may disable matrix : 941 transitions.
[2024-05-25 21:29:05] [INFO ] Applying decomposition
[2024-05-25 21:29:05] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:29:05] [INFO ] Flatten gal took : 27 ms
[2024-05-25 21:29:05] [INFO ] Computing symmetric may enable matrix : 941 transitions.
[2024-05-25 21:29:05] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5220354012397235523.txt' '-o' '/tmp/graph5220354012397235523.bin' '-w' '/tmp/graph5220354012397235523.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5220354012397235523.bin' '-l' '-1' '-v' '-w' '/tmp/graph5220354012397235523.weights' '-q' '0' '-e' '0.001'
[2024-05-25 21:29:05] [INFO ] Decomposing Gal with order
[2024-05-25 21:29:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 21:29:05] [INFO ] Removed a total of 119 redundant transitions.
[2024-05-25 21:29:05] [INFO ] Computing Do-Not-Accords matrix : 941 transitions.
[2024-05-25 21:29:05] [INFO ] Flatten gal took : 49 ms
[2024-05-25 21:29:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-25 21:29:05] [INFO ] Computation of Completed DNA matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:29:05] [INFO ] Time to serialize gal into /tmp/LTLFireability5487756322098966556.gal : 13 ms
[2024-05-25 21:29:05] [INFO ] Time to serialize properties into /tmp/LTLFireability3352412030369748685.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5487756322098966556.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3352412030369748685.ltl' '-c' '-stutter-deadlock'
[2024-05-25 21:29:05] [INFO ] Built C files in 268ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7105764708633823354
Running compilation step : cd /tmp/ltsmin7105764708633823354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((G((X("((i6.u143.p394==0)||(i6.u153.p438==0))"))||((!("((i3.u64.p130==1)&&(i3.u77.p179==1))"))&&(X((!("((i3.u64.p130==1)&&(i3.u77.p1...270
Formula 0 simplified : F(X!"((i6.u143.p394==0)||(i6.u153.p438==0))" & ("((i3.u64.p130==1)&&(i3.u77.p179==1))" | X("((i3.u64.p130==1)&&(i3.u77.p179==1))" M ...199
Compilation finished in 5602 ms.
Running link step : cd /tmp/ltsmin7105764708633823354;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin7105764708633823354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp0==true))||(!(LTLAPp1==true)&&X((!(LTLAPp1==true) U (X(!(LTLAPp2==true))||[](!(LTLAPp1==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions i3.u96.t241, i5.u136.t207, i6.u175.t173, i7.u215.t139, i8.u254.t105, i9.u293.t71, i11.t635, i...365
Computing Next relation with stutter on 5.35201e+12 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
30321 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,303.393,3601600,1,0,7.93958e+06,18831,6289,2.02176e+07,455,80183,273269
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-864-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(F((X("(i6.u154.p416==0)"))&&(G(("(i11.u317.p1009!=1)")&&(X(("(i11.u317.p1009!=1)")U((X("(i5.u108.p270!=1)"))||(G("(i11.u317.p1009...171
Formula 1 simplified : XG(X!"(i6.u154.p416==0)" | F(!"(i11.u317.p1009!=1)" | X(!"(i11.u317.p1009!=1)" M X!"(i5.u108.p270!=1)")))
Computing Next relation with stutter on 5.35201e+12 deadlock states
7 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
4487 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,348.259,3603424,1,0,7.93958e+06,19114,7706,2.02176e+07,509,83773,1611692
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Parking-PT-864-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1691465 ms.
BK_STOP 1716673353036
--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-5568"
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 r268-smll-171654406900100"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;