About the Execution of LTSMin+red for CANConstruction-PT-050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7715.144 | 3600000.00 | 7721774.00 | 5747.90 | FFF?FFFFF?FFFFFT | 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.r476-tall-171620505000044.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CANConstruction-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505000044
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 8.8K 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.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 19:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 19:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.8M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CANConstruction-PT-050-LTLFireability-00
FORMULA_NAME CANConstruction-PT-050-LTLFireability-01
FORMULA_NAME CANConstruction-PT-050-LTLFireability-02
FORMULA_NAME CANConstruction-PT-050-LTLFireability-03
FORMULA_NAME CANConstruction-PT-050-LTLFireability-04
FORMULA_NAME CANConstruction-PT-050-LTLFireability-05
FORMULA_NAME CANConstruction-PT-050-LTLFireability-06
FORMULA_NAME CANConstruction-PT-050-LTLFireability-07
FORMULA_NAME CANConstruction-PT-050-LTLFireability-08
FORMULA_NAME CANConstruction-PT-050-LTLFireability-09
FORMULA_NAME CANConstruction-PT-050-LTLFireability-10
FORMULA_NAME CANConstruction-PT-050-LTLFireability-11
FORMULA_NAME CANConstruction-PT-050-LTLFireability-12
FORMULA_NAME CANConstruction-PT-050-LTLFireability-13
FORMULA_NAME CANConstruction-PT-050-LTLFireability-14
FORMULA_NAME CANConstruction-PT-050-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717179154175
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:12:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 18:12:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:12:35] [INFO ] Load time of PNML (sax parser for PT used): 367 ms
[2024-05-31 18:12:35] [INFO ] Transformed 5602 places.
[2024-05-31 18:12:35] [INFO ] Transformed 10400 transitions.
[2024-05-31 18:12:35] [INFO ] Parsed PT model containing 5602 places and 10400 transitions and 31000 arcs in 507 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-050-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 5602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5602/5602 places, 10400/10400 transitions.
Discarding 2387 places :
Symmetric choice reduction at 0 with 2387 rule applications. Total rules 2387 place count 3215 transition count 5626
Iterating global reduction 0 with 2387 rules applied. Total rules applied 4774 place count 3215 transition count 5626
Applied a total of 4774 rules in 818 ms. Remains 3215 /5602 variables (removed 2387) and now considering 5626/10400 (removed 4774) transitions.
// Phase 1: matrix 5626 rows 3215 cols
[2024-05-31 18:12:37] [INFO ] Computed 101 invariants in 76 ms
[2024-05-31 18:12:39] [INFO ] Implicit Places using invariants in 2380 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418, 432, 446, 460, 474, 488, 502, 516, 530, 544, 558, 572, 586, 600, 614, 628, 642, 656, 670, 684, 698]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 2416 ms to find 50 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3165/5602 places, 5626/10400 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 3115 transition count 5576
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 3115 transition count 5576
Applied a total of 100 rules in 831 ms. Remains 3115 /3165 variables (removed 50) and now considering 5576/5626 (removed 50) transitions.
// Phase 1: matrix 5576 rows 3115 cols
[2024-05-31 18:12:40] [INFO ] Computed 51 invariants in 43 ms
[2024-05-31 18:12:41] [INFO ] Implicit Places using invariants in 1716 ms returned []
[2024-05-31 18:12:41] [INFO ] Invariant cache hit.
[2024-05-31 18:12:43] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-31 18:13:14] [INFO ] Performed 1610/3115 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:13:44] [INFO ] Performed 2710/3115 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 18:13:53] [INFO ] Implicit Places using invariants and state equation in 71984 ms returned []
Implicit Place search using SMT with State Equation took 73702 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3115/5602 places, 5576/10400 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77799 ms. Remains : 3115/5602 places, 5576/10400 transitions.
Support contains 34 out of 3115 places after structural reductions.
[2024-05-31 18:13:54] [INFO ] Flatten gal took : 280 ms
[2024-05-31 18:13:54] [INFO ] Flatten gal took : 193 ms
[2024-05-31 18:13:55] [INFO ] Input system was already deterministic with 5576 transitions.
Support contains 33 out of 3115 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (43 resets) in 2506 ms. (15 steps per ms) remains 5/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
[2024-05-31 18:13:56] [INFO ] Invariant cache hit.
[2024-05-31 18:13:56] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 3063/3071 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 18:13:59] [INFO ] Deduced a trap composed of 5 places in 2749 ms of which 31 ms to minimize.
[2024-05-31 18:13:59] [INFO ] Deduced a trap composed of 62 places in 173 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3071 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 18:14:00] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3071 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3071 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 43/3114 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 18:14:03] [INFO ] Deduced a trap composed of 66 places in 2895 ms of which 22 ms to minimize.
SMT process timed out in 7927ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 3115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 337 place count 3115 transition count 5239
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 1 with 337 rules applied. Total rules applied 674 place count 2778 transition count 5239
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 674 place count 2778 transition count 5189
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 774 place count 2728 transition count 5189
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 783 place count 2719 transition count 5171
Iterating global reduction 2 with 9 rules applied. Total rules applied 792 place count 2719 transition count 5171
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 9 rules applied. Total rules applied 801 place count 2719 transition count 5162
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 810 place count 2710 transition count 5162
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 914 place count 2658 transition count 5110
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 916 place count 2658 transition count 5108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 918 place count 2656 transition count 5108
Applied a total of 918 rules in 1274 ms. Remains 2656 /3115 variables (removed 459) and now considering 5108/5576 (removed 468) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1275 ms. Remains : 2656/3115 places, 5108/5576 transitions.
RANDOM walk for 40000 steps (114 resets) in 856 ms. (46 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
// Phase 1: matrix 5108 rows 2656 cols
[2024-05-31 18:14:05] [INFO ] Computed 51 invariants in 54 ms
[2024-05-31 18:14:05] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2605/2608 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:14:08] [INFO ] Deduced a trap composed of 2 places in 2029 ms of which 15 ms to minimize.
[2024-05-31 18:14:10] [INFO ] Deduced a trap composed of 2 places in 2177 ms of which 18 ms to minimize.
[2024-05-31 18:14:12] [INFO ] Deduced a trap composed of 2 places in 2239 ms of which 15 ms to minimize.
[2024-05-31 18:14:14] [INFO ] Deduced a trap composed of 2 places in 2120 ms of which 26 ms to minimize.
[2024-05-31 18:14:17] [INFO ] Deduced a trap composed of 2 places in 2222 ms of which 17 ms to minimize.
[2024-05-31 18:14:19] [INFO ] Deduced a trap composed of 2 places in 2337 ms of which 22 ms to minimize.
[2024-05-31 18:14:21] [INFO ] Deduced a trap composed of 2 places in 2295 ms of which 15 ms to minimize.
[2024-05-31 18:14:23] [INFO ] Deduced a trap composed of 2 places in 2194 ms of which 17 ms to minimize.
[2024-05-31 18:14:26] [INFO ] Deduced a trap composed of 2 places in 2210 ms of which 16 ms to minimize.
[2024-05-31 18:14:28] [INFO ] Deduced a trap composed of 2 places in 2217 ms of which 16 ms to minimize.
[2024-05-31 18:14:30] [INFO ] Deduced a trap composed of 2 places in 2093 ms of which 16 ms to minimize.
[2024-05-31 18:14:32] [INFO ] Deduced a trap composed of 2 places in 2158 ms of which 15 ms to minimize.
[2024-05-31 18:14:35] [INFO ] Deduced a trap composed of 2 places in 2208 ms of which 15 ms to minimize.
[2024-05-31 18:14:37] [INFO ] Deduced a trap composed of 2 places in 2161 ms of which 15 ms to minimize.
[2024-05-31 18:14:39] [INFO ] Deduced a trap composed of 2 places in 2144 ms of which 16 ms to minimize.
[2024-05-31 18:14:41] [INFO ] Deduced a trap composed of 2 places in 2137 ms of which 16 ms to minimize.
[2024-05-31 18:14:43] [INFO ] Deduced a trap composed of 2 places in 2257 ms of which 15 ms to minimize.
[2024-05-31 18:14:46] [INFO ] Deduced a trap composed of 2 places in 2128 ms of which 15 ms to minimize.
[2024-05-31 18:14:48] [INFO ] Deduced a trap composed of 2 places in 2176 ms of which 17 ms to minimize.
[2024-05-31 18:14:50] [INFO ] Deduced a trap composed of 2 places in 2185 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2608 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:14:52] [INFO ] Deduced a trap composed of 2 places in 2063 ms of which 16 ms to minimize.
SMT process timed out in 47046ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 2656 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2656/2656 places, 5108/5108 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2653 transition count 5102
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2653 transition count 5102
Applied a total of 6 rules in 428 ms. Remains 2653 /2656 variables (removed 3) and now considering 5102/5108 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 429 ms. Remains : 2653/2656 places, 5102/5108 transitions.
RANDOM walk for 40000 steps (115 resets) in 509 ms. (78 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 76443 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 1
Probabilistic random walk after 76443 steps, saw 27724 distinct states, run finished after 3005 ms. (steps per millisecond=25 ) properties seen :0
// Phase 1: matrix 5102 rows 2653 cols
[2024-05-31 18:14:56] [INFO ] Computed 51 invariants in 59 ms
[2024-05-31 18:14:56] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2602/2605 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:14:58] [INFO ] Deduced a trap composed of 2 places in 2097 ms of which 14 ms to minimize.
[2024-05-31 18:15:01] [INFO ] Deduced a trap composed of 2 places in 2266 ms of which 17 ms to minimize.
[2024-05-31 18:15:03] [INFO ] Deduced a trap composed of 2 places in 2058 ms of which 16 ms to minimize.
[2024-05-31 18:15:05] [INFO ] Deduced a trap composed of 2 places in 2082 ms of which 14 ms to minimize.
[2024-05-31 18:15:07] [INFO ] Deduced a trap composed of 2 places in 2103 ms of which 17 ms to minimize.
[2024-05-31 18:15:09] [INFO ] Deduced a trap composed of 2 places in 2273 ms of which 15 ms to minimize.
[2024-05-31 18:15:11] [INFO ] Deduced a trap composed of 2 places in 2153 ms of which 17 ms to minimize.
[2024-05-31 18:15:14] [INFO ] Deduced a trap composed of 2 places in 2089 ms of which 16 ms to minimize.
[2024-05-31 18:15:16] [INFO ] Deduced a trap composed of 2 places in 2170 ms of which 16 ms to minimize.
[2024-05-31 18:15:18] [INFO ] Deduced a trap composed of 2 places in 2228 ms of which 17 ms to minimize.
[2024-05-31 18:15:20] [INFO ] Deduced a trap composed of 2 places in 2183 ms of which 16 ms to minimize.
[2024-05-31 18:15:22] [INFO ] Deduced a trap composed of 2 places in 2080 ms of which 17 ms to minimize.
[2024-05-31 18:15:25] [INFO ] Deduced a trap composed of 2 places in 2121 ms of which 16 ms to minimize.
[2024-05-31 18:15:27] [INFO ] Deduced a trap composed of 2 places in 2231 ms of which 16 ms to minimize.
[2024-05-31 18:15:29] [INFO ] Deduced a trap composed of 2 places in 2201 ms of which 16 ms to minimize.
[2024-05-31 18:15:31] [INFO ] Deduced a trap composed of 2 places in 2150 ms of which 19 ms to minimize.
[2024-05-31 18:15:34] [INFO ] Deduced a trap composed of 2 places in 2224 ms of which 17 ms to minimize.
[2024-05-31 18:15:36] [INFO ] Deduced a trap composed of 2 places in 2124 ms of which 15 ms to minimize.
[2024-05-31 18:15:38] [INFO ] Deduced a trap composed of 2 places in 2192 ms of which 16 ms to minimize.
[2024-05-31 18:15:40] [INFO ] Deduced a trap composed of 2 places in 2180 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2605 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:15:42] [INFO ] Deduced a trap composed of 2 places in 2045 ms of which 15 ms to minimize.
[2024-05-31 18:15:44] [INFO ] Deduced a trap composed of 2 places in 2138 ms of which 16 ms to minimize.
[2024-05-31 18:15:46] [INFO ] Deduced a trap composed of 2 places in 2007 ms of which 14 ms to minimize.
[2024-05-31 18:15:49] [INFO ] Deduced a trap composed of 2 places in 2243 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2605 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2605 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 47/2652 variables, 47/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:15:52] [INFO ] Deduced a trap composed of 53 places in 2595 ms of which 19 ms to minimize.
[2024-05-31 18:15:54] [INFO ] Deduced a trap composed of 58 places in 2670 ms of which 18 ms to minimize.
[2024-05-31 18:15:57] [INFO ] Deduced a trap composed of 53 places in 2577 ms of which 19 ms to minimize.
[2024-05-31 18:16:00] [INFO ] Deduced a trap composed of 56 places in 2647 ms of which 17 ms to minimize.
[2024-05-31 18:16:02] [INFO ] Deduced a trap composed of 53 places in 2584 ms of which 18 ms to minimize.
[2024-05-31 18:16:05] [INFO ] Deduced a trap composed of 55 places in 2670 ms of which 17 ms to minimize.
[2024-05-31 18:16:08] [INFO ] Deduced a trap composed of 53 places in 2535 ms of which 17 ms to minimize.
[2024-05-31 18:16:10] [INFO ] Deduced a trap composed of 53 places in 2548 ms of which 20 ms to minimize.
[2024-05-31 18:16:13] [INFO ] Deduced a trap composed of 53 places in 2610 ms of which 20 ms to minimize.
SMT process timed out in 77002ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 2653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2653/2653 places, 5102/5102 transitions.
Applied a total of 0 rules in 253 ms. Remains 2653 /2653 variables (removed 0) and now considering 5102/5102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 2653/2653 places, 5102/5102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2653/2653 places, 5102/5102 transitions.
Applied a total of 0 rules in 236 ms. Remains 2653 /2653 variables (removed 0) and now considering 5102/5102 (removed 0) transitions.
[2024-05-31 18:16:13] [INFO ] Invariant cache hit.
[2024-05-31 18:16:15] [INFO ] Implicit Places using invariants in 1866 ms returned []
[2024-05-31 18:16:15] [INFO ] Invariant cache hit.
[2024-05-31 18:16:17] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-31 18:16:47] [INFO ] Performed 1570/2653 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:17:13] [INFO ] Implicit Places using invariants and state equation in 58031 ms returned []
Implicit Place search using SMT with State Equation took 59901 ms to find 0 implicit places.
[2024-05-31 18:17:14] [INFO ] Redundant transitions in 384 ms returned []
Running 5052 sub problems to find dead transitions.
[2024-05-31 18:17:14] [INFO ] Invariant cache hit.
[2024-05-31 18:17:14] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2652 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5052 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2652/7755 variables, and 51 constraints, problems are : Problem set: 0 solved, 5052 unsolved in 30107 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/2653 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5052/5052 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5052 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2652 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5052 unsolved
[2024-05-31 18:17:53] [INFO ] Deduced a trap composed of 53 places in 1406 ms of which 18 ms to minimize.
[2024-05-31 18:17:58] [INFO ] Deduced a trap composed of 53 places in 2610 ms of which 18 ms to minimize.
[2024-05-31 18:18:01] [INFO ] Deduced a trap composed of 53 places in 2600 ms of which 18 ms to minimize.
[2024-05-31 18:18:03] [INFO ] Deduced a trap composed of 53 places in 2658 ms of which 17 ms to minimize.
[2024-05-31 18:18:06] [INFO ] Deduced a trap composed of 53 places in 2357 ms of which 17 ms to minimize.
[2024-05-31 18:18:09] [INFO ] Deduced a trap composed of 53 places in 2673 ms of which 18 ms to minimize.
[2024-05-31 18:18:11] [INFO ] Deduced a trap composed of 53 places in 2582 ms of which 18 ms to minimize.
[2024-05-31 18:18:16] [INFO ] Deduced a trap composed of 53 places in 1692 ms of which 17 ms to minimize.
[2024-05-31 18:18:18] [INFO ] Deduced a trap composed of 53 places in 1644 ms of which 16 ms to minimize.
[2024-05-31 18:18:20] [INFO ] Deduced a trap composed of 53 places in 1683 ms of which 16 ms to minimize.
SMT process timed out in 65910ms, After SMT, problems are : Problem set: 0 solved, 5052 unsolved
Search for dead transitions found 0 dead transitions in 65978ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126543 ms. Remains : 2653/2653 places, 5102/5102 transitions.
Computed a total of 151 stabilizing places and 200 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)||p0)) U !F((F(X(p1)) U !p2))))'
Support contains 5 out of 3115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 3115 transition count 5240
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 1 with 336 rules applied. Total rules applied 672 place count 2779 transition count 5240
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 672 place count 2779 transition count 5190
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 772 place count 2729 transition count 5190
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 784 place count 2717 transition count 5166
Iterating global reduction 2 with 12 rules applied. Total rules applied 796 place count 2717 transition count 5166
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 808 place count 2717 transition count 5154
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 820 place count 2705 transition count 5154
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 918 place count 2656 transition count 5105
Applied a total of 918 rules in 922 ms. Remains 2656 /3115 variables (removed 459) and now considering 5105/5576 (removed 471) transitions.
// Phase 1: matrix 5105 rows 2656 cols
[2024-05-31 18:18:21] [INFO ] Computed 51 invariants in 62 ms
[2024-05-31 18:18:22] [INFO ] Implicit Places using invariants in 1654 ms returned []
[2024-05-31 18:18:22] [INFO ] Invariant cache hit.
[2024-05-31 18:18:24] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-31 18:18:55] [INFO ] Performed 1666/2656 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:19:14] [INFO ] Implicit Places using invariants and state equation in 51083 ms returned []
Implicit Place search using SMT with State Equation took 52739 ms to find 0 implicit places.
[2024-05-31 18:19:14] [INFO ] Redundant transitions in 210 ms returned []
Running 5055 sub problems to find dead transitions.
[2024-05-31 18:19:14] [INFO ] Invariant cache hit.
[2024-05-31 18:19:14] [INFO ] State equation strengthened by 4950 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2655 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5055 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2655/7761 variables, and 51 constraints, problems are : Problem set: 0 solved, 5055 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/2656 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5055/5055 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5055 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2655 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5055 unsolved
[2024-05-31 18:19:53] [INFO ] Deduced a trap composed of 53 places in 1307 ms of which 17 ms to minimize.
[2024-05-31 18:19:58] [INFO ] Deduced a trap composed of 53 places in 2544 ms of which 18 ms to minimize.
[2024-05-31 18:20:01] [INFO ] Deduced a trap composed of 53 places in 2449 ms of which 16 ms to minimize.
[2024-05-31 18:20:03] [INFO ] Deduced a trap composed of 53 places in 2546 ms of which 20 ms to minimize.
[2024-05-31 18:20:06] [INFO ] Deduced a trap composed of 53 places in 2509 ms of which 17 ms to minimize.
[2024-05-31 18:20:08] [INFO ] Deduced a trap composed of 54 places in 2468 ms of which 18 ms to minimize.
[2024-05-31 18:20:11] [INFO ] Deduced a trap composed of 53 places in 2563 ms of which 18 ms to minimize.
[2024-05-31 18:20:13] [INFO ] Deduced a trap composed of 53 places in 2337 ms of which 17 ms to minimize.
[2024-05-31 18:20:16] [INFO ] Deduced a trap composed of 54 places in 2463 ms of which 15 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 1)
(s159 0)
(s160 1)
(s161 0)
(s162 1)
(s163 0)
(s164 1)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 1)
(s175 0)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 1)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 1)
(s189 0)
(s190 1)
(s191 0)
(s192 1)
(s193 0)
(s194 1)
(s195 0)
(s196 1)
(s197 0)
(s198 1)
(s199 0)
(s200 1)
(s201 0)
(s202 1)
(s203 0)
(s204 1)
(s205 0)
(s206 1)
(s207 0)
(s208 1)
(s209 0)
(s210 1)
(s211 0)
(s212 1)
(s213 0)
(s214 1)
(s215 0)
(s216 1)
(s217 0)
(s218 1)
(s219 0)
(s220 1)
(s221 0)
(s222 1)
(s223 0)
(s224 1)
(s225 0)
(s226 1)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2655/7761 variables, and 60 constraints, problems are : Problem set: 0 solved, 5055 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/2656 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 0/5055 constraints, Known Traps: 9/9 constraints]
After SMT, in 65121ms problems are : Problem set: 0 solved, 5055 unsolved
Search for dead transitions found 0 dead transitions in 65175ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2656/3115 places, 5105/5576 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119080 ms. Remains : 2656/3115 places, 5105/5576 transitions.
Stuttering acceptance computed with spot in 438 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p2), (AND p1 (NOT p2)), (AND (NOT p0) p2 p1), (AND p1 (NOT p2))]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-00
Stuttering criterion allowed to conclude after 357 steps with 1 reset in 12 ms.
FORMULA CANConstruction-PT-050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-00 finished in 119615 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))||F(p1))))'
Support contains 2 out of 3115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3104 transition count 5554
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3104 transition count 5554
Applied a total of 22 rules in 435 ms. Remains 3104 /3115 variables (removed 11) and now considering 5554/5576 (removed 22) transitions.
// Phase 1: matrix 5554 rows 3104 cols
[2024-05-31 18:20:20] [INFO ] Computed 51 invariants in 38 ms
[2024-05-31 18:20:22] [INFO ] Implicit Places using invariants in 1698 ms returned []
[2024-05-31 18:20:22] [INFO ] Invariant cache hit.
[2024-05-31 18:20:23] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-31 18:20:54] [INFO ] Performed 1821/3104 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:21:24] [INFO ] Performed 3089/3104 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 18:21:24] [INFO ] Implicit Places using invariants and state equation in 62633 ms returned []
Implicit Place search using SMT with State Equation took 64333 ms to find 0 implicit places.
Running 5504 sub problems to find dead transitions.
[2024-05-31 18:21:24] [INFO ] Invariant cache hit.
[2024-05-31 18:21:24] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3103 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3103/8658 variables, and 51 constraints, problems are : Problem set: 0 solved, 5504 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3104 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5504/5504 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5504 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3103 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3103/8658 variables, and 51 constraints, problems are : Problem set: 0 solved, 5504 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3104 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 0/5504 constraints, Known Traps: 0/0 constraints]
After SMT, in 64412ms problems are : Problem set: 0 solved, 5504 unsolved
Search for dead transitions found 0 dead transitions in 64456ms
Starting structural reductions in LTL mode, iteration 1 : 3104/3115 places, 5554/5576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129236 ms. Remains : 3104/3115 places, 5554/5576 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-02
Stuttering criterion allowed to conclude after 26438 steps with 29 reset in 255 ms.
FORMULA CANConstruction-PT-050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-02 finished in 129694 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)))'
Support contains 2 out of 3115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 337 place count 3115 transition count 5239
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 1 with 337 rules applied. Total rules applied 674 place count 2778 transition count 5239
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 674 place count 2778 transition count 5189
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 774 place count 2728 transition count 5189
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 787 place count 2715 transition count 5163
Iterating global reduction 2 with 13 rules applied. Total rules applied 800 place count 2715 transition count 5163
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 13 rules applied. Total rules applied 813 place count 2715 transition count 5150
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 826 place count 2702 transition count 5150
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 924 place count 2653 transition count 5101
Applied a total of 924 rules in 815 ms. Remains 2653 /3115 variables (removed 462) and now considering 5101/5576 (removed 475) transitions.
// Phase 1: matrix 5101 rows 2653 cols
[2024-05-31 18:22:30] [INFO ] Computed 51 invariants in 50 ms
[2024-05-31 18:22:32] [INFO ] Implicit Places using invariants in 1640 ms returned []
[2024-05-31 18:22:32] [INFO ] Invariant cache hit.
[2024-05-31 18:22:33] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-31 18:23:04] [INFO ] Performed 1358/2653 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:23:32] [INFO ] Implicit Places using invariants and state equation in 60542 ms returned []
Implicit Place search using SMT with State Equation took 62185 ms to find 0 implicit places.
[2024-05-31 18:23:32] [INFO ] Redundant transitions in 302 ms returned []
Running 5051 sub problems to find dead transitions.
[2024-05-31 18:23:33] [INFO ] Invariant cache hit.
[2024-05-31 18:23:33] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2652 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5051 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2652/7754 variables, and 51 constraints, problems are : Problem set: 0 solved, 5051 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/2653 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5051/5051 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5051 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2652 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5051 unsolved
[2024-05-31 18:24:21] [INFO ] Deduced a trap composed of 53 places in 2644 ms of which 18 ms to minimize.
[2024-05-31 18:24:24] [INFO ] Deduced a trap composed of 53 places in 2577 ms of which 14 ms to minimize.
[2024-05-31 18:24:26] [INFO ] Deduced a trap composed of 53 places in 2663 ms of which 18 ms to minimize.
[2024-05-31 18:24:29] [INFO ] Deduced a trap composed of 53 places in 2351 ms of which 15 ms to minimize.
[2024-05-31 18:24:31] [INFO ] Deduced a trap composed of 53 places in 2541 ms of which 17 ms to minimize.
[2024-05-31 18:24:34] [INFO ] Deduced a trap composed of 57 places in 2325 ms of which 17 ms to minimize.
[2024-05-31 18:24:36] [INFO ] Deduced a trap composed of 53 places in 2476 ms of which 19 ms to minimize.
[2024-05-31 18:24:39] [INFO ] Deduced a trap composed of 53 places in 2507 ms of which 18 ms to minimize.
SMT process timed out in 66379ms, After SMT, problems are : Problem set: 0 solved, 5051 unsolved
Search for dead transitions found 0 dead transitions in 66422ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2653/3115 places, 5101/5576 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129745 ms. Remains : 2653/3115 places, 5101/5576 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-03
Product exploration explored 100000 steps with 294 reset in 1220 ms.
Product exploration explored 100000 steps with 292 reset in 1348 ms.
Computed a total of 51 stabilizing places and 100 stable transitions
Computed a total of 51 stabilizing places and 100 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 39218 steps (112 resets) in 617 ms. (63 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 2653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2653/2653 places, 5101/5101 transitions.
Applied a total of 0 rules in 225 ms. Remains 2653 /2653 variables (removed 0) and now considering 5101/5101 (removed 0) transitions.
[2024-05-31 18:24:42] [INFO ] Invariant cache hit.
[2024-05-31 18:24:44] [INFO ] Implicit Places using invariants in 1662 ms returned []
[2024-05-31 18:24:44] [INFO ] Invariant cache hit.
[2024-05-31 18:24:46] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-31 18:25:16] [INFO ] Performed 1330/2653 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:25:42] [INFO ] Implicit Places using invariants and state equation in 58114 ms returned []
Implicit Place search using SMT with State Equation took 59779 ms to find 0 implicit places.
[2024-05-31 18:25:43] [INFO ] Redundant transitions in 326 ms returned []
Running 5051 sub problems to find dead transitions.
[2024-05-31 18:25:43] [INFO ] Invariant cache hit.
[2024-05-31 18:25:43] [INFO ] State equation strengthened by 4950 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 2.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 1.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 1.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 1.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 1.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 1.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 1.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 1.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 1.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 1.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 1.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 1.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 1.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 1.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 1.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 1.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 1.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 1.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 0.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 1.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 0.0)
(s1501 0.0)
(s1502 0.0)
(s1503 0.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 0.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 0.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 0.0)
(s1533 0.0)
(s1534 0.0)
(s1535 0.0)
(s1536 0.0)
(s1537 0.0)
(s1538 1.0)
(s1539 0.0)
(s1540 0.0)
(s1541 0.0)
(s1542 0.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 0.0)
(s1549 0.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 0.0)
(s1555 0.0)
(s1556 0.0)
(s1557 0.0)
(s1558 0.0)
(s1559 0.0)
(s1560 0.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 0.0)
(s1568 0.0)
(s1569 0.0)
(s1570 0.0)
(s1571 0.0)
(s1572 0.0)
(s1573 0.0)
(s1574 0.0)
(s1575 0.0)
(s1576 0.0)
(s1577 0.0)
(s1578 0.0)
(s1579 0.0)
(s1580 0.0)
(s1581 0.0)
(s1582 0.0)
(s1583 0.0)
(s1584 0.0)
(s1585 0.0)
(s1586 0.0)
(s1587 1.0)
(s1588 0.0)
(s1589 0.0)
(s1590 0.0)
(s1591 0.0)
(s1592 0.0)
(s1593 0.0)
(s1594 0.0)
(s1595 0.0)
(s1596 0.0)
(s1597 0.0)
(s1598 0.0)
(s1599 0.0)
(s1600 0.0)
(s1601 0.0)
(s1602 0.0)
(s1603 0.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 0.0)
(s1609 0.0)
(s1610 0.0)
(s1611 0.0)
(s1612 0.0)
(s1613 0.0)
(s1614 0.0)
(s1615 0.0)
(s1616 0.0)
(s1617 0.0)
(s1618 0.0)
(s1619 0.0)
(s1620 0.0)
(s1621 0.0)
(s1622 0.0)
(s1623 0.0)
(s1624 0.0)
(s1625 0.0)
(s1626 0.0)
(s1627 0.0)
(s1628 0.0)
(s1629 0.0)
(s1630 0.0)
(s1631 0.0)
(s1632 0.0)
(s1633 0.0)
(s1634 0.0)
(s1635 0.0)
(s1636 1.0)
(s1637 0.0)
(s1638 0.0)
(s1639 0.0)
(s1640 0.0)
(s1641 0.0)
(s1642 0.0)
(s1643 0.0)
(s1644 0.0)
(s1645 0.0)
(s1646 0.0)
(s1647 0.0)
(s1648 0.0)
(s1649 0.0)
(s1650 0.0)
(s1651 0.0)
(s1652 0.0)
(s1653 0.0)
(s1654 0.0)
(s1655 0.0)
(s1656 0.0)
(s1657 0.0)
(s1658 0.0)
(s1659 0.0)
(s1660 0.0)
(s1661 0.0)
(s1662 0.0)
(s1663 0.0)
(s1664 0.0)
(s1665 0.0)
(s1666 0.0)
(s1667 0.0)
(s1668 0.0)
(s1669 0.0)
(s1670 0.0)
(s1671 0.0)
(s1672 0.0)
(s1673 0.0)
(s1674 0.0)
(s1675 0.0)
(s1676 0.0)
(s1677 0.0)
(s1678 0.0)
(s1679 0.0)
(s1680 0.0)
(s1681 0.0)
(s1682 0.0)
(s1683 0.0)
(s1684 0.0)
(s1685 1.0)
(s1686 0.0)
(s1687 0.0)
(s1688 0.0)
(s1689 0.0)
(s1690 0.0)
(s1691 0.0)
(s1692 0.0)
(s1693 0.0)
(s1694 0.0)
(s1695 0.0)
(s1696 0.0)
(s1697 0.0)
(s1698 0.0)
(s1699 0.0)
(s1700 0.0)
(s1701 0.0)
(s1702 0.0)
(s1703 0.0)
(s1704 0.0)
(s1705 0.0)
(s1706 0.0)
(s1707 0.0)
(s1708 0.0)
(s1709 0.0)
(s1710 0.0)
(s1711 0.0)
(s1712 0.0)
(s1713 0.0)
(s1714 0.0)
(s1715 0.0)
(s1716 0.0)
(s1717 0.0)
(s1718 0.0)
(s1719 0.0)
(s1720 0.0)
(s1721 0.0)
(s1722 0.0)
(s1723 0.0)
(s1724 0.0)
(s1725 0.0)
(s1726 0.0)
(s1727 0.0)
(s1728 0.0)
(s1729 0.0)
(s1730 0.0)
(s1731 0.0)
(s1732 0.0)
(s1733 0.0)
(s1734 1.0)
(s1735 0.0)
(s1736 0.0)
(s1737 0.0)
(s1738 0.0)
(s1739 0.0)
(s1740 0.0)
(s1741 0.0)
(s1742 0.0)
(s1743 0.0)
(s1744 0.0)
(s1745 0.0)
(s1746 0.0)
(s1747 0.0)
(s1748 0.0)
(s1749 0.0)
(s1750 0.0)
(s1751 0.0)
(s1752 0.0)
(s1753 0.0)
(s1754 0.0)
(s1755 0.0)
(s1756 0.0)
(s1757 0.0)
(s1758 0.0)
(s1759 0.0)
(s1760 0.0)
(s1761 0.0)
(s1762 0.0)
(s1763 0.0)
(s1764 0.0)
(s1765 0.0)
(s1766 0.0)
(s1767 0.0)
(s1768 0.0)
(s1769 0.0)
(s1770 0.0)
(s1771 0.0)
(s1772 0.0)
(s1773 0.0)
(s1774 0.0)
(s1775 0.0)
(s1776 0.0)
(s1777 0.0)
(s1778 0.0)
(s1779 0.0)
(s1780 0.0)
(s1781 0.0)
(s1782 0.0)
(s1783 1.0)
(s1784 0.0)
(s1785 0.0)
(s1786 0.0)
(s1787 0.0)
(s1788 0.0)
(s1789 0.0)
(s1790 0.0)
(s1791 0.0)
(s1792 0.0)
(s1793 0.0)
(s1794 0.0)
(s1795 0.0)
(s1796 0.0)
(s1797 0.0)
(s1798 0.0)
(s1799 0.0)
(s1800 0.0)
(s1801 0.0)
(s1802 0.0)
(s1803 0.0)
(s1804 0.0)
(s1805 0.0)
(s1806 0.0)
(s1807 0.0)
(s1808 0.0)
(s1809 0.0)
(s1810 0.0)
(s1811 0.0)
(s1812 0.0)
(s1813 0.0)
(s1814 0.0)
(s1815 0.0)
(s1816 0.0)
(s1817 0.0)
(s1818 0.0)
(s1819 0.0)
(s1820 0.0)
(s1821 0.0)
(s1822 0.0)
(s1823 0.0)
(s1824 0.0)
(s1825 0.0)
(s1826 0.0)
(s1827 0.0)
(s1828 0.0)
(s1829 0.0)
(s1830 0.0)
(s1831 0.0)
(s1832 1.0)
(s1833 0.0)
(s1834 0.0)
(s1835 0.0)
(s1836 0.0)
(s1837 0.0)
(s1838 0.0)
(s1839 0.0)
(s1840 0.0)
(s1841 0.0)
(s1842 0.0)
(s1843 0.0)
(s1844 0.0)
(s1845 0.0)
(s1846 0.0)
(s1847 0.0)
(s1848 0.0)
(s1849 0.0)
(s1850 0.0)
(s1851 0.0)
(s1852 0.0)
(s1853 0.0)
(s1854 0.0)
(s1855 0.0)
(s1856 0.0)
(s1857 0.0)
(s1858 0.0)
(s1859 0.0)
(s1860 0.0)
(s1861 0.0)
(s1862 0.0)
(s1863 0.0)
(s1864 0.0)
(s1865 0.0)
(s1866 0.0)
(s1867 0.0)
(s1868 0.0)
(s1869 0.0)
(s1870 0.0)
(s1871 0.0)
(s1872 0.0)
(s1873 0.0)
(s1874 0.0)
(s1875 0.0)
(s1876 0.0)
(s1877 0.0)
(s1878 0.0)
(s1879 0.0)
(s1880 0.0)
(s1881 1.0)
(s1882 0.0)
(s1883 0.0)
(s1884 0.0)
(s1885 0.0)
(s1886 0.0)
(s1887 0.0)
(s1888 0.0)
(s1889 0.0)
(s1890 0.0)
(s1891 0.0)
(s1892 0.0)
(s1893 0.0)
(s1894 0.0)
(s1895 0.0)
(s1896 0.0)
(s1897 0.0)
(s1898 0.0)
(s1899 0.0)
(s1900 0.0)
(s1901 0.0)
(s1902 0.0)
(s1903 0.0)
(s1904 0.0)
(s1905 0.0)
(s1906 0.0)
(s1907 0.0)
(s1908 0.0)
(s1909 0.0)
(s1910 0.0)
(s1911 0.0)
(s1912 0.0)
(s1913 0.0)
(s1914 0.0)
(s1915 0.0)
(s1916 0.0)
(s1917 0.0)
(s1918 0.0)
(s1919 0.0)
(s1920 0.0)
(s1921 0.0)
(s1922 0.0)
(s1923 0.0)
(s1924 0.0)
(s1925 0.0)
(s1926 0.0)
(s1927 0.0)
(s1928 0.0)
(s1929 0.0)
(s1930 1.0)
(s1931 0.0)
(s1932 0.0)
(s1933 0.0)
(s1934 0.0)
(s1935 0.0)
(s1936 0.0)
(s1937 0.0)
(s1938 0.0)
(s1939 0.0)
(s1940 0.0)
(s1941 0.0)
(s1942 0.0)
(s1943 0.0)
(s1944 0.0)
(s1945 0.0)
(s1946 0.0)
(s1947 0.0)
(s1948 0.0)
(s1949 0.0)
(s1950 0.0)
(s1951 0.0)
(s1952 0.0)
(s1953 0.0)
(s1954 0.0)
(s1955 0.0)
(s1956 0.0)
(s1957 0.0)
(s1958 0.0)
(s1959 0.0)
(s1960 0.0)
(s1961 0.0)
(s1962 0.0)
(s1963 0.0)
(s1964 0.0)
(s1965 0.0)
(s1966 0.0)
(s1967 0.0)
(s1968 0.0)
(s1969 0.0)
(s1970 0.0)
(s1971 0.0)
(s1972 0.0)
(s1973 0.0)
(s1974 0.0)
(s1975 0.0)
(s1976 0.0)
(s1977 0.0)
(s1978 0.0)
(s1979 1.0)
(s1980 0.0)
(s1981 0.0)
(s1982 0.0)
(s1983 0.0)
(s1984 0.0)
(s1985 0.0)
(s1986 0.0)
(s1987 0.0)
(s1988 0.0)
(s1989 0.0)
(s1990 0.0)
(s1991 0.0)
(s1992 0.0)
(s1993 0.0)
(s1994 0.0)
(s1995 0.0)
(s1996 0.0)
(s1997 0.0)
(s1998 0.0)
(s1999 0.0)
(s2000 0.0)
(s2001 0.0)
(s2002 0.0)
(s2003 0.0)
(s2004 0.0)
(s2005 0.0)
(s2006 0.0)
(s2007 0.0)
(s2008 0.0)
(s2009 0.0)
(s2010 0.0)
(s2011 0.0)
(s2012 0.0)
(s2013 0.0)
(s2014 0.0)
(s2015 0.0)
(s2016 0.0)
(s2017 0.0)
(s2018 0.0)
(s2019 0.0)
(s2020 0.0)
(s2021 0.0)
(s2022 0.0)
(s2023 0.0)
(s2024 0.0)
(s2025 0.0)
(s2026 0.0)
(s2027 0.0)
(s2028 1.0)
(s2029 0.0)
(s2030 0.0)
(s2031 0.0)
(s2032 0.0)
(s2033 0.0)
(s2034 0.0)
(s2035 0.0)
(s2036 0.0)
(s2037 0.0)
(s2038 0.0)
(s2039 0.0)
(s2040 0.0)
(s2041 0.0)
(s2042 0.0)
(s2043 0.0)
(s2044 0.0)
(s2045 0.0)
(s2046 0.0)
(s2047 0.0)
(s2048 0.0)
(s2049 0.0)
(s2050 0.0)
(s2051 0.0)
(s2052 0.0)
(s2053 0.0)
(s2054 0.0)
(s2055 0.0)
(s2056 0.0)
(s2057 0.0)
(s2058 0.0)
(s2059 0.0)
(s2060 0.0)
(s2061 0.0)
(s2062 0.0)
(s2063 0.0)
(s2064 0.0)
(s2065 0.0)
(s2066 0.0)
(s2067 0.0)
(s2068 0.0)
(s2069 0.0)
(s2070 0.0)
(s2071 0.0)
(s2072 0.0)
(s2073 0.0)
(s2074 0.0)
(s2075 0.0)
(s2076 0.0)
(s2077 1.0)
(s2078 0.0)
(s2079 0.0)
(s2080 0.0)
(s2081 0.0)
(s2082 0.0)
(s2083 0.0)
(s2084 0.0)
(s2085 0.0)
(s2086 0.0)
(s2087 0.0)
(s2088 0.0)
(s2089 0.0)
(s2090 0.0)
(s2091 0.0)
(s2092 0.0)
(s2093 0.0)
(s2094 0.0)
(s2095 0.0)
(s2096 0.0)
(s2097 0.0)
(s2098 0.0)
(s2099 0.0)
(s2100 0.0)
(s2101 0.0)
(s2102 0.0)
(s2103 0.0)
(s2104 0.0)
(s2105 0.0)
(s2106 0.0)
(s2107 0.0)
(s2108 0.0)
(s2109 0.0)
(s2110 0.0)
(s2111 0.0)
(s2112 0.0)
(s2113 0.0)
(s2114 0.0)
(s2115 0.0)
(s2116 0.0)
(s2117 0.0)
(s2118 0.0)
(s2119 0.0)
(s2120 0.0)
(s2121 0.0)
(s2122 0.0)
(s2123 0.0)
(s2124 0.0)
(s2125 0.0)
(s2126 1.0)
(s2127 0.0)
(s2128 0.0)
(s2129 0.0)
(s2130 0.0)
(s2131 0.0)
(s2132 0.0)
(s2133 0.0)
(s2134 0.0)
(s2135 0.0)
(s2136 0.0)
(s2137 0.0)
(s2138 0.0)
(s2139 0.0)
(s2140 0.0)
(s2141 0.0)
(s2142 0.0)
(s2143 0.0)
(s2144 0.0)
(s2145 0.0)
(s2146 0.0)
(s2147 0.0)
(s2148 0.0)
(s2149 0.0)
(s2150 0.0)
(s2151 0.0)
(s2152 0.0)
(s2153 0.0)
(s2154 0.0)
(s2155 0.0)
(s2156 0.0)
(s2157 0.0)
(s2158 0.0)
(s2159 0.0)
(s2160 0.0)
(s2161 0.0)
(s2162 0.0)
(s2163 0.0)
(s2164 0.0)
(s2165 0.0)
(s2166 0.0)
(s2167 0.0)
(s2168 0.0)
(s2169 0.0)
(s2170 0.0)
(s2171 0.0)
(s2172 0.0)
(s2173 0.0)
(s2174 0.0)
(s2175 1.0)
(s2176 0.0)
(s2177 0.0)
(s2178 0.0)
(s2179 0.0)
(s2180 0.0)
(s2181 0.0)
(s2182 0.0)
(s2183 0.0)
(s2184 0.0)
(s2185 0.0)
(s2186 0.0)
(s2187 0.0)
(s2188 0.0)
(s2189 0.0)
(s2190 0.0)
(s2191 0.0)
(s2192 0.0)
(s2193 0.0)
(s2194 0.0)
(s2195 0.0)
(s2196 0.0)
(s2197 0.0)
(s2198 0.0)
(s2199 0.0)
(s2200 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2652 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5051 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2652/7754 variables, and 51 constraints, problems are : Problem set: 0 solved, 5051 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/2653 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5051/5051 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5051 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2652 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5051 unsolved
[2024-05-31 18:26:31] [INFO ] Deduced a trap composed of 53 places in 2585 ms of which 18 ms to minimize.
[2024-05-31 18:26:34] [INFO ] Deduced a trap composed of 53 places in 2637 ms of which 17 ms to minimize.
[2024-05-31 18:26:37] [INFO ] Deduced a trap composed of 53 places in 2630 ms of which 18 ms to minimize.
[2024-05-31 18:26:39] [INFO ] Deduced a trap composed of 53 places in 2568 ms of which 18 ms to minimize.
[2024-05-31 18:26:42] [INFO ] Deduced a trap composed of 53 places in 2472 ms of which 17 ms to minimize.
[2024-05-31 18:26:44] [INFO ] Deduced a trap composed of 57 places in 2435 ms of which 16 ms to minimize.
[2024-05-31 18:26:47] [INFO ] Deduced a trap composed of 53 places in 2559 ms of which 16 ms to minimize.
[2024-05-31 18:26:49] [INFO ] Deduced a trap composed of 53 places in 2451 ms of which 17 ms to minimize.
SMT process timed out in 66602ms, After SMT, problems are : Problem set: 0 solved, 5051 unsolved
Search for dead transitions found 0 dead transitions in 66648ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 127004 ms. Remains : 2653/2653 places, 5101/5101 transitions.
Computed a total of 51 stabilizing places and 100 stable transitions
Computed a total of 51 stabilizing places and 100 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 31253 steps (88 resets) in 431 ms. (72 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 295 reset in 1010 ms.
Product exploration explored 100000 steps with 293 reset in 1050 ms.
Support contains 2 out of 2653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2653/2653 places, 5101/5101 transitions.
Applied a total of 0 rules in 217 ms. Remains 2653 /2653 variables (removed 0) and now considering 5101/5101 (removed 0) transitions.
[2024-05-31 18:26:52] [INFO ] Invariant cache hit.
[2024-05-31 18:26:54] [INFO ] Implicit Places using invariants in 1615 ms returned []
[2024-05-31 18:26:54] [INFO ] Invariant cache hit.
[2024-05-31 18:26:56] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-31 18:27:26] [INFO ] Performed 1526/2653 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:27:52] [INFO ] Implicit Places using invariants and state equation in 58245 ms returned []
Implicit Place search using SMT with State Equation took 59864 ms to find 0 implicit places.
[2024-05-31 18:27:52] [INFO ] Redundant transitions in 213 ms returned []
Running 5051 sub problems to find dead transitions.
[2024-05-31 18:27:52] [INFO ] Invariant cache hit.
[2024-05-31 18:27:53] [INFO ] State equation strengthened by 4950 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2652 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5051 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2652/7754 variables, and 51 constraints, problems are : Problem set: 0 solved, 5051 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/2653 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5051/5051 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5051 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2652 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5051 unsolved
[2024-05-31 18:28:41] [INFO ] Deduced a trap composed of 53 places in 2567 ms of which 18 ms to minimize.
[2024-05-31 18:28:43] [INFO ] Deduced a trap composed of 53 places in 2487 ms of which 17 ms to minimize.
[2024-05-31 18:28:46] [INFO ] Deduced a trap composed of 53 places in 2585 ms of which 17 ms to minimize.
[2024-05-31 18:28:48] [INFO ] Deduced a trap composed of 53 places in 2540 ms of which 17 ms to minimize.
[2024-05-31 18:28:51] [INFO ] Deduced a trap composed of 53 places in 2560 ms of which 18 ms to minimize.
[2024-05-31 18:28:53] [INFO ] Deduced a trap composed of 57 places in 2497 ms of which 17 ms to minimize.
[2024-05-31 18:28:56] [INFO ] Deduced a trap composed of 53 places in 2327 ms of which 17 ms to minimize.
[2024-05-31 18:28:58] [INFO ] Deduced a trap composed of 53 places in 2381 ms of which 17 ms to minimize.
SMT process timed out in 65732ms, After SMT, problems are : Problem set: 0 solved, 5051 unsolved
Search for dead transitions found 0 dead transitions in 65778ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 126098 ms. Remains : 2653/2653 places, 5101/5101 transitions.
Treatment of property CANConstruction-PT-050-LTLFireability-03 finished in 389462 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(G(p0)) U p1) U X(p2))))'
Support contains 5 out of 3115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3103 transition count 5552
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3103 transition count 5552
Applied a total of 24 rules in 463 ms. Remains 3103 /3115 variables (removed 12) and now considering 5552/5576 (removed 24) transitions.
// Phase 1: matrix 5552 rows 3103 cols
[2024-05-31 18:28:59] [INFO ] Computed 51 invariants in 39 ms
[2024-05-31 18:29:01] [INFO ] Implicit Places using invariants in 1734 ms returned []
[2024-05-31 18:29:01] [INFO ] Invariant cache hit.
[2024-05-31 18:29:03] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-31 18:29:33] [INFO ] Performed 1795/3103 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:30:03] [INFO ] Performed 3019/3103 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 18:30:05] [INFO ] Implicit Places using invariants and state equation in 64226 ms returned []
Implicit Place search using SMT with State Equation took 65962 ms to find 0 implicit places.
Running 5502 sub problems to find dead transitions.
[2024-05-31 18:30:05] [INFO ] Invariant cache hit.
[2024-05-31 18:30:05] [INFO ] State equation strengthened by 4950 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3102 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3102/8655 variables, and 51 constraints, problems are : Problem set: 0 solved, 5502 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3103 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5502/5502 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3102 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5502 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3102/8655 variables, and 51 constraints, problems are : Problem set: 0 solved, 5502 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3103 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 0/5502 constraints, Known Traps: 0/0 constraints]
After SMT, in 64574ms problems are : Problem set: 0 solved, 5502 unsolved
Search for dead transitions found 0 dead transitions in 64620ms
Starting structural reductions in LTL mode, iteration 1 : 3103/3115 places, 5552/5576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131057 ms. Remains : 3103/3115 places, 5552/5576 transitions.
Stuttering acceptance computed with spot in 309 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-04
Stuttering criterion allowed to conclude after 859 steps with 0 reset in 7 ms.
FORMULA CANConstruction-PT-050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-04 finished in 131419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X((p1&&G((!p1||X(p2))))))))'
Support contains 4 out of 3115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3104 transition count 5554
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3104 transition count 5554
Applied a total of 22 rules in 424 ms. Remains 3104 /3115 variables (removed 11) and now considering 5554/5576 (removed 22) transitions.
// Phase 1: matrix 5554 rows 3104 cols
[2024-05-31 18:31:10] [INFO ] Computed 51 invariants in 37 ms
[2024-05-31 18:31:12] [INFO ] Implicit Places using invariants in 1810 ms returned []
[2024-05-31 18:31:12] [INFO ] Invariant cache hit.
[2024-05-31 18:31:14] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-31 18:31:45] [INFO ] Performed 1452/3104 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:32:15] [INFO ] Performed 2479/3104 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 18:32:32] [INFO ] Implicit Places using invariants and state equation in 79636 ms returned []
Implicit Place search using SMT with State Equation took 81457 ms to find 0 implicit places.
Running 5504 sub problems to find dead transitions.
[2024-05-31 18:32:32] [INFO ] Invariant cache hit.
[2024-05-31 18:32:32] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3103 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3103/8658 variables, and 51 constraints, problems are : Problem set: 0 solved, 5504 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3104 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5504/5504 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5504 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3103 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3103/8658 variables, and 51 constraints, problems are : Problem set: 0 solved, 5504 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3104 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 0/5504 constraints, Known Traps: 0/0 constraints]
After SMT, in 64927ms problems are : Problem set: 0 solved, 5504 unsolved
Search for dead transitions found 0 dead transitions in 64977ms
Starting structural reductions in LTL mode, iteration 1 : 3104/3115 places, 5554/5576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146871 ms. Remains : 3104/3115 places, 5554/5576 transitions.
Stuttering acceptance computed with spot in 396 ms :[true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-05
Entered a terminal (fully accepting) state of product in 75716 steps with 83 reset in 608 ms.
FORMULA CANConstruction-PT-050-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-05 finished in 147919 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(G(p0)) U p1)))'
Support contains 2 out of 3115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3104 transition count 5554
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3104 transition count 5554
Applied a total of 22 rules in 436 ms. Remains 3104 /3115 variables (removed 11) and now considering 5554/5576 (removed 22) transitions.
// Phase 1: matrix 5554 rows 3104 cols
[2024-05-31 18:33:38] [INFO ] Computed 51 invariants in 37 ms
[2024-05-31 18:33:40] [INFO ] Implicit Places using invariants in 1813 ms returned []
[2024-05-31 18:33:40] [INFO ] Invariant cache hit.
[2024-05-31 18:33:42] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-31 18:34:12] [INFO ] Performed 1528/3104 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:34:42] [INFO ] Performed 2468/3104 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 18:35:00] [INFO ] Implicit Places using invariants and state equation in 80013 ms returned []
Implicit Place search using SMT with State Equation took 81827 ms to find 0 implicit places.
Running 5504 sub problems to find dead transitions.
[2024-05-31 18:35:00] [INFO ] Invariant cache hit.
[2024-05-31 18:35:00] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3103 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3103/8658 variables, and 51 constraints, problems are : Problem set: 0 solved, 5504 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3104 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5504/5504 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5504 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3103 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5504 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3103/8658 variables, and 51 constraints, problems are : Problem set: 0 solved, 5504 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3104 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 0/5504 constraints, Known Traps: 0/0 constraints]
After SMT, in 64848ms problems are : Problem set: 0 solved, 5504 unsolved
Search for dead transitions found 0 dead transitions in 64896ms
Starting structural reductions in LTL mode, iteration 1 : 3104/3115 places, 5554/5576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147170 ms. Remains : 3104/3115 places, 5554/5576 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-07
Stuttering criterion allowed to conclude after 1084 steps with 0 reset in 11 ms.
FORMULA CANConstruction-PT-050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-07 finished in 147332 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 3115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 337 place count 3115 transition count 5239
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 1 with 337 rules applied. Total rules applied 674 place count 2778 transition count 5239
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 674 place count 2778 transition count 5189
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 774 place count 2728 transition count 5189
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 787 place count 2715 transition count 5163
Iterating global reduction 2 with 13 rules applied. Total rules applied 800 place count 2715 transition count 5163
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 13 rules applied. Total rules applied 813 place count 2715 transition count 5150
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 826 place count 2702 transition count 5150
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 924 place count 2653 transition count 5101
Applied a total of 924 rules in 687 ms. Remains 2653 /3115 variables (removed 462) and now considering 5101/5576 (removed 475) transitions.
// Phase 1: matrix 5101 rows 2653 cols
[2024-05-31 18:36:06] [INFO ] Computed 51 invariants in 50 ms
[2024-05-31 18:36:08] [INFO ] Implicit Places using invariants in 1641 ms returned []
[2024-05-31 18:36:08] [INFO ] Invariant cache hit.
[2024-05-31 18:36:09] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-31 18:36:39] [INFO ] Performed 1442/2653 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:37:06] [INFO ] Implicit Places using invariants and state equation in 58339 ms returned []
Implicit Place search using SMT with State Equation took 59984 ms to find 0 implicit places.
[2024-05-31 18:37:06] [INFO ] Redundant transitions in 322 ms returned []
Running 5051 sub problems to find dead transitions.
[2024-05-31 18:37:06] [INFO ] Invariant cache hit.
[2024-05-31 18:37:06] [INFO ] State equation strengthened by 4950 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2652 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5051 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2652/7754 variables, and 51 constraints, problems are : Problem set: 0 solved, 5051 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/2653 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5051/5051 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5051 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2652 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5051 unsolved
[2024-05-31 18:37:55] [INFO ] Deduced a trap composed of 53 places in 2551 ms of which 16 ms to minimize.
[2024-05-31 18:37:57] [INFO ] Deduced a trap composed of 53 places in 2513 ms of which 17 ms to minimize.
[2024-05-31 18:38:00] [INFO ] Deduced a trap composed of 53 places in 2479 ms of which 18 ms to minimize.
[2024-05-31 18:38:02] [INFO ] Deduced a trap composed of 53 places in 2495 ms of which 17 ms to minimize.
[2024-05-31 18:38:05] [INFO ] Deduced a trap composed of 53 places in 2434 ms of which 17 ms to minimize.
[2024-05-31 18:38:07] [INFO ] Deduced a trap composed of 53 places in 2453 ms of which 16 ms to minimize.
[2024-05-31 18:38:10] [INFO ] Deduced a trap composed of 53 places in 2428 ms of which 17 ms to minimize.
[2024-05-31 18:38:12] [INFO ] Deduced a trap composed of 53 places in 2448 ms of which 17 ms to minimize.
SMT process timed out in 65859ms, After SMT, problems are : Problem set: 0 solved, 5051 unsolved
Search for dead transitions found 0 dead transitions in 65904ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2653/3115 places, 5101/5576 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126920 ms. Remains : 2653/3115 places, 5101/5576 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-09
Product exploration explored 100000 steps with 290 reset in 1187 ms.
Product exploration explored 100000 steps with 287 reset in 1208 ms.
Computed a total of 51 stabilizing places and 100 stable transitions
Computed a total of 51 stabilizing places and 100 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 24298 steps (69 resets) in 320 ms. (75 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 2 out of 2653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2653/2653 places, 5101/5101 transitions.
Applied a total of 0 rules in 231 ms. Remains 2653 /2653 variables (removed 0) and now considering 5101/5101 (removed 0) transitions.
[2024-05-31 18:38:15] [INFO ] Invariant cache hit.
[2024-05-31 18:38:17] [INFO ] Implicit Places using invariants in 1453 ms returned []
[2024-05-31 18:38:17] [INFO ] Invariant cache hit.
[2024-05-31 18:38:19] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-31 18:38:49] [INFO ] Performed 1355/2653 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:39:19] [INFO ] Performed 2647/2653 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 18:39:19] [INFO ] Implicit Places using invariants and state equation in 62163 ms returned []
Implicit Place search using SMT with State Equation took 63618 ms to find 0 implicit places.
[2024-05-31 18:39:19] [INFO ] Redundant transitions in 223 ms returned []
Running 5051 sub problems to find dead transitions.
[2024-05-31 18:39:19] [INFO ] Invariant cache hit.
[2024-05-31 18:39:19] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2652 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5051 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2652/7754 variables, and 51 constraints, problems are : Problem set: 0 solved, 5051 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/2653 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5051/5051 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5051 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2652 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5051 unsolved
[2024-05-31 18:40:08] [INFO ] Deduced a trap composed of 53 places in 2670 ms of which 18 ms to minimize.
[2024-05-31 18:40:11] [INFO ] Deduced a trap composed of 53 places in 2554 ms of which 15 ms to minimize.
[2024-05-31 18:40:13] [INFO ] Deduced a trap composed of 53 places in 2638 ms of which 18 ms to minimize.
[2024-05-31 18:40:16] [INFO ] Deduced a trap composed of 53 places in 2505 ms of which 17 ms to minimize.
[2024-05-31 18:40:18] [INFO ] Deduced a trap composed of 53 places in 2576 ms of which 17 ms to minimize.
[2024-05-31 18:40:21] [INFO ] Deduced a trap composed of 53 places in 2571 ms of which 18 ms to minimize.
[2024-05-31 18:40:24] [INFO ] Deduced a trap composed of 53 places in 2522 ms of which 17 ms to minimize.
[2024-05-31 18:40:26] [INFO ] Deduced a trap composed of 53 places in 2455 ms of which 18 ms to minimize.
SMT process timed out in 66783ms, After SMT, problems are : Problem set: 0 solved, 5051 unsolved
Search for dead transitions found 0 dead transitions in 66828ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 130924 ms. Remains : 2653/2653 places, 5101/5101 transitions.
Computed a total of 51 stabilizing places and 100 stable transitions
Computed a total of 51 stabilizing places and 100 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 40000 steps (114 resets) in 571 ms. (69 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 14449 steps, run visited all 1 properties in 286 ms. (steps per millisecond=50 )
Probabilistic random walk after 14449 steps, saw 11426 distinct states, run finished after 289 ms. (steps per millisecond=49 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 288 reset in 1142 ms.
Product exploration explored 100000 steps with 288 reset in 1132 ms.
Support contains 2 out of 2653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2653/2653 places, 5101/5101 transitions.
Applied a total of 0 rules in 232 ms. Remains 2653 /2653 variables (removed 0) and now considering 5101/5101 (removed 0) transitions.
[2024-05-31 18:40:30] [INFO ] Invariant cache hit.
[2024-05-31 18:40:31] [INFO ] Implicit Places using invariants in 1591 ms returned []
[2024-05-31 18:40:31] [INFO ] Invariant cache hit.
[2024-05-31 18:40:33] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-31 18:41:03] [INFO ] Performed 1494/2653 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:41:28] [INFO ] Implicit Places using invariants and state equation in 56478 ms returned []
Implicit Place search using SMT with State Equation took 58071 ms to find 0 implicit places.
[2024-05-31 18:41:28] [INFO ] Redundant transitions in 223 ms returned []
Running 5051 sub problems to find dead transitions.
[2024-05-31 18:41:28] [INFO ] Invariant cache hit.
[2024-05-31 18:41:28] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2652 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5051 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2652/7754 variables, and 51 constraints, problems are : Problem set: 0 solved, 5051 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/2653 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5051/5051 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5051 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2652 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5051 unsolved
[2024-05-31 18:42:16] [INFO ] Deduced a trap composed of 53 places in 2580 ms of which 15 ms to minimize.
[2024-05-31 18:42:18] [INFO ] Deduced a trap composed of 53 places in 2465 ms of which 17 ms to minimize.
[2024-05-31 18:42:21] [INFO ] Deduced a trap composed of 53 places in 2586 ms of which 17 ms to minimize.
[2024-05-31 18:42:24] [INFO ] Deduced a trap composed of 53 places in 2561 ms of which 17 ms to minimize.
[2024-05-31 18:42:26] [INFO ] Deduced a trap composed of 53 places in 2490 ms of which 16 ms to minimize.
[2024-05-31 18:42:29] [INFO ] Deduced a trap composed of 53 places in 2483 ms of which 17 ms to minimize.
[2024-05-31 18:42:31] [INFO ] Deduced a trap composed of 53 places in 2359 ms of which 17 ms to minimize.
[2024-05-31 18:42:34] [INFO ] Deduced a trap composed of 53 places in 2404 ms of which 16 ms to minimize.
SMT process timed out in 65701ms, After SMT, problems are : Problem set: 0 solved, 5051 unsolved
Search for dead transitions found 0 dead transitions in 65750ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 124310 ms. Remains : 2653/2653 places, 5101/5101 transitions.
Treatment of property CANConstruction-PT-050-LTLFireability-09 finished in 388499 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(F(p0))))'
Support contains 1 out of 3115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3102 transition count 5550
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3102 transition count 5550
Applied a total of 26 rules in 422 ms. Remains 3102 /3115 variables (removed 13) and now considering 5550/5576 (removed 26) transitions.
// Phase 1: matrix 5550 rows 3102 cols
[2024-05-31 18:42:34] [INFO ] Computed 51 invariants in 35 ms
[2024-05-31 18:42:36] [INFO ] Implicit Places using invariants in 1726 ms returned []
[2024-05-31 18:42:36] [INFO ] Invariant cache hit.
[2024-05-31 18:42:38] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-31 18:43:08] [INFO ] Performed 1574/3102 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:43:38] [INFO ] Performed 2669/3102 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 18:43:50] [INFO ] Implicit Places using invariants and state equation in 74176 ms returned []
Implicit Place search using SMT with State Equation took 75904 ms to find 0 implicit places.
Running 5500 sub problems to find dead transitions.
[2024-05-31 18:43:50] [INFO ] Invariant cache hit.
[2024-05-31 18:43:50] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3101 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3101/8652 variables, and 51 constraints, problems are : Problem set: 0 solved, 5500 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3102 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5500/5500 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3101 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3101/8652 variables, and 51 constraints, problems are : Problem set: 0 solved, 5500 unsolved in 30090 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3102 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 0/5500 constraints, Known Traps: 0/0 constraints]
After SMT, in 64715ms problems are : Problem set: 0 solved, 5500 unsolved
Search for dead transitions found 0 dead transitions in 64761ms
Starting structural reductions in LTL mode, iteration 1 : 3102/3115 places, 5550/5576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141094 ms. Remains : 3102/3115 places, 5550/5576 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-10
Stuttering criterion allowed to conclude after 5248 steps with 75 reset in 36 ms.
FORMULA CANConstruction-PT-050-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-10 finished in 141307 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)))'
Support contains 1 out of 3115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3103 transition count 5552
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3103 transition count 5552
Applied a total of 24 rules in 417 ms. Remains 3103 /3115 variables (removed 12) and now considering 5552/5576 (removed 24) transitions.
// Phase 1: matrix 5552 rows 3103 cols
[2024-05-31 18:44:56] [INFO ] Computed 51 invariants in 35 ms
[2024-05-31 18:44:57] [INFO ] Implicit Places using invariants in 1694 ms returned []
[2024-05-31 18:44:57] [INFO ] Invariant cache hit.
[2024-05-31 18:44:59] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-31 18:45:29] [INFO ] Performed 1633/3103 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:45:59] [INFO ] Performed 2779/3103 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 18:46:08] [INFO ] Implicit Places using invariants and state equation in 70859 ms returned []
Implicit Place search using SMT with State Equation took 72563 ms to find 0 implicit places.
Running 5502 sub problems to find dead transitions.
[2024-05-31 18:46:08] [INFO ] Invariant cache hit.
[2024-05-31 18:46:08] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3102 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3102/8655 variables, and 51 constraints, problems are : Problem set: 0 solved, 5502 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3103 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5502/5502 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3102 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5502 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3102/8655 variables, and 51 constraints, problems are : Problem set: 0 solved, 5502 unsolved in 30093 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3103 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 0/5502 constraints, Known Traps: 0/0 constraints]
After SMT, in 65250ms problems are : Problem set: 0 solved, 5502 unsolved
Search for dead transitions found 0 dead transitions in 65293ms
Starting structural reductions in LTL mode, iteration 1 : 3103/3115 places, 5552/5576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138279 ms. Remains : 3103/3115 places, 5552/5576 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-11
Entered a terminal (fully accepting) state of product in 25145 steps with 27 reset in 169 ms.
FORMULA CANConstruction-PT-050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-11 finished in 138563 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 3115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3102 transition count 5550
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3102 transition count 5550
Applied a total of 26 rules in 423 ms. Remains 3102 /3115 variables (removed 13) and now considering 5550/5576 (removed 26) transitions.
// Phase 1: matrix 5550 rows 3102 cols
[2024-05-31 18:47:14] [INFO ] Computed 51 invariants in 35 ms
[2024-05-31 18:47:16] [INFO ] Implicit Places using invariants in 1671 ms returned []
[2024-05-31 18:47:16] [INFO ] Invariant cache hit.
[2024-05-31 18:47:17] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-31 18:47:48] [INFO ] Performed 1725/3102 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:48:18] [INFO ] Performed 3040/3102 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 18:48:19] [INFO ] Implicit Places using invariants and state equation in 63519 ms returned []
Implicit Place search using SMT with State Equation took 65194 ms to find 0 implicit places.
Running 5500 sub problems to find dead transitions.
[2024-05-31 18:48:19] [INFO ] Invariant cache hit.
[2024-05-31 18:48:19] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3101 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3101/8652 variables, and 51 constraints, problems are : Problem set: 0 solved, 5500 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3102 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5500/5500 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3101 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5500 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3101/8652 variables, and 51 constraints, problems are : Problem set: 0 solved, 5500 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/3102 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 0/5500 constraints, Known Traps: 0/0 constraints]
After SMT, in 64756ms problems are : Problem set: 0 solved, 5500 unsolved
Search for dead transitions found 0 dead transitions in 64798ms
Starting structural reductions in LTL mode, iteration 1 : 3102/3115 places, 5550/5576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130422 ms. Remains : 3102/3115 places, 5550/5576 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-12
Stuttering criterion allowed to conclude after 1163 steps with 1 reset in 9 ms.
FORMULA CANConstruction-PT-050-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-12 finished in 130520 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 U (p1&&F(p2))))))'
Support contains 5 out of 3115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 334 rules applied. Total rules applied 334 place count 3115 transition count 5242
Reduce places removed 334 places and 0 transitions.
Iterating post reduction 1 with 334 rules applied. Total rules applied 668 place count 2781 transition count 5242
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 668 place count 2781 transition count 5192
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 768 place count 2731 transition count 5192
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 779 place count 2720 transition count 5170
Iterating global reduction 2 with 11 rules applied. Total rules applied 790 place count 2720 transition count 5170
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 801 place count 2720 transition count 5159
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 812 place count 2709 transition count 5159
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 4 with 102 rules applied. Total rules applied 914 place count 2658 transition count 5108
Applied a total of 914 rules in 819 ms. Remains 2658 /3115 variables (removed 457) and now considering 5108/5576 (removed 468) transitions.
// Phase 1: matrix 5108 rows 2658 cols
[2024-05-31 18:49:25] [INFO ] Computed 51 invariants in 49 ms
[2024-05-31 18:49:27] [INFO ] Implicit Places using invariants in 1574 ms returned []
[2024-05-31 18:49:27] [INFO ] Invariant cache hit.
[2024-05-31 18:49:28] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-31 18:49:59] [INFO ] Performed 1444/2658 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:50:25] [INFO ] Implicit Places using invariants and state equation in 57934 ms returned []
Implicit Place search using SMT with State Equation took 59525 ms to find 0 implicit places.
[2024-05-31 18:50:25] [INFO ] Redundant transitions in 216 ms returned []
Running 5058 sub problems to find dead transitions.
[2024-05-31 18:50:25] [INFO ] Invariant cache hit.
[2024-05-31 18:50:25] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2657 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5058 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2657/7766 variables, and 51 constraints, problems are : Problem set: 0 solved, 5058 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/2658 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5058/5058 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5058 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2657 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5058 unsolved
[2024-05-31 18:51:03] [INFO ] Deduced a trap composed of 53 places in 1370 ms of which 17 ms to minimize.
[2024-05-31 18:51:05] [INFO ] Deduced a trap composed of 53 places in 1355 ms of which 16 ms to minimize.
[2024-05-31 18:51:06] [INFO ] Deduced a trap composed of 53 places in 1345 ms of which 17 ms to minimize.
[2024-05-31 18:51:08] [INFO ] Deduced a trap composed of 53 places in 1381 ms of which 16 ms to minimize.
[2024-05-31 18:51:09] [INFO ] Deduced a trap composed of 53 places in 1363 ms of which 16 ms to minimize.
[2024-05-31 18:51:11] [INFO ] Deduced a trap composed of 53 places in 1406 ms of which 16 ms to minimize.
[2024-05-31 18:51:12] [INFO ] Deduced a trap composed of 53 places in 1435 ms of which 17 ms to minimize.
[2024-05-31 18:51:14] [INFO ] Deduced a trap composed of 53 places in 1376 ms of which 17 ms to minimize.
[2024-05-31 18:51:15] [INFO ] Deduced a trap composed of 53 places in 1389 ms of which 16 ms to minimize.
[2024-05-31 18:51:16] [INFO ] Deduced a trap composed of 53 places in 1379 ms of which 16 ms to minimize.
[2024-05-31 18:51:18] [INFO ] Deduced a trap composed of 53 places in 1428 ms of which 15 ms to minimize.
[2024-05-31 18:51:20] [INFO ] Deduced a trap composed of 53 places in 1750 ms of which 18 ms to minimize.
[2024-05-31 18:51:22] [INFO ] Deduced a trap composed of 54 places in 1695 ms of which 17 ms to minimize.
[2024-05-31 18:51:24] [INFO ] Deduced a trap composed of 53 places in 1779 ms of which 18 ms to minimize.
[2024-05-31 18:51:26] [INFO ] Deduced a trap composed of 53 places in 1752 ms of which 18 ms to minimize.
[2024-05-31 18:51:27] [INFO ] Deduced a trap composed of 53 places in 1555 ms of which 16 ms to minimize.
[2024-05-31 18:51:29] [INFO ] Deduced a trap composed of 53 places in 1841 ms of which 17 ms to minimize.
SMT process timed out in 64601ms, After SMT, problems are : Problem set: 0 solved, 5058 unsolved
Search for dead transitions found 0 dead transitions in 64641ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2658/3115 places, 5108/5576 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125221 ms. Remains : 2658/3115 places, 5108/5576 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-13
Stuttering criterion allowed to conclude after 324 steps with 0 reset in 6 ms.
FORMULA CANConstruction-PT-050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-13 finished in 125380 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)))'
Support contains 3 out of 3115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3115/3115 places, 5576/5576 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 3115 transition count 5240
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 1 with 336 rules applied. Total rules applied 672 place count 2779 transition count 5240
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 672 place count 2779 transition count 5190
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 772 place count 2729 transition count 5190
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 784 place count 2717 transition count 5166
Iterating global reduction 2 with 12 rules applied. Total rules applied 796 place count 2717 transition count 5166
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 808 place count 2717 transition count 5154
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 820 place count 2705 transition count 5154
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 920 place count 2655 transition count 5104
Applied a total of 920 rules in 701 ms. Remains 2655 /3115 variables (removed 460) and now considering 5104/5576 (removed 472) transitions.
// Phase 1: matrix 5104 rows 2655 cols
[2024-05-31 18:51:30] [INFO ] Computed 51 invariants in 48 ms
[2024-05-31 18:51:32] [INFO ] Implicit Places using invariants in 1779 ms returned []
[2024-05-31 18:51:32] [INFO ] Invariant cache hit.
[2024-05-31 18:51:34] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-31 18:52:04] [INFO ] Performed 1357/2655 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:52:34] [INFO ] Performed 2633/2655 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 18:52:34] [INFO ] Implicit Places using invariants and state equation in 62479 ms returned []
Implicit Place search using SMT with State Equation took 64264 ms to find 0 implicit places.
[2024-05-31 18:52:35] [INFO ] Redundant transitions in 213 ms returned []
Running 5054 sub problems to find dead transitions.
[2024-05-31 18:52:35] [INFO ] Invariant cache hit.
[2024-05-31 18:52:35] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2654 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2654/7759 variables, and 51 constraints, problems are : Problem set: 0 solved, 5054 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/2655 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 5054/5054 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5054 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2654 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5054 unsolved
[2024-05-31 18:53:14] [INFO ] Deduced a trap composed of 54 places in 1297 ms of which 17 ms to minimize.
[2024-05-31 18:53:18] [INFO ] Deduced a trap composed of 53 places in 2541 ms of which 17 ms to minimize.
[2024-05-31 18:53:21] [INFO ] Deduced a trap composed of 53 places in 2532 ms of which 17 ms to minimize.
[2024-05-31 18:53:23] [INFO ] Deduced a trap composed of 53 places in 2502 ms of which 21 ms to minimize.
[2024-05-31 18:53:26] [INFO ] Deduced a trap composed of 53 places in 2577 ms of which 16 ms to minimize.
[2024-05-31 18:53:28] [INFO ] Deduced a trap composed of 53 places in 2538 ms of which 17 ms to minimize.
[2024-05-31 18:53:34] [INFO ] Deduced a trap composed of 62 places in 1363 ms of which 15 ms to minimize.
[2024-05-31 18:53:35] [INFO ] Deduced a trap composed of 53 places in 1312 ms of which 16 ms to minimize.
[2024-05-31 18:53:37] [INFO ] Deduced a trap composed of 53 places in 1321 ms of which 15 ms to minimize.
[2024-05-31 18:53:38] [INFO ] Deduced a trap composed of 53 places in 1327 ms of which 16 ms to minimize.
[2024-05-31 18:53:39] [INFO ] Deduced a trap composed of 53 places in 1314 ms of which 14 ms to minimize.
SMT process timed out in 64483ms, After SMT, problems are : Problem set: 0 solved, 5054 unsolved
Search for dead transitions found 0 dead transitions in 64527ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2655/3115 places, 5104/5576 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129727 ms. Remains : 2655/3115 places, 5104/5576 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-14
Stuttering criterion allowed to conclude after 370 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-14 finished in 129838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-31 18:53:40] [INFO ] Flatten gal took : 233 ms
[2024-05-31 18:53:40] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 18:53:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3115 places, 5576 transitions and 21152 arcs took 63 ms.
Total runtime 2465146 ms.
There are residual formulas that ITS could not solve within timeout
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
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="CANConstruction-PT-050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CANConstruction-PT-050, 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 r476-tall-171620505000044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-050.tgz
mv CANConstruction-PT-050 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 ;