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.r378-smll-171683810900172.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is SimpleLoadBal-PT-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810900172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.0K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 12:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 13 12:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716961357266

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SimpleLoadBal-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 05:42:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 05:42:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 05:42:39] [INFO ] Load time of PNML (sax parser for PT used): 270 ms
[2024-05-29 05:42:39] [INFO ] Transformed 149 places.
[2024-05-29 05:42:39] [INFO ] Transformed 1280 transitions.
[2024-05-29 05:42:39] [INFO ] Found NUPN structural information;
[2024-05-29 05:42:39] [INFO ] Completing missing partition info from NUPN : creating a component with [P_client_idle_1, P_client_idle_2, P_client_idle_3, P_client_idle_4, P_client_idle_5, P_client_idle_6, P_client_idle_7, P_client_idle_8, P_client_idle_9, P_client_idle_10, P_client_idle_11, P_client_idle_12, P_client_idle_13, P_client_idle_14, P_client_idle_15, P_client_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_waiting_6, P_client_waiting_7, P_client_waiting_8, P_client_waiting_9, P_client_waiting_10, P_client_waiting_11, P_client_waiting_12, P_client_waiting_13, P_client_waiting_14, P_client_waiting_15, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_request_6, P_client_request_7, P_client_request_8, P_client_request_9, P_client_request_10, P_client_request_11, P_client_request_12, P_client_request_13, P_client_request_14, P_client_request_15, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, P_client_ack_6, P_client_ack_7, P_client_ack_8, P_client_ack_9, P_client_ack_10, P_client_ack_11, P_client_ack_12, P_client_ack_13, P_client_ack_14, P_client_ack_15, P_server_idle_1, P_server_idle_2, P_server_waiting_1, P_server_waiting_2, P_server_processed_1, P_server_processed_2, P_server_notification_1, P_server_notification_2, P_server_notification_ack_1, P_server_notification_ack_2, P_server_request_1_1, P_server_request_1_2, P_server_request_2_1, P_server_request_2_2, P_server_request_3_1, P_server_request_3_2, P_server_request_4_1, P_server_request_4_2, P_server_request_5_1, P_server_request_5_2, P_server_request_6_1, P_server_request_6_2, P_server_request_7_1, P_server_request_7_2, P_server_request_8_1, P_server_request_8_2, P_server_request_9_1, P_server_request_9_2, P_server_request_10_1, P_server_request_10_2, P_server_request_11_1, P_server_request_11_2, P_server_request_12_1, P_server_request_12_2, P_server_request_13_1, P_server_request_13_2, P_server_request_14_1, P_server_request_14_2, P_server_request_15_1, P_server_request_15_2, P_lb_idle_1, P_lb_routing_1_1, P_lb_routing_1_2, P_lb_routing_1_3, P_lb_routing_1_4, P_lb_routing_1_5, P_lb_routing_1_6, P_lb_routing_1_7, P_lb_routing_1_8, P_lb_routing_1_9, P_lb_routing_1_10, P_lb_routing_1_11, P_lb_routing_1_12, P_lb_routing_1_13, P_lb_routing_1_14, P_lb_routing_1_15, P_lb_balancing_1, P_lb_load_1_0, P_lb_load_1_1, P_lb_load_1_2, P_lb_load_1_3, P_lb_load_1_4, P_lb_load_1_5, P_lb_load_1_6, P_lb_load_1_7, P_lb_load_1_8, P_lb_load_1_9, P_lb_load_1_10, P_lb_load_1_11, P_lb_load_1_12, P_lb_load_1_13, P_lb_load_1_14, P_lb_load_1_15, P_lb_load_2_0, P_lb_load_2_1, P_lb_load_2_2, P_lb_load_2_3, P_lb_load_2_4, P_lb_load_2_5, P_lb_load_2_6, P_lb_load_2_7, P_lb_load_2_8, P_lb_load_2_9, P_lb_load_2_10, P_lb_load_2_11, P_lb_load_2_12, P_lb_load_2_13, P_lb_load_2_14, P_lb_load_2_15]
[2024-05-29 05:42:39] [INFO ] Parsed PT model containing 149 places and 1280 transitions and 8988 arcs in 461 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 99 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA SimpleLoadBal-PT-15-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 1280/1280 transitions.
Applied a total of 0 rules in 41 ms. Remains 149 /149 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2024-05-29 05:42:40] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
// Phase 1: matrix 1010 rows 149 cols
[2024-05-29 05:42:40] [INFO ] Computed 39 invariants in 64 ms
[2024-05-29 05:42:40] [INFO ] Implicit Places using invariants in 801 ms returned [15, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 62, 63]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 874 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/149 places, 1280/1280 transitions.
Applied a total of 0 rules in 21 ms. Remains 134 /134 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 966 ms. Remains : 134/149 places, 1280/1280 transitions.
Support contains 50 out of 134 places after structural reductions.
[2024-05-29 05:42:41] [INFO ] Flatten gal took : 341 ms
[2024-05-29 05:42:41] [INFO ] Flatten gal took : 218 ms
[2024-05-29 05:42:42] [INFO ] Input system was already deterministic with 1280 transitions.
Reduction of identical properties reduced properties to check from 28 to 27
RANDOM walk for 40000 steps (8 resets) in 3149 ms. (12 steps per ms) remains 14/27 properties
BEST_FIRST walk for 40003 steps (8 resets) in 296 ms. (134 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 220 ms. (181 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 175 ms. (227 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 165 ms. (240 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 182 ms. (218 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 12/12 properties
[2024-05-29 05:42:43] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
// Phase 1: matrix 1010 rows 134 cols
[2024-05-29 05:42:44] [INFO ] Computed 24 invariants in 30 ms
[2024-05-29 05:42:44] [INFO ] State equation strengthened by 465 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 2 (OVERLAPS) 59/86 variables, 11/38 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 59/97 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 30/116 variables, 6/103 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 30/133 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/117 variables, 1/134 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 1/135 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 14/131 variables, 4/139 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/131 variables, 14/153 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/131 variables, 0/153 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/134 variables, 2/155 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/134 variables, 3/158 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/134 variables, 0/158 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1010/1144 variables, 134/292 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1144 variables, 465/757 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1144 variables, 0/757 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1144 variables, 0/757 constraints. Problems are: Problem set: 10 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1144/1144 variables, and 757 constraints, problems are : Problem set: 10 solved, 2 unsolved in 2024 ms.
Refiners :[Domain max(s): 134/134 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 134/134 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 38/44 variables, 4/10 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 38/48 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/48 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/109 variables, 13/61 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 65/126 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/126 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/110 variables, 1/127 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 1/128 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 0/128 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 21/131 variables, 4/132 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/131 variables, 21/153 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/131 variables, 0/153 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/134 variables, 2/155 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/134 variables, 3/158 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/134 variables, 0/158 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1010/1144 variables, 134/292 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1144 variables, 465/757 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1144 variables, 2/759 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1144 variables, 0/759 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1144 variables, 0/759 constraints. Problems are: Problem set: 10 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 759 constraints, problems are : Problem set: 10 solved, 2 unsolved in 2592 ms.
Refiners :[Domain max(s): 134/134 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 134/134 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 2/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 5134ms problems are : Problem set: 10 solved, 2 unsolved
Parikh walk visited 0 properties in 8965 ms.
Support contains 6 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 1280/1280 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 134 transition count 1266
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 120 transition count 1266
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 6 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 58 place count 105 transition count 1251
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 101 transition count 1249
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 99 transition count 1247
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 82 place count 99 transition count 1233
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 96 place count 85 transition count 1233
Applied a total of 96 rules in 428 ms. Remains 85 /134 variables (removed 49) and now considering 1233/1280 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 429 ms. Remains : 85/134 places, 1233/1280 transitions.
RANDOM walk for 40000 steps (8 resets) in 942 ms. (42 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
[2024-05-29 05:42:58] [INFO ] Flow matrix only has 963 transitions (discarded 270 similar events)
// Phase 1: matrix 963 rows 85 cols
[2024-05-29 05:42:58] [INFO ] Computed 22 invariants in 16 ms
[2024-05-29 05:42:58] [INFO ] State equation strengthened by 465 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 4/7 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/10 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 60/70 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 60/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/85 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/85 variables, 15/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/85 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 963/1048 variables, 85/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1048 variables, 465/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1048 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1048 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 657 constraints, problems are : Problem set: 0 solved, 1 unsolved in 785 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 85/85 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 4/7 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/10 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 60/70 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 60/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/85 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/85 variables, 15/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/85 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 963/1048 variables, 85/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1048 variables, 465/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1048 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 05:43:00] [INFO ] Deduced a trap composed of 36 places in 269 ms of which 13 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1048 variables, 1/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1048 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1048 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 659 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1626 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 85/85 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2501ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 843 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1233/1233 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 1232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 1232
Applied a total of 2 rules in 188 ms. Remains 84 /85 variables (removed 1) and now considering 1232/1233 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 84/85 places, 1232/1233 transitions.
RANDOM walk for 40000 steps (8 resets) in 846 ms. (47 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 403029 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 1
Probabilistic random walk after 403029 steps, saw 237682 distinct states, run finished after 3006 ms. (steps per millisecond=134 ) properties seen :0
[2024-05-29 05:43:05] [INFO ] Flow matrix only has 962 transitions (discarded 270 similar events)
// Phase 1: matrix 962 rows 84 cols
[2024-05-29 05:43:05] [INFO ] Computed 22 invariants in 11 ms
[2024-05-29 05:43:05] [INFO ] State equation strengthened by 465 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3/6 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/36 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/64 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 28/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/82 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/82 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/82 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/84 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/84 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/84 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 962/1046 variables, 84/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1046 variables, 465/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1046 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1046/1046 variables, and 655 constraints, problems are : Problem set: 0 solved, 1 unsolved in 637 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 84/84 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3/6 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/36 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/64 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 28/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/82 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/82 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/82 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/84 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/84 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/84 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 962/1046 variables, 84/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1046 variables, 465/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 1/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 05:43:07] [INFO ] Deduced a trap composed of 32 places in 276 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 1/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1046 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1046 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1046/1046 variables, and 657 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1471 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 84/84 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2168ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 978 ms.
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 1232/1232 transitions.
Applied a total of 0 rules in 184 ms. Remains 84 /84 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 84/84 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 1232/1232 transitions.
Applied a total of 0 rules in 151 ms. Remains 84 /84 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2024-05-29 05:43:09] [INFO ] Flow matrix only has 962 transitions (discarded 270 similar events)
[2024-05-29 05:43:09] [INFO ] Invariant cache hit.
[2024-05-29 05:43:09] [INFO ] Implicit Places using invariants in 663 ms returned []
[2024-05-29 05:43:09] [INFO ] Flow matrix only has 962 transitions (discarded 270 similar events)
[2024-05-29 05:43:09] [INFO ] Invariant cache hit.
[2024-05-29 05:43:10] [INFO ] State equation strengthened by 465 read => feed constraints.
[2024-05-29 05:43:11] [INFO ] Implicit Places using invariants and state equation in 1791 ms returned []
Implicit Place search using SMT with State Equation took 2458 ms to find 0 implicit places.
[2024-05-29 05:43:11] [INFO ] Redundant transitions in 127 ms returned []
Running 1217 sub problems to find dead transitions.
[2024-05-29 05:43:11] [INFO ] Flow matrix only has 962 transitions (discarded 270 similar events)
[2024-05-29 05:43:11] [INFO ] Invariant cache hit.
[2024-05-29 05:43:11] [INFO ] State equation strengthened by 465 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 1217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 1217 unsolved
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 4/106 constraints. Problems are: Problem set: 499 solved, 718 unsolved
[2024-05-29 05:43:35] [INFO ] Deduced a trap composed of 36 places in 332 ms of which 3 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-29 05:43:35] [INFO ] Deduced a trap composed of 18 places in 423 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-29 05:43:37] [INFO ] Deduced a trap composed of 33 places in 280 ms of which 2 ms to minimize.
[2024-05-29 05:43:38] [INFO ] Deduced a trap composed of 40 places in 282 ms of which 2 ms to minimize.
[2024-05-29 05:43:39] [INFO ] Deduced a trap composed of 18 places in 352 ms of which 2 ms to minimize.
[2024-05-29 05:43:39] [INFO ] Deduced a trap composed of 18 places in 338 ms of which 2 ms to minimize.
[2024-05-29 05:43:39] [INFO ] Deduced a trap composed of 20 places in 293 ms of which 1 ms to minimize.
[2024-05-29 05:43:40] [INFO ] Deduced a trap composed of 20 places in 311 ms of which 2 ms to minimize.
[2024-05-29 05:43:40] [INFO ] Deduced a trap composed of 19 places in 339 ms of which 2 ms to minimize.
[2024-05-29 05:43:40] [INFO ] Deduced a trap composed of 19 places in 331 ms of which 1 ms to minimize.
[2024-05-29 05:43:41] [INFO ] Deduced a trap composed of 19 places in 418 ms of which 2 ms to minimize.
[2024-05-29 05:43:41] [INFO ] Deduced a trap composed of 20 places in 331 ms of which 1 ms to minimize.
[2024-05-29 05:43:41] [INFO ] Deduced a trap composed of 21 places in 317 ms of which 1 ms to minimize.
[2024-05-29 05:43:42] [INFO ] Deduced a trap composed of 21 places in 328 ms of which 2 ms to minimize.
[2024-05-29 05:43:42] [INFO ] Deduced a trap composed of 21 places in 321 ms of which 1 ms to minimize.
[2024-05-29 05:43:42] [INFO ] Deduced a trap composed of 21 places in 310 ms of which 2 ms to minimize.
[2024-05-29 05:43:43] [INFO ] Deduced a trap composed of 19 places in 317 ms of which 2 ms to minimize.
[2024-05-29 05:43:43] [INFO ] Deduced a trap composed of 18 places in 381 ms of which 2 ms to minimize.
[2024-05-29 05:43:43] [INFO ] Deduced a trap composed of 20 places in 371 ms of which 1 ms to minimize.
Problem TDEAD520 is UNSAT
[2024-05-29 05:43:44] [INFO ] Deduced a trap composed of 20 places in 360 ms of which 5 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 20/126 constraints. Problems are: Problem set: 510 solved, 707 unsolved
[2024-05-29 05:43:50] [INFO ] Deduced a trap composed of 20 places in 301 ms of which 2 ms to minimize.
[2024-05-29 05:43:50] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 4 ms to minimize.
[2024-05-29 05:43:50] [INFO ] Deduced a trap composed of 20 places in 320 ms of which 1 ms to minimize.
[2024-05-29 05:43:51] [INFO ] Deduced a trap composed of 22 places in 245 ms of which 2 ms to minimize.
[2024-05-29 05:43:51] [INFO ] Deduced a trap composed of 22 places in 312 ms of which 2 ms to minimize.
[2024-05-29 05:43:51] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 1 ms to minimize.
[2024-05-29 05:43:52] [INFO ] Deduced a trap composed of 22 places in 316 ms of which 2 ms to minimize.
[2024-05-29 05:43:52] [INFO ] Deduced a trap composed of 24 places in 317 ms of which 1 ms to minimize.
[2024-05-29 05:43:52] [INFO ] Deduced a trap composed of 22 places in 317 ms of which 2 ms to minimize.
[2024-05-29 05:43:52] [INFO ] Deduced a trap composed of 22 places in 319 ms of which 2 ms to minimize.
[2024-05-29 05:43:53] [INFO ] Deduced a trap composed of 23 places in 323 ms of which 2 ms to minimize.
[2024-05-29 05:43:53] [INFO ] Deduced a trap composed of 21 places in 370 ms of which 3 ms to minimize.
[2024-05-29 05:43:54] [INFO ] Deduced a trap composed of 19 places in 334 ms of which 4 ms to minimize.
[2024-05-29 05:43:54] [INFO ] Deduced a trap composed of 22 places in 321 ms of which 1 ms to minimize.
[2024-05-29 05:43:54] [INFO ] Deduced a trap composed of 19 places in 390 ms of which 2 ms to minimize.
[2024-05-29 05:43:55] [INFO ] Deduced a trap composed of 20 places in 292 ms of which 2 ms to minimize.
[2024-05-29 05:43:55] [INFO ] Deduced a trap composed of 19 places in 299 ms of which 1 ms to minimize.
[2024-05-29 05:43:55] [INFO ] Deduced a trap composed of 22 places in 293 ms of which 1 ms to minimize.
[2024-05-29 05:43:56] [INFO ] Deduced a trap composed of 20 places in 343 ms of which 1 ms to minimize.
Problem TDEAD519 is UNSAT
[2024-05-29 05:43:56] [INFO ] Deduced a trap composed of 18 places in 284 ms of which 2 ms to minimize.
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD531 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 20/146 constraints. Problems are: Problem set: 513 solved, 704 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 84/1046 variables, and 146 constraints, problems are : Problem set: 513 solved, 704 unsolved in 30053 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/84 constraints, ReadFeed: 0/465 constraints, PredecessorRefiner: 1217/1217 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 513 solved, 704 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 513 solved, 704 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 18/102 constraints. Problems are: Problem set: 513 solved, 704 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 4/106 constraints. Problems are: Problem set: 513 solved, 704 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 40/146 constraints. Problems are: Problem set: 513 solved, 704 unsolved
[2024-05-29 05:44:03] [INFO ] Deduced a trap composed of 21 places in 344 ms of which 2 ms to minimize.
[2024-05-29 05:44:03] [INFO ] Deduced a trap composed of 19 places in 343 ms of which 2 ms to minimize.
[2024-05-29 05:44:04] [INFO ] Deduced a trap composed of 19 places in 331 ms of which 1 ms to minimize.
[2024-05-29 05:44:04] [INFO ] Deduced a trap composed of 19 places in 327 ms of which 1 ms to minimize.
[2024-05-29 05:44:04] [INFO ] Deduced a trap composed of 19 places in 329 ms of which 1 ms to minimize.
[2024-05-29 05:44:05] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 1 ms to minimize.
Problem TDEAD517 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 6/152 constraints. Problems are: Problem set: 514 solved, 703 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/152 constraints. Problems are: Problem set: 514 solved, 703 unsolved
At refinement iteration 6 (OVERLAPS) 962/1046 variables, 84/236 constraints. Problems are: Problem set: 514 solved, 703 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1046 variables, 465/701 constraints. Problems are: Problem set: 514 solved, 703 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1046/1046 variables, and 1404 constraints, problems are : Problem set: 514 solved, 703 unsolved in 31179 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 84/84 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 703/1217 constraints, Known Traps: 46/46 constraints]
After SMT, in 77716ms problems are : Problem set: 514 solved, 703 unsolved
Search for dead transitions found 514 dead transitions in 77742ms
Found 514 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 514 transitions
Dead transitions reduction (with SMT) removed 514 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 84/84 places, 718/1232 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 83 transition count 716
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 81 transition count 714
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 5 place count 79 transition count 712
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 7 place count 77 transition count 710
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 9 place count 75 transition count 708
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 11 place count 73 transition count 706
Reduce places removed 1 places and 16 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 12 place count 72 transition count 690
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 12 rules in 50 ms. Remains 72 /84 variables (removed 12) and now considering 690/718 (removed 28) transitions.
[2024-05-29 05:44:29] [INFO ] Flow matrix only has 546 transitions (discarded 144 similar events)
// Phase 1: matrix 546 rows 72 cols
[2024-05-29 05:44:29] [INFO ] Computed 23 invariants in 9 ms
[2024-05-29 05:44:29] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-29 05:44:29] [INFO ] Flow matrix only has 546 transitions (discarded 144 similar events)
[2024-05-29 05:44:29] [INFO ] Invariant cache hit.
[2024-05-29 05:44:30] [INFO ] State equation strengthened by 257 read => feed constraints.
[2024-05-29 05:44:30] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 72/84 places, 690/1232 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 81540 ms. Remains : 72/84 places, 690/1232 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 12 atomic propositions for a total of 14 simplifications.
FORMULA SimpleLoadBal-PT-15-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA SimpleLoadBal-PT-15-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 1280/1280 transitions.
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 0 place count 134 transition count 1265
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 119 transition count 1265
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 104 transition count 1250
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 100 transition count 1248
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 98 transition count 1246
Applied a total of 70 rules in 230 ms. Remains 98 /134 variables (removed 36) and now considering 1246/1280 (removed 34) transitions.
[2024-05-29 05:44:31] [INFO ] Flow matrix only has 976 transitions (discarded 270 similar events)
// Phase 1: matrix 976 rows 98 cols
[2024-05-29 05:44:31] [INFO ] Computed 22 invariants in 13 ms
[2024-05-29 05:44:31] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-29 05:44:31] [INFO ] Flow matrix only has 976 transitions (discarded 270 similar events)
[2024-05-29 05:44:31] [INFO ] Invariant cache hit.
[2024-05-29 05:44:31] [INFO ] State equation strengthened by 465 read => feed constraints.
[2024-05-29 05:44:33] [INFO ] Implicit Places using invariants and state equation in 1944 ms returned []
Implicit Place search using SMT with State Equation took 2380 ms to find 0 implicit places.
[2024-05-29 05:44:33] [INFO ] Redundant transitions in 79 ms returned []
Running 1231 sub problems to find dead transitions.
[2024-05-29 05:44:33] [INFO ] Flow matrix only has 976 transitions (discarded 270 similar events)
[2024-05-29 05:44:33] [INFO ] Invariant cache hit.
[2024-05-29 05:44:33] [INFO ] State equation strengthened by 465 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 3 (OVERLAPS) 14/97 variables, 14/101 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 14/115 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
SMT process timed out in 40492ms, After SMT, problems are : Problem set: 0 solved, 1231 unsolved
Search for dead transitions found 0 dead transitions in 40519ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/134 places, 1246/1280 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43227 ms. Remains : 98/134 places, 1246/1280 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SimpleLoadBal-PT-15-LTLFireability-02
Product exploration explored 100000 steps with 145 reset in 1071 ms.
Stack based approach found an accepted trace after 81 steps with 0 reset with depth 82 and stack size 82 in 1 ms.
FORMULA SimpleLoadBal-PT-15-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-15-LTLFireability-02 finished in 44663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))))'
Support contains 7 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 1280/1280 transitions.
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 0 place count 134 transition count 1265
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 119 transition count 1265
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 104 transition count 1250
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 100 transition count 1248
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 98 transition count 1246
Applied a total of 70 rules in 91 ms. Remains 98 /134 variables (removed 36) and now considering 1246/1280 (removed 34) transitions.
[2024-05-29 05:45:15] [INFO ] Flow matrix only has 976 transitions (discarded 270 similar events)
[2024-05-29 05:45:15] [INFO ] Invariant cache hit.
[2024-05-29 05:45:16] [INFO ] Implicit Places using invariants in 553 ms returned []
[2024-05-29 05:45:16] [INFO ] Flow matrix only has 976 transitions (discarded 270 similar events)
[2024-05-29 05:45:16] [INFO ] Invariant cache hit.
[2024-05-29 05:45:16] [INFO ] State equation strengthened by 465 read => feed constraints.
[2024-05-29 05:45:18] [INFO ] Implicit Places using invariants and state equation in 1973 ms returned []
Implicit Place search using SMT with State Equation took 2535 ms to find 0 implicit places.
[2024-05-29 05:45:18] [INFO ] Redundant transitions in 17 ms returned []
Running 1231 sub problems to find dead transitions.
[2024-05-29 05:45:18] [INFO ] Flow matrix only has 976 transitions (discarded 270 similar events)
[2024-05-29 05:45:18] [INFO ] Invariant cache hit.
[2024-05-29 05:45:18] [INFO ] State equation strengthened by 465 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 3 (OVERLAPS) 14/97 variables, 14/101 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 14/115 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/98 variables, 3/119 constraints. Problems are: Problem set: 499 solved, 732 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 1/120 constraints. Problems are: Problem set: 499 solved, 732 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 Real declared 98/1074 variables, and 120 constraints, problems are : Problem set: 499 solved, 732 unsolved in 30026 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/98 constraints, ReadFeed: 0/465 constraints, PredecessorRefiner: 1231/1231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 499 solved, 732 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 499 solved, 732 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 4/87 constraints. Problems are: Problem set: 499 solved, 732 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/87 constraints. Problems are: Problem set: 499 solved, 732 unsolved
At refinement iteration 3 (OVERLAPS) 14/97 variables, 14/101 constraints. Problems are: Problem set: 499 solved, 732 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 14/115 constraints. Problems are: Problem set: 499 solved, 732 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 1/116 constraints. Problems are: Problem set: 499 solved, 732 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/116 constraints. Problems are: Problem set: 499 solved, 732 unsolved
At refinement iteration 7 (OVERLAPS) 1/98 variables, 3/119 constraints. Problems are: Problem set: 499 solved, 732 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 1/120 constraints. Problems are: Problem set: 499 solved, 732 unsolved
[2024-05-29 05:46:13] [INFO ] Deduced a trap composed of 50 places in 429 ms of which 2 ms to minimize.
Problem TDEAD702 is UNSAT
[2024-05-29 05:46:13] [INFO ] Deduced a trap composed of 35 places in 317 ms of which 2 ms to minimize.
Problem TDEAD703 is UNSAT
[2024-05-29 05:46:14] [INFO ] Deduced a trap composed of 47 places in 291 ms of which 1 ms to minimize.
[2024-05-29 05:46:15] [INFO ] Deduced a trap composed of 48 places in 264 ms of which 2 ms to minimize.
[2024-05-29 05:46:16] [INFO ] Deduced a trap composed of 18 places in 361 ms of which 1 ms to minimize.
[2024-05-29 05:46:16] [INFO ] Deduced a trap composed of 21 places in 287 ms of which 1 ms to minimize.
[2024-05-29 05:46:16] [INFO ] Deduced a trap composed of 18 places in 372 ms of which 2 ms to minimize.
[2024-05-29 05:46:17] [INFO ] Deduced a trap composed of 19 places in 376 ms of which 3 ms to minimize.
[2024-05-29 05:46:17] [INFO ] Deduced a trap composed of 21 places in 376 ms of which 1 ms to minimize.
[2024-05-29 05:46:17] [INFO ] Deduced a trap composed of 19 places in 362 ms of which 2 ms to minimize.
[2024-05-29 05:46:18] [INFO ] Deduced a trap composed of 19 places in 379 ms of which 2 ms to minimize.
[2024-05-29 05:46:18] [INFO ] Deduced a trap composed of 20 places in 385 ms of which 1 ms to minimize.
[2024-05-29 05:46:19] [INFO ] Deduced a trap composed of 22 places in 373 ms of which 2 ms to minimize.
[2024-05-29 05:46:19] [INFO ] Deduced a trap composed of 21 places in 304 ms of which 1 ms to minimize.
[2024-05-29 05:46:19] [INFO ] Deduced a trap composed of 20 places in 338 ms of which 1 ms to minimize.
[2024-05-29 05:46:20] [INFO ] Deduced a trap composed of 22 places in 366 ms of which 2 ms to minimize.
[2024-05-29 05:46:20] [INFO ] Deduced a trap composed of 20 places in 358 ms of which 2 ms to minimize.
[2024-05-29 05:46:20] [INFO ] Deduced a trap composed of 20 places in 372 ms of which 2 ms to minimize.
[2024-05-29 05:46:21] [INFO ] Deduced a trap composed of 20 places in 409 ms of which 1 ms to minimize.
[2024-05-29 05:46:21] [INFO ] Deduced a trap composed of 20 places in 348 ms of which 2 ms to minimize.
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 20/140 constraints. Problems are: Problem set: 511 solved, 720 unsolved
[2024-05-29 05:46:27] [INFO ] Deduced a trap composed of 20 places in 382 ms of which 2 ms to minimize.
SMT process timed out in 69720ms, After SMT, problems are : Problem set: 511 solved, 720 unsolved
Search for dead transitions found 511 dead transitions in 69736ms
Found 511 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 511 transitions
Dead transitions reduction (with SMT) removed 511 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 98/134 places, 735/1280 transitions.
Reduce places removed 2 places and 2 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 94 transition count 731
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 92 transition count 729
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 90 transition count 727
Reduce places removed 2 places and 3 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8 place count 88 transition count 724
Reduce places removed 2 places and 3 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 10 place count 86 transition count 721
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 11 place count 85 transition count 704
Applied a total of 11 rules in 82 ms. Remains 85 /98 variables (removed 13) and now considering 704/735 (removed 31) transitions.
[2024-05-29 05:46:27] [INFO ] Flow matrix only has 560 transitions (discarded 144 similar events)
// Phase 1: matrix 560 rows 85 cols
[2024-05-29 05:46:27] [INFO ] Computed 22 invariants in 5 ms
[2024-05-29 05:46:28] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-29 05:46:28] [INFO ] Flow matrix only has 560 transitions (discarded 144 similar events)
[2024-05-29 05:46:28] [INFO ] Invariant cache hit.
[2024-05-29 05:46:28] [INFO ] State equation strengthened by 257 read => feed constraints.
[2024-05-29 05:46:28] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 972 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/134 places, 704/1280 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 73447 ms. Remains : 85/134 places, 704/1280 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : SimpleLoadBal-PT-15-LTLFireability-04
Product exploration explored 100000 steps with 27 reset in 758 ms.
Product exploration explored 100000 steps with 23 reset in 714 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 124 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 3394 steps (0 resets) in 54 ms. (61 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 7 factoid took 218 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 77 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1)]
Support contains 7 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 704/704 transitions.
Applied a total of 0 rules in 23 ms. Remains 85 /85 variables (removed 0) and now considering 704/704 (removed 0) transitions.
[2024-05-29 05:46:31] [INFO ] Flow matrix only has 560 transitions (discarded 144 similar events)
[2024-05-29 05:46:31] [INFO ] Invariant cache hit.
[2024-05-29 05:46:31] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-29 05:46:31] [INFO ] Flow matrix only has 560 transitions (discarded 144 similar events)
[2024-05-29 05:46:31] [INFO ] Invariant cache hit.
[2024-05-29 05:46:31] [INFO ] State equation strengthened by 257 read => feed constraints.
[2024-05-29 05:46:32] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1190 ms to find 0 implicit places.
[2024-05-29 05:46:32] [INFO ] Redundant transitions in 5 ms returned []
Running 689 sub problems to find dead transitions.
[2024-05-29 05:46:32] [INFO ] Flow matrix only has 560 transitions (discarded 144 similar events)
[2024-05-29 05:46:32] [INFO ] Invariant cache hit.
[2024-05-29 05:46:32] [INFO ] State equation strengthened by 257 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 4 (OVERLAPS) 15/85 variables, 15/90 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 15/105 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 689 unsolved
[2024-05-29 05:46:50] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 1 ms to minimize.
[2024-05-29 05:46:50] [INFO ] Deduced a trap composed of 12 places in 270 ms of which 2 ms to minimize.
[2024-05-29 05:46:50] [INFO ] Deduced a trap composed of 14 places in 271 ms of which 2 ms to minimize.
[2024-05-29 05:46:51] [INFO ] Deduced a trap composed of 12 places in 265 ms of which 2 ms to minimize.
[2024-05-29 05:46:51] [INFO ] Deduced a trap composed of 12 places in 269 ms of which 2 ms to minimize.
[2024-05-29 05:46:51] [INFO ] Deduced a trap composed of 13 places in 255 ms of which 2 ms to minimize.
[2024-05-29 05:46:52] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 1 ms to minimize.
[2024-05-29 05:46:52] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 8/115 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 9 (OVERLAPS) 560/645 variables, 85/200 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/645 variables, 257/457 constraints. Problems are: Problem set: 0 solved, 689 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 645/645 variables, and 457 constraints, problems are : Problem set: 0 solved, 689 unsolved in 30035 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 85/85 constraints, ReadFeed: 257/257 constraints, PredecessorRefiner: 689/689 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 689 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 5 (OVERLAPS) 15/85 variables, 15/97 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 15/112 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 689 unsolved
[2024-05-29 05:47:15] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 2 ms to minimize.
[2024-05-29 05:47:15] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 1 ms to minimize.
[2024-05-29 05:47:15] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 11 (OVERLAPS) 560/645 variables, 85/203 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/645 variables, 257/460 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/645 variables, 689/1149 constraints. Problems are: Problem set: 0 solved, 689 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 1149 constraints, problems are : Problem set: 0 solved, 689 unsolved in 30030 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 85/85 constraints, ReadFeed: 257/257 constraints, PredecessorRefiner: 689/689 constraints, Known Traps: 11/11 constraints]
After SMT, in 62672ms problems are : Problem set: 0 solved, 689 unsolved
Search for dead transitions found 0 dead transitions in 62680ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63907 ms. Remains : 85/85 places, 704/704 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 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 76 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 2738 steps (0 resets) in 39 ms. (68 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 125 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 93 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 40 reset in 937 ms.
Product exploration explored 100000 steps with 38 reset in 722 ms.
Built C files in :
/tmp/ltsmin10672889757370046090
[2024-05-29 05:47:37] [INFO ] Computing symmetric may disable matrix : 704 transitions.
[2024-05-29 05:47:37] [INFO ] Computation of Complete disable matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:47:37] [INFO ] Computing symmetric may enable matrix : 704 transitions.
[2024-05-29 05:47:37] [INFO ] Computation of Complete enable matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:47:37] [INFO ] Computing Do-Not-Accords matrix : 704 transitions.
[2024-05-29 05:47:37] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:47:37] [INFO ] Built C files in 265ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10672889757370046090
Running compilation step : cd /tmp/ltsmin10672889757370046090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10672889757370046090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10672889757370046090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 7 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 704/704 transitions.
Applied a total of 0 rules in 44 ms. Remains 85 /85 variables (removed 0) and now considering 704/704 (removed 0) transitions.
[2024-05-29 05:47:40] [INFO ] Flow matrix only has 560 transitions (discarded 144 similar events)
[2024-05-29 05:47:40] [INFO ] Invariant cache hit.
[2024-05-29 05:47:41] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-29 05:47:41] [INFO ] Flow matrix only has 560 transitions (discarded 144 similar events)
[2024-05-29 05:47:41] [INFO ] Invariant cache hit.
[2024-05-29 05:47:41] [INFO ] State equation strengthened by 257 read => feed constraints.
[2024-05-29 05:47:42] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
[2024-05-29 05:47:42] [INFO ] Redundant transitions in 4 ms returned []
Running 689 sub problems to find dead transitions.
[2024-05-29 05:47:42] [INFO ] Flow matrix only has 560 transitions (discarded 144 similar events)
[2024-05-29 05:47:42] [INFO ] Invariant cache hit.
[2024-05-29 05:47:42] [INFO ] State equation strengthened by 257 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 4 (OVERLAPS) 15/85 variables, 15/90 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 15/105 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 689 unsolved
[2024-05-29 05:47:58] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 2 ms to minimize.
[2024-05-29 05:47:59] [INFO ] Deduced a trap composed of 12 places in 223 ms of which 1 ms to minimize.
[2024-05-29 05:47:59] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 2 ms to minimize.
[2024-05-29 05:47:59] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 2 ms to minimize.
[2024-05-29 05:47:59] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 2 ms to minimize.
[2024-05-29 05:48:00] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 2 ms to minimize.
[2024-05-29 05:48:00] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 2 ms to minimize.
[2024-05-29 05:48:00] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 8/115 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 9 (OVERLAPS) 560/645 variables, 85/200 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/645 variables, 257/457 constraints. Problems are: Problem set: 0 solved, 689 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 645/645 variables, and 457 constraints, problems are : Problem set: 0 solved, 689 unsolved in 30022 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 85/85 constraints, ReadFeed: 257/257 constraints, PredecessorRefiner: 689/689 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 689 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 5 (OVERLAPS) 15/85 variables, 15/97 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 15/112 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 689 unsolved
[2024-05-29 05:48:24] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 2 ms to minimize.
[2024-05-29 05:48:24] [INFO ] Deduced a trap composed of 14 places in 265 ms of which 1 ms to minimize.
[2024-05-29 05:48:24] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 11 (OVERLAPS) 560/645 variables, 85/203 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/645 variables, 257/460 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/645 variables, 689/1149 constraints. Problems are: Problem set: 0 solved, 689 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 1149 constraints, problems are : Problem set: 0 solved, 689 unsolved in 30024 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 85/85 constraints, ReadFeed: 257/257 constraints, PredecessorRefiner: 689/689 constraints, Known Traps: 11/11 constraints]
After SMT, in 62734ms problems are : Problem set: 0 solved, 689 unsolved
Search for dead transitions found 0 dead transitions in 62744ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63902 ms. Remains : 85/85 places, 704/704 transitions.
Built C files in :
/tmp/ltsmin13510578083869012266
[2024-05-29 05:48:44] [INFO ] Computing symmetric may disable matrix : 704 transitions.
[2024-05-29 05:48:44] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:48:44] [INFO ] Computing symmetric may enable matrix : 704 transitions.
[2024-05-29 05:48:44] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:48:44] [INFO ] Computing Do-Not-Accords matrix : 704 transitions.
[2024-05-29 05:48:44] [INFO ] Computation of Completed DNA matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:48:45] [INFO ] Built C files in 203ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13510578083869012266
Running compilation step : cd /tmp/ltsmin13510578083869012266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13510578083869012266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13510578083869012266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 05:48:48] [INFO ] Flatten gal took : 51 ms
[2024-05-29 05:48:48] [INFO ] Flatten gal took : 46 ms
[2024-05-29 05:48:48] [INFO ] Time to serialize gal into /tmp/LTL5092188463418700964.gal : 19 ms
[2024-05-29 05:48:48] [INFO ] Time to serialize properties into /tmp/LTL2352227952803761203.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5092188463418700964.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1295060902821592223.hoa' '-atoms' '/tmp/LTL2352227952803761203.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2352227952803761203.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1295060902821592223.hoa
Detected timeout of ITS tools.
[2024-05-29 05:49:03] [INFO ] Flatten gal took : 42 ms
[2024-05-29 05:49:03] [INFO ] Flatten gal took : 42 ms
[2024-05-29 05:49:03] [INFO ] Time to serialize gal into /tmp/LTL9010222727761924987.gal : 10 ms
[2024-05-29 05:49:03] [INFO ] Time to serialize properties into /tmp/LTL5279238290516386790.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9010222727761924987.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5279238290516386790.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G("(((P_lb_routing_1_6==1)&&(P_lb_load_1_4==1))&&(P_lb_load_2_3==1))"))||(G(F("(((P_lb_routing_1_6==0)||(P_lb_load_1_4==0))||((P_l...273
Formula 0 simplified : F!"(((P_lb_routing_1_6==1)&&(P_lb_load_1_4==1))&&(P_lb_load_2_3==1))" & FG!"(((P_lb_routing_1_6==0)||(P_lb_load_1_4==0))||((P_lb_loa...263
Detected timeout of ITS tools.
[2024-05-29 05:49:18] [INFO ] Flatten gal took : 51 ms
[2024-05-29 05:49:18] [INFO ] Applying decomposition
[2024-05-29 05:49:18] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2959917751470278203.txt' '-o' '/tmp/graph2959917751470278203.bin' '-w' '/tmp/graph2959917751470278203.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2959917751470278203.bin' '-l' '-1' '-v' '-w' '/tmp/graph2959917751470278203.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:49:18] [INFO ] Decomposing Gal with order
[2024-05-29 05:49:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:49:19] [INFO ] Removed a total of 2143 redundant transitions.
[2024-05-29 05:49:19] [INFO ] Flatten gal took : 241 ms
[2024-05-29 05:49:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 40 ms.
[2024-05-29 05:49:19] [INFO ] Time to serialize gal into /tmp/LTL13092255400202376873.gal : 12 ms
[2024-05-29 05:49:19] [INFO ] Time to serialize properties into /tmp/LTL8620742076680474606.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13092255400202376873.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8620742076680474606.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G("(((u14.P_lb_routing_1_6==1)&&(u20.P_lb_load_1_4==1))&&(u20.P_lb_load_2_3==1))"))||(G(F("(((u14.P_lb_routing_1_6==0)||(u20.P_lb_...320
Formula 0 simplified : F!"(((u14.P_lb_routing_1_6==1)&&(u20.P_lb_load_1_4==1))&&(u20.P_lb_load_2_3==1))" & FG!"(((u14.P_lb_routing_1_6==0)||(u20.P_lb_load_...310
Reverse transition relation is NOT exact ! Due to transitions t805, t1145, t1146, t1147, t1148, t1149, t1150, t1151, t1152, t1153, t1154, t1155, t1156, t11...737
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
143 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.50967,60212,1,0,93708,710,5337,84002,299,2456,327971
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SimpleLoadBal-PT-15-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property SimpleLoadBal-PT-15-LTLFireability-04 finished in 245616 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 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 1280/1280 transitions.
Applied a total of 0 rules in 4 ms. Remains 134 /134 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2024-05-29 05:49:21] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
// Phase 1: matrix 1010 rows 134 cols
[2024-05-29 05:49:21] [INFO ] Computed 24 invariants in 12 ms
[2024-05-29 05:49:21] [INFO ] Implicit Places using invariants in 528 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 530 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/134 places, 1280/1280 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 542 ms. Remains : 132/134 places, 1280/1280 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SimpleLoadBal-PT-15-LTLFireability-06
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 1 ms.
FORMULA SimpleLoadBal-PT-15-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SimpleLoadBal-PT-15-LTLFireability-06 finished in 685 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||G(p1)))) U (G(p1)||X(!p2))))'
Support contains 9 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 1280/1280 transitions.
Applied a total of 0 rules in 4 ms. Remains 134 /134 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2024-05-29 05:49:21] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
[2024-05-29 05:49:21] [INFO ] Invariant cache hit.
[2024-05-29 05:49:22] [INFO ] Implicit Places using invariants in 497 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 500 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/134 places, 1280/1280 transitions.
Applied a total of 0 rules in 4 ms. Remains 133 /133 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 508 ms. Remains : 133/134 places, 1280/1280 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SimpleLoadBal-PT-15-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 254 ms.
Product exploration explored 100000 steps with 50000 reset in 245 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 23 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SimpleLoadBal-PT-15-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SimpleLoadBal-PT-15-LTLFireability-07 finished in 1296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 1280/1280 transitions.
Applied a total of 0 rules in 4 ms. Remains 134 /134 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2024-05-29 05:49:23] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
[2024-05-29 05:49:23] [INFO ] Invariant cache hit.
[2024-05-29 05:49:23] [INFO ] Implicit Places using invariants in 462 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 470 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/134 places, 1280/1280 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 480 ms. Remains : 132/134 places, 1280/1280 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : SimpleLoadBal-PT-15-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SimpleLoadBal-PT-15-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SimpleLoadBal-PT-15-LTLFireability-10 finished in 617 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 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 1280/1280 transitions.
Applied a total of 0 rules in 6 ms. Remains 134 /134 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2024-05-29 05:49:23] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
[2024-05-29 05:49:23] [INFO ] Invariant cache hit.
[2024-05-29 05:49:24] [INFO ] Implicit Places using invariants in 669 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 672 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/134 places, 1280/1280 transitions.
Applied a total of 0 rules in 6 ms. Remains 132 /132 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 687 ms. Remains : 132/134 places, 1280/1280 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SimpleLoadBal-PT-15-LTLFireability-12
Product exploration explored 100000 steps with 101 reset in 566 ms.
Stack based approach found an accepted trace after 247 steps with 0 reset with depth 248 and stack size 248 in 3 ms.
FORMULA SimpleLoadBal-PT-15-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-15-LTLFireability-12 finished in 1377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 1280/1280 transitions.
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 0 place count 134 transition count 1265
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 119 transition count 1265
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 104 transition count 1250
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 100 transition count 1248
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 98 transition count 1246
Applied a total of 70 rules in 121 ms. Remains 98 /134 variables (removed 36) and now considering 1246/1280 (removed 34) transitions.
[2024-05-29 05:49:25] [INFO ] Flow matrix only has 976 transitions (discarded 270 similar events)
// Phase 1: matrix 976 rows 98 cols
[2024-05-29 05:49:25] [INFO ] Computed 22 invariants in 15 ms
[2024-05-29 05:49:25] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-05-29 05:49:25] [INFO ] Flow matrix only has 976 transitions (discarded 270 similar events)
[2024-05-29 05:49:25] [INFO ] Invariant cache hit.
[2024-05-29 05:49:26] [INFO ] State equation strengthened by 465 read => feed constraints.
[2024-05-29 05:49:27] [INFO ] Implicit Places using invariants and state equation in 2008 ms returned []
Implicit Place search using SMT with State Equation took 2467 ms to find 0 implicit places.
[2024-05-29 05:49:27] [INFO ] Redundant transitions in 28 ms returned []
Running 1231 sub problems to find dead transitions.
[2024-05-29 05:49:27] [INFO ] Flow matrix only has 976 transitions (discarded 270 similar events)
[2024-05-29 05:49:27] [INFO ] Invariant cache hit.
[2024-05-29 05:49:27] [INFO ] State equation strengthened by 465 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 3 (OVERLAPS) 14/97 variables, 14/101 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 14/115 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/98 variables, 3/119 constraints. Problems are: Problem set: 409 solved, 822 unsolved
SMT process timed out in 39050ms, After SMT, problems are : Problem set: 409 solved, 822 unsolved
Search for dead transitions found 409 dead transitions in 39074ms
Found 409 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 409 transitions
Dead transitions reduction (with SMT) removed 409 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 98/134 places, 837/1280 transitions.
Reduce places removed 2 places and 19 transitions.
Reduce places removed 2 places and 19 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 94 transition count 799
Reduce places removed 2 places and 19 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 92 transition count 780
Reduce places removed 2 places and 19 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 90 transition count 761
Reduce places removed 2 places and 19 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8 place count 88 transition count 742
Reduce places removed 2 places and 19 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 10 place count 86 transition count 723
Reduce places removed 1 places and 18 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 11 place count 85 transition count 705
Applied a total of 11 rules in 36 ms. Remains 85 /98 variables (removed 13) and now considering 705/837 (removed 132) transitions.
[2024-05-29 05:50:06] [INFO ] Flow matrix only has 560 transitions (discarded 145 similar events)
// Phase 1: matrix 560 rows 85 cols
[2024-05-29 05:50:06] [INFO ] Computed 22 invariants in 8 ms
[2024-05-29 05:50:07] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-29 05:50:07] [INFO ] Flow matrix only has 560 transitions (discarded 145 similar events)
[2024-05-29 05:50:07] [INFO ] Invariant cache hit.
[2024-05-29 05:50:07] [INFO ] State equation strengthened by 257 read => feed constraints.
[2024-05-29 05:50:08] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/134 places, 705/1280 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 43014 ms. Remains : 85/134 places, 705/1280 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : SimpleLoadBal-PT-15-LTLFireability-13
Product exploration explored 100000 steps with 204 reset in 631 ms.
Stack based approach found an accepted trace after 194 steps with 0 reset with depth 195 and stack size 195 in 5 ms.
FORMULA SimpleLoadBal-PT-15-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-15-LTLFireability-13 finished in 43723 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(G(p0))&&F(p1))))'
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 1280/1280 transitions.
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 0 place count 134 transition count 1265
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 119 transition count 1265
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 104 transition count 1250
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 63 place count 102 transition count 1249
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 65 place count 101 transition count 1248
Applied a total of 65 rules in 70 ms. Remains 101 /134 variables (removed 33) and now considering 1248/1280 (removed 32) transitions.
[2024-05-29 05:50:08] [INFO ] Flow matrix only has 978 transitions (discarded 270 similar events)
// Phase 1: matrix 978 rows 101 cols
[2024-05-29 05:50:08] [INFO ] Invariants computation overflowed in 6 ms
[2024-05-29 05:50:09] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-29 05:50:09] [INFO ] Flow matrix only has 978 transitions (discarded 270 similar events)
// Phase 1: matrix 978 rows 101 cols
[2024-05-29 05:50:09] [INFO ] Invariants computation overflowed in 9 ms
[2024-05-29 05:50:09] [INFO ] State equation strengthened by 465 read => feed constraints.
[2024-05-29 05:50:10] [INFO ] Implicit Places using invariants and state equation in 1524 ms returned []
Implicit Place search using SMT with State Equation took 1822 ms to find 0 implicit places.
[2024-05-29 05:50:10] [INFO ] Redundant transitions in 16 ms returned []
Running 1233 sub problems to find dead transitions.
[2024-05-29 05:50:10] [INFO ] Flow matrix only has 978 transitions (discarded 270 similar events)
// Phase 1: matrix 978 rows 101 cols
[2024-05-29 05:50:10] [INFO ] Invariants computation overflowed in 9 ms
[2024-05-29 05:50:10] [INFO ] State equation strengthened by 465 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
At refinement iteration 2 (OVERLAPS) 978/1064 variables, 86/172 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1064 variables, 465/637 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1064/1079 variables, and 637 constraints, problems are : Problem set: 0 solved, 1233 unsolved in 30052 ms.
Refiners :[Domain max(s): 86/101 constraints, State Equation: 86/101 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 1233/1233 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
At refinement iteration 2 (OVERLAPS) 978/1064 variables, 86/172 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1064 variables, 465/637 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1064 variables, 750/1387 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1064/1079 variables, and 1387 constraints, problems are : Problem set: 0 solved, 1233 unsolved in 30032 ms.
Refiners :[Domain max(s): 86/101 constraints, State Equation: 86/101 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 750/1233 constraints, Known Traps: 0/0 constraints]
After SMT, in 69652ms problems are : Problem set: 0 solved, 1233 unsolved
Search for dead transitions found 0 dead transitions in 69665ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/134 places, 1248/1280 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71586 ms. Remains : 101/134 places, 1248/1280 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SimpleLoadBal-PT-15-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 1199 ms.
Stack based approach found an accepted trace after 364 steps with 0 reset with depth 365 and stack size 365 in 3 ms.
FORMULA SimpleLoadBal-PT-15-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-15-LTLFireability-14 finished in 72963 ms.
All properties solved by simple procedures.
Total runtime 522628 ms.

BK_STOP 1716961881833

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SimpleLoadBal-PT-15"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is SimpleLoadBal-PT-15, 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 r378-smll-171683810900172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-15.tgz
mv SimpleLoadBal-PT-15 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;