MCC'2024- Execution of r378-smll-171683810900164

About the Execution of ITS-Tools for SimpleLoadBal-PT-10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
4786.827	320460.00	461583.00	983.40	FTFTFTTFTTFFTFFF	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r378-smll-171683810900164.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-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810900164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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 4.3K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 12:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 13 12:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 13 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 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 535K 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-10-LTLFireability-00
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-01
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-02
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-03
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-04
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-05
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-06
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-07
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-08
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-09
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-10
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-11
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-12
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-13
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-14
FORMULA_NAME SimpleLoadBal-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716959876062

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 05:17:58] [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:17:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 05:17:58] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2024-05-29 05:17:58] [INFO ] Transformed 104 places.
[2024-05-29 05:17:58] [INFO ] Transformed 605 transitions.
[2024-05-29 05:17:58] [INFO ] Found NUPN structural information;
[2024-05-29 05:17:58] [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_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_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_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_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_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_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_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]
[2024-05-29 05:17:58] [INFO ] Parsed PT model containing 104 places and 605 transitions and 4148 arcs in 405 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA SimpleLoadBal-PT-10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 605/605 transitions.
Applied a total of 0 rules in 47 ms. Remains 104 /104 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-29 05:17:59] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 104 cols
[2024-05-29 05:17:59] [INFO ] Computed 29 invariants in 54 ms
[2024-05-29 05:17:59] [INFO ] Implicit Places using invariants in 583 ms returned [10, 11, 12, 13, 14, 16, 17, 18, 19, 42, 43]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 664 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/104 places, 605/605 transitions.
Applied a total of 0 rules in 13 ms. Remains 93 /93 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 764 ms. Remains : 93/104 places, 605/605 transitions.
Support contains 48 out of 93 places after structural reductions.
[2024-05-29 05:18:00] [INFO ] Flatten gal took : 182 ms
[2024-05-29 05:18:00] [INFO ] Flatten gal took : 121 ms
[2024-05-29 05:18:00] [INFO ] Input system was already deterministic with 605 transitions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (8 resets) in 3945 ms. (10 steps per ms) remains 12/31 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 139 ms. (285 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 295 ms. (135 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 133 ms. (298 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 175 ms. (227 steps per ms) remains 10/10 properties
[2024-05-29 05:18:02] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 93 cols
[2024-05-29 05:18:02] [INFO ] Computed 18 invariants in 10 ms
[2024-05-29 05:18:02] [INFO ] State equation strengthened by 210 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 2 (OVERLAPS) 43/71 variables, 11/39 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 43/82 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/82 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 5/76 variables, 1/83 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 5/88 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/88 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 13/89 variables, 4/92 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 13/105 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/105 constraints. Problems are: Problem set: 6 solved, 4 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 11 (OVERLAPS) 4/93 variables, 2/107 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/93 variables, 4/111 constraints. Problems are: Problem set: 9 solved, 1 unsolved
[2024-05-29 05:18:03] [INFO ] Deduced a trap composed of 57 places in 252 ms of which 22 ms to minimize.
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Real declared 93/568 variables, and 112 constraints, problems are : Problem set: 10 solved, 0 unsolved in 657 ms.
Refiners :[Domain max(s): 93/93 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/93 constraints, ReadFeed: 0/210 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 877ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SimpleLoadBal-PT-10-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA SimpleLoadBal-PT-10-LTLFireability-05 TRUE 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 7 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 605/605 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 93 transition count 594
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 82 transition count 594
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 71 transition count 583
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 47 place count 69 transition count 582
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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 49 place count 68 transition count 581
Applied a total of 49 rules in 131 ms. Remains 68 /93 variables (removed 25) and now considering 581/605 (removed 24) transitions.
[2024-05-29 05:18:04] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
// Phase 1: matrix 451 rows 68 cols
[2024-05-29 05:18:04] [INFO ] Computed 17 invariants in 13 ms
[2024-05-29 05:18:04] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-29 05:18:04] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
[2024-05-29 05:18:04] [INFO ] Invariant cache hit.
[2024-05-29 05:18:04] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-29 05:18:04] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
[2024-05-29 05:18:05] [INFO ] Redundant transitions in 47 ms returned []
Running 571 sub problems to find dead transitions.
[2024-05-29 05:18:05] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
[2024-05-29 05:18:05] [INFO ] Invariant cache hit.
[2024-05-29 05:18:05] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (OVERLAPS) 9/67 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 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 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 TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 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 TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 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 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 TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 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 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 TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 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 TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 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
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/83 constraints. Problems are: Problem set: 178 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/83 constraints. Problems are: Problem set: 178 solved, 393 unsolved
Problem TDEAD13 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
At refinement iteration 8 (OVERLAPS) 1/68 variables, 1/84 constraints. Problems are: Problem set: 192 solved, 379 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 1/85 constraints. Problems are: Problem set: 192 solved, 379 unsolved
[2024-05-29 05:18:20] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 3 ms to minimize.
Problem TDEAD319 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 TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 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
[2024-05-29 05:18:21] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 2 ms to minimize.
[2024-05-29 05:18:21] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 2 ms to minimize.
[2024-05-29 05:18:21] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 2 ms to minimize.
Problem TDEAD547 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD551 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 4/89 constraints. Problems are: Problem set: 216 solved, 355 unsolved
[2024-05-29 05:18:23] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 1 ms to minimize.
[2024-05-29 05:18:23] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 1 ms to minimize.
[2024-05-29 05:18:23] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-05-29 05:18:24] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 1 ms to minimize.
[2024-05-29 05:18:24] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD546 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 5/94 constraints. Problems are: Problem set: 221 solved, 350 unsolved
[2024-05-29 05:18:25] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 2 ms to minimize.
[2024-05-29 05:18:26] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 2 ms to minimize.
[2024-05-29 05:18:26] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 1 ms to minimize.
[2024-05-29 05:18:26] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 2 ms to minimize.
[2024-05-29 05:18:26] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 5/99 constraints. Problems are: Problem set: 221 solved, 350 unsolved
[2024-05-29 05:18:29] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/68 variables, 1/100 constraints. Problems are: Problem set: 221 solved, 350 unsolved
[2024-05-29 05:18:31] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/68 variables, 1/101 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/68 variables, 0/101 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 16 (OVERLAPS) 451/519 variables, 68/169 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/519 variables, 210/379 constraints. Problems are: Problem set: 221 solved, 350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/519 variables, and 379 constraints, problems are : Problem set: 221 solved, 350 unsolved in 30045 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 221 solved, 350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 4/62 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/63 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 12/75 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/75 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 5 (OVERLAPS) 9/67 variables, 9/84 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 9/93 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 2/95 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/95 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 9 (OVERLAPS) 1/68 variables, 1/96 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 1/97 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 4/101 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 0/101 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 13 (OVERLAPS) 451/519 variables, 68/169 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 210/379 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 350/729 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/519 variables, 0/729 constraints. Problems are: Problem set: 221 solved, 350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/519 variables, and 729 constraints, problems are : Problem set: 221 solved, 350 unsolved in 30031 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 350/571 constraints, Known Traps: 16/16 constraints]
After SMT, in 63151ms problems are : Problem set: 221 solved, 350 unsolved
Search for dead transitions found 221 dead transitions in 63175ms
Found 221 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 221 transitions
Dead transitions reduction (with SMT) removed 221 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 68/93 places, 360/605 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 64 transition count 356
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 62 transition count 354
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 60 transition count 352
Applied a total of 6 rules in 24 ms. Remains 60 /68 variables (removed 8) and now considering 352/360 (removed 8) transitions.
[2024-05-29 05:19:08] [INFO ] Flow matrix only has 275 transitions (discarded 77 similar events)
// Phase 1: matrix 275 rows 60 cols
[2024-05-29 05:19:08] [INFO ] Computed 17 invariants in 4 ms
[2024-05-29 05:19:08] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-29 05:19:08] [INFO ] Flow matrix only has 275 transitions (discarded 77 similar events)
[2024-05-29 05:19:08] [INFO ] Invariant cache hit.
[2024-05-29 05:19:08] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-29 05:19:08] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/93 places, 352/605 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64797 ms. Remains : 60/93 places, 352/605 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SimpleLoadBal-PT-10-LTLFireability-00
Product exploration explored 100000 steps with 76 reset in 985 ms.
Stack based approach found an accepted trace after 121 steps with 0 reset with depth 122 and stack size 122 in 1 ms.
FORMULA SimpleLoadBal-PT-10-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-10-LTLFireability-00 finished in 66125 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||(X(G(p2))&&p1)))))'
Support contains 12 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 605/605 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 93 transition count 594
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 82 transition count 594
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 71 transition count 583
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 47 place count 69 transition count 582
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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 49 place count 68 transition count 581
Applied a total of 49 rules in 71 ms. Remains 68 /93 variables (removed 25) and now considering 581/605 (removed 24) transitions.
[2024-05-29 05:19:10] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
// Phase 1: matrix 451 rows 68 cols
[2024-05-29 05:19:10] [INFO ] Computed 17 invariants in 9 ms
[2024-05-29 05:19:10] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-29 05:19:10] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
[2024-05-29 05:19:10] [INFO ] Invariant cache hit.
[2024-05-29 05:19:10] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-29 05:19:10] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
[2024-05-29 05:19:10] [INFO ] Redundant transitions in 11 ms returned []
Running 571 sub problems to find dead transitions.
[2024-05-29 05:19:10] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
[2024-05-29 05:19:10] [INFO ] Invariant cache hit.
[2024-05-29 05:19:10] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (OVERLAPS) 9/67 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 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 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 TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 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 TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 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 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 TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 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 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 TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 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 TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 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
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/83 constraints. Problems are: Problem set: 178 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/83 constraints. Problems are: Problem set: 178 solved, 393 unsolved
Problem TDEAD13 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
At refinement iteration 8 (OVERLAPS) 1/68 variables, 1/84 constraints. Problems are: Problem set: 192 solved, 379 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 1/85 constraints. Problems are: Problem set: 192 solved, 379 unsolved
[2024-05-29 05:19:24] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 2 ms to minimize.
Problem TDEAD319 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 TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 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
[2024-05-29 05:19:25] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 4 ms to minimize.
[2024-05-29 05:19:25] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 6 ms to minimize.
[2024-05-29 05:19:25] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 2 ms to minimize.
Problem TDEAD547 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD551 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 4/89 constraints. Problems are: Problem set: 216 solved, 355 unsolved
[2024-05-29 05:19:27] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 1 ms to minimize.
[2024-05-29 05:19:27] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 3 ms to minimize.
[2024-05-29 05:19:27] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 1 ms to minimize.
[2024-05-29 05:19:28] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
[2024-05-29 05:19:28] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 1 ms to minimize.
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD546 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 5/94 constraints. Problems are: Problem set: 221 solved, 350 unsolved
[2024-05-29 05:19:29] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 1 ms to minimize.
[2024-05-29 05:19:29] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 2 ms to minimize.
[2024-05-29 05:19:30] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 2 ms to minimize.
[2024-05-29 05:19:30] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 3 ms to minimize.
[2024-05-29 05:19:30] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 5/99 constraints. Problems are: Problem set: 221 solved, 350 unsolved
[2024-05-29 05:19:33] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/68 variables, 1/100 constraints. Problems are: Problem set: 221 solved, 350 unsolved
[2024-05-29 05:19:34] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/68 variables, 1/101 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/68 variables, 0/101 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 16 (OVERLAPS) 451/519 variables, 68/169 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/519 variables, 210/379 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/519 variables, 0/379 constraints. Problems are: Problem set: 221 solved, 350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/519 variables, and 379 constraints, problems are : Problem set: 221 solved, 350 unsolved in 30018 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 221 solved, 350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 4/62 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/63 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 12/75 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/75 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 5 (OVERLAPS) 9/67 variables, 9/84 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 9/93 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 2/95 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/95 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 9 (OVERLAPS) 1/68 variables, 1/96 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 1/97 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 4/101 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 0/101 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 13 (OVERLAPS) 451/519 variables, 68/169 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 210/379 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 350/729 constraints. Problems are: Problem set: 221 solved, 350 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/519 variables, 0/729 constraints. Problems are: Problem set: 221 solved, 350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/519 variables, and 729 constraints, problems are : Problem set: 221 solved, 350 unsolved in 30017 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 350/571 constraints, Known Traps: 16/16 constraints]
After SMT, in 62671ms problems are : Problem set: 221 solved, 350 unsolved
Search for dead transitions found 221 dead transitions in 62687ms
Found 221 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 221 transitions
Dead transitions reduction (with SMT) removed 221 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 68/93 places, 360/605 transitions.
Reduce places removed 2 places and 2 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 65 transition count 356
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 64 transition count 354
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4 place count 62 transition count 352
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 4 rules in 28 ms. Remains 62 /68 variables (removed 6) and now considering 352/360 (removed 8) transitions.
[2024-05-29 05:20:13] [INFO ] Flow matrix only has 275 transitions (discarded 77 similar events)
// Phase 1: matrix 275 rows 62 cols
[2024-05-29 05:20:13] [INFO ] Computed 19 invariants in 3 ms
[2024-05-29 05:20:13] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-29 05:20:13] [INFO ] Flow matrix only has 275 transitions (discarded 77 similar events)
[2024-05-29 05:20:13] [INFO ] Invariant cache hit.
[2024-05-29 05:20:13] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-29 05:20:14] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/93 places, 352/605 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64067 ms. Remains : 62/93 places, 352/605 transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SimpleLoadBal-PT-10-LTLFireability-04
Product exploration explored 100000 steps with 21 reset in 551 ms.
Stack based approach found an accepted trace after 87 steps with 0 reset with depth 88 and stack size 88 in 5 ms.
FORMULA SimpleLoadBal-PT-10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-10-LTLFireability-04 finished in 64828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Support contains 7 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 605/605 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-29 05:20:14] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 93 cols
[2024-05-29 05:20:14] [INFO ] Computed 18 invariants in 5 ms
[2024-05-29 05:20:15] [INFO ] Implicit Places using invariants in 227 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 229 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/93 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 237 ms. Remains : 92/93 places, 605/605 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SimpleLoadBal-PT-10-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 386 ms.
Product exploration explored 100000 steps with 0 reset in 413 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 p1 p0), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 124 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 360 ms. (110 steps per ms) remains 2/4 properties
BEST_FIRST walk for 5488 steps (0 resets) in 68 ms. (79 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 254 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-29 05:20:17] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 92 cols
[2024-05-29 05:20:17] [INFO ] Computed 17 invariants in 6 ms
[2024-05-29 05:20:17] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-29 05:20:17] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2024-05-29 05:20:17] [INFO ] Invariant cache hit.
[2024-05-29 05:20:17] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-29 05:20:18] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1128 ms to find 0 implicit places.
Running 595 sub problems to find dead transitions.
[2024-05-29 05:20:18] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2024-05-29 05:20:18] [INFO ] Invariant cache hit.
[2024-05-29 05:20:18] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-29 05:20:24] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 2 ms to minimize.
Problem TDEAD404 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 1/89 constraints. Problems are: Problem set: 1 solved, 594 unsolved
[2024-05-29 05:20:30] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 1/90 constraints. Problems are: Problem set: 1 solved, 594 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 594 unsolved
At refinement iteration 6 (OVERLAPS) 9/91 variables, 9/99 constraints. Problems are: Problem set: 1 solved, 594 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 9/108 constraints. Problems are: Problem set: 1 solved, 594 unsolved
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 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 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 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 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 TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 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 TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 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 TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 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 TDEAD572 is UNSAT
Problem TDEAD573 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
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 1/109 constraints. Problems are: Problem set: 178 solved, 417 unsolved
[2024-05-29 05:20:38] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 2 ms to minimize.
[2024-05-29 05:20:38] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 2 ms to minimize.
[2024-05-29 05:20:38] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 1 ms to minimize.
[2024-05-29 05:20:39] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 1 ms to minimize.
[2024-05-29 05:20:39] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 1 ms to minimize.
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
[2024-05-29 05:20:39] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 1 ms to minimize.
[2024-05-29 05:20:39] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 2 ms to minimize.
[2024-05-29 05:20:39] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 2 ms to minimize.
[2024-05-29 05:20:40] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 2 ms to minimize.
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 9/118 constraints. Problems are: Problem set: 184 solved, 411 unsolved
[2024-05-29 05:20:43] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 1/119 constraints. Problems are: Problem set: 184 solved, 411 unsolved
[2024-05-29 05:20:46] [INFO ] Deduced a trap composed of 14 places in 246 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 1/120 constraints. Problems are: Problem set: 184 solved, 411 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 0/120 constraints. Problems are: Problem set: 184 solved, 411 unsolved
SMT process timed out in 32539ms, After SMT, problems are : Problem set: 184 solved, 411 unsolved
Search for dead transitions found 184 dead transitions in 32548ms
Found 184 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 184 transitions
Dead transitions reduction (with SMT) removed 184 transitions
Starting structural reductions in LTL mode, iteration 1 : 92/92 places, 421/605 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 90 transition count 419
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 88 transition count 417
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 86 transition count 415
Applied a total of 6 rules in 5 ms. Remains 86 /92 variables (removed 6) and now considering 415/421 (removed 6) transitions.
[2024-05-29 05:20:50] [INFO ] Flow matrix only has 334 transitions (discarded 81 similar events)
// Phase 1: matrix 334 rows 86 cols
[2024-05-29 05:20:50] [INFO ] Computed 17 invariants in 5 ms
[2024-05-29 05:20:50] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-29 05:20:50] [INFO ] Flow matrix only has 334 transitions (discarded 81 similar events)
[2024-05-29 05:20:50] [INFO ] Invariant cache hit.
[2024-05-29 05:20:51] [INFO ] State equation strengthened by 135 read => feed constraints.
[2024-05-29 05:20:51] [INFO ] Implicit Places using invariants and state equation in 708 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 86/92 places, 415/605 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34615 ms. Remains : 86/92 places, 415/605 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 136 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 635 ms. (62 steps per ms) remains 2/4 properties
BEST_FIRST walk for 3782 steps (0 resets) in 35 ms. (105 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 256 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 307 ms.
Product exploration explored 100000 steps with 0 reset in 341 ms.
Built C files in :
/tmp/ltsmin13595842643111550293
[2024-05-29 05:20:54] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13595842643111550293
Running compilation step : cd /tmp/ltsmin13595842643111550293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1722 ms.
Running link step : cd /tmp/ltsmin13595842643111550293;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin13595842643111550293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14013426677296915993.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-29 05:21:09] [INFO ] Flow matrix only has 334 transitions (discarded 81 similar events)
[2024-05-29 05:21:09] [INFO ] Invariant cache hit.
[2024-05-29 05:21:09] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-29 05:21:09] [INFO ] Flow matrix only has 334 transitions (discarded 81 similar events)
[2024-05-29 05:21:09] [INFO ] Invariant cache hit.
[2024-05-29 05:21:09] [INFO ] State equation strengthened by 135 read => feed constraints.
[2024-05-29 05:21:09] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
Running 405 sub problems to find dead transitions.
[2024-05-29 05:21:09] [INFO ] Flow matrix only has 334 transitions (discarded 81 similar events)
[2024-05-29 05:21:09] [INFO ] Invariant cache hit.
[2024-05-29 05:21:09] [INFO ] State equation strengthened by 135 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (OVERLAPS) 9/85 variables, 9/89 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 9/98 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Problem TDEAD66 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/86 variables, 3/102 constraints. Problems are: Problem set: 14 solved, 391 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 1/103 constraints. Problems are: Problem set: 14 solved, 391 unsolved
[2024-05-29 05:21:19] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2024-05-29 05:21:19] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2024-05-29 05:21:19] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 1 ms to minimize.
[2024-05-29 05:21:19] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-05-29 05:21:19] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 1 ms to minimize.
[2024-05-29 05:21:19] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2024-05-29 05:21:19] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 2 ms to minimize.
[2024-05-29 05:21:21] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 2 ms to minimize.
[2024-05-29 05:21:21] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 1 ms to minimize.
[2024-05-29 05:21:21] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 2 ms to minimize.
[2024-05-29 05:21:21] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 6 ms to minimize.
[2024-05-29 05:21:21] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 2 ms to minimize.
[2024-05-29 05:21:21] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
[2024-05-29 05:21:21] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 2 ms to minimize.
Problem TDEAD259 is UNSAT
[2024-05-29 05:21:22] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 2 ms to minimize.
[2024-05-29 05:21:22] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 1 ms to minimize.
Problem TDEAD278 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 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 TDEAD252 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 16/119 constraints. Problems are: Problem set: 37 solved, 368 unsolved
[2024-05-29 05:21:25] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2024-05-29 05:21:25] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2024-05-29 05:21:26] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 3/122 constraints. Problems are: Problem set: 37 solved, 368 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/86 variables, 0/122 constraints. Problems are: Problem set: 37 solved, 368 unsolved
At refinement iteration 12 (OVERLAPS) 334/420 variables, 86/208 constraints. Problems are: Problem set: 37 solved, 368 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/420 variables, 135/343 constraints. Problems are: Problem set: 37 solved, 368 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 0/343 constraints. Problems are: Problem set: 37 solved, 368 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 (/ 7.0 8.0))
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 (/ 1.0 8.0))
(s25 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/420 variables, and 343 constraints, problems are : Problem set: 37 solved, 368 unsolved in 30019 ms.
Refiners :[Domain max(s): 86/86 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 86/86 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 37 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 76/76 constraints. Problems are: Problem set: 37 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 4/80 constraints. Problems are: Problem set: 37 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 11/91 constraints. Problems are: Problem set: 37 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/91 constraints. Problems are: Problem set: 37 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 9/85 variables, 9/100 constraints. Problems are: Problem set: 37 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 9/109 constraints. Problems are: Problem set: 37 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 1/110 constraints. Problems are: Problem set: 37 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 6/116 constraints. Problems are: Problem set: 37 solved, 368 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/116 constraints. Problems are: Problem set: 37 solved, 368 unsolved
At refinement iteration 9 (OVERLAPS) 1/86 variables, 3/119 constraints. Problems are: Problem set: 37 solved, 368 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 1/120 constraints. Problems are: Problem set: 37 solved, 368 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/86 variables, 2/122 constraints. Problems are: Problem set: 37 solved, 368 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/86 variables, 0/122 constraints. Problems are: Problem set: 37 solved, 368 unsolved
At refinement iteration 13 (OVERLAPS) 334/420 variables, 86/208 constraints. Problems are: Problem set: 37 solved, 368 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 135/343 constraints. Problems are: Problem set: 37 solved, 368 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/420 variables, 368/711 constraints. Problems are: Problem set: 37 solved, 368 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/420 variables, 0/711 constraints. Problems are: Problem set: 37 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 711 constraints, problems are : Problem set: 37 solved, 368 unsolved in 30015 ms.
Refiners :[Domain max(s): 86/86 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 86/86 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 368/405 constraints, Known Traps: 19/19 constraints]
After SMT, in 61069ms problems are : Problem set: 37 solved, 368 unsolved
Search for dead transitions found 37 dead transitions in 61074ms
Found 37 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 37 transitions
Dead transitions reduction (with SMT) removed 37 transitions
Starting structural reductions in LTL mode, iteration 1 : 86/86 places, 378/415 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 376
Applied a total of 2 rules in 3 ms. Remains 84 /86 variables (removed 2) and now considering 376/378 (removed 2) transitions.
[2024-05-29 05:22:10] [INFO ] Flow matrix only has 299 transitions (discarded 77 similar events)
// Phase 1: matrix 299 rows 84 cols
[2024-05-29 05:22:10] [INFO ] Computed 17 invariants in 2 ms
[2024-05-29 05:22:11] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-29 05:22:11] [INFO ] Flow matrix only has 299 transitions (discarded 77 similar events)
[2024-05-29 05:22:11] [INFO ] Invariant cache hit.
[2024-05-29 05:22:11] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-29 05:22:11] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 84/86 places, 376/415 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62340 ms. Remains : 84/86 places, 376/415 transitions.
Built C files in :
/tmp/ltsmin962904893806621631
[2024-05-29 05:22:11] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin962904893806621631
Running compilation step : cd /tmp/ltsmin962904893806621631;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1300 ms.
Running link step : cd /tmp/ltsmin962904893806621631;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin962904893806621631;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11438332463534868245.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 05:22:26] [INFO ] Flatten gal took : 40 ms
[2024-05-29 05:22:26] [INFO ] Flatten gal took : 37 ms
[2024-05-29 05:22:26] [INFO ] Time to serialize gal into /tmp/LTL15658332753576527431.gal : 9 ms
[2024-05-29 05:22:26] [INFO ] Time to serialize properties into /tmp/LTL18043525645150090797.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15658332753576527431.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13515089698701399271.hoa' '-atoms' '/tmp/LTL18043525645150090797.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...320
Loading property file /tmp/LTL18043525645150090797.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13515089698701399271.hoa
Detected timeout of ITS tools.
[2024-05-29 05:22:41] [INFO ] Flatten gal took : 30 ms
[2024-05-29 05:22:41] [INFO ] Flatten gal took : 26 ms
[2024-05-29 05:22:41] [INFO ] Time to serialize gal into /tmp/LTL15115274412984868676.gal : 10 ms
[2024-05-29 05:22:41] [INFO ] Time to serialize properties into /tmp/LTL16939778280366334703.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15115274412984868676.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16939778280366334703.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((P_server_request_1_2==0)||(P_lb_balancing_1==0))||((P_lb_load_1_0==0)||(P_lb_load_2_2==0)))")||(X("(((P_lb_routing_1_3==0)...204
Formula 0 simplified : XF(!"(((P_server_request_1_2==0)||(P_lb_balancing_1==0))||((P_lb_load_1_0==0)||(P_lb_load_2_2==0)))" & X!"(((P_lb_routing_1_3==0)||(...196
Detected timeout of ITS tools.
[2024-05-29 05:22:57] [INFO ] Flatten gal took : 28 ms
[2024-05-29 05:22:57] [INFO ] Applying decomposition
[2024-05-29 05:22:57] [INFO ] Flatten gal took : 23 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/graph10102469163517292664.txt' '-o' '/tmp/graph10102469163517292664.bin' '-w' '/tmp/graph10102469163517292664.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10102469163517292664.bin' '-l' '-1' '-v' '-w' '/tmp/graph10102469163517292664.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:22:57] [INFO ] Decomposing Gal with order
[2024-05-29 05:22:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:22:57] [INFO ] Removed a total of 944 redundant transitions.
[2024-05-29 05:22:57] [INFO ] Flatten gal took : 152 ms
[2024-05-29 05:22:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 15 ms.
[2024-05-29 05:22:57] [INFO ] Time to serialize gal into /tmp/LTL5061496464028717752.gal : 9 ms
[2024-05-29 05:22:57] [INFO ] Time to serialize properties into /tmp/LTL6922303949727781250.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5061496464028717752.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6922303949727781250.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...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((i0.u14.P_server_request_1_2==0)||(u17.P_lb_balancing_1==0))||((u17.P_lb_load_1_0==0)||(u17.P_lb_load_2_2==0)))")||(X("(((i...239
Formula 0 simplified : XF(!"(((i0.u14.P_server_request_1_2==0)||(u17.P_lb_balancing_1==0))||((u17.P_lb_load_1_0==0)||(u17.P_lb_load_2_2==0)))" & X!"(((i11....231
Reverse transition relation is NOT exact ! Due to transitions t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38...389
25 unique states visited
0 strongly connected components in search stack
48 transitions explored
25 items max in DFS search stack
1227 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,12.3156,350124,1,0,694756,1143,3480,789180,558,3422,1505674
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SimpleLoadBal-PT-10-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property SimpleLoadBal-PT-10-LTLFireability-06 finished in 177248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(F(p1))||(!p2 U p3)))||p0)))'
Support contains 12 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-29 05:23:12] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 93 cols
[2024-05-29 05:23:12] [INFO ] Computed 18 invariants in 4 ms
[2024-05-29 05:23:12] [INFO ] Implicit Places using invariants in 204 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 229 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/93 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 234 ms. Remains : 92/93 places, 605/605 transitions.
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : SimpleLoadBal-PT-10-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p3 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 20 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SimpleLoadBal-PT-10-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SimpleLoadBal-PT-10-LTLFireability-08 finished in 916 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||F(p1))))'
Support contains 7 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-29 05:23:13] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2024-05-29 05:23:13] [INFO ] Invariant cache hit.
[2024-05-29 05:23:13] [INFO ] Implicit Places using invariants in 254 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 264 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/93 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 270 ms. Remains : 92/93 places, 605/605 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : SimpleLoadBal-PT-10-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 452 ms.
Product exploration explored 100000 steps with 50000 reset in 411 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 p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SimpleLoadBal-PT-10-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SimpleLoadBal-PT-10-LTLFireability-12 finished in 1332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U p1) U (F(p2)||G(p0))))))'
Support contains 9 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 605/605 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-29 05:23:14] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2024-05-29 05:23:14] [INFO ] Invariant cache hit.
[2024-05-29 05:23:14] [INFO ] Implicit Places using invariants in 321 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 325 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/93 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 331 ms. Remains : 92/93 places, 605/605 transitions.
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : SimpleLoadBal-PT-10-LTLFireability-13
Product exploration explored 100000 steps with 102 reset in 572 ms.
Stack based approach found an accepted trace after 728 steps with 1 reset with depth 102 and stack size 102 in 4 ms.
FORMULA SimpleLoadBal-PT-10-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-10-LTLFireability-13 finished in 1161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1 U X(((G(p2) U p1)||X(p1)))))))'
Support contains 11 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-05-29 05:23:15] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2024-05-29 05:23:15] [INFO ] Invariant cache hit.
[2024-05-29 05:23:15] [INFO ] Implicit Places using invariants in 302 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 307 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/93 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 313 ms. Remains : 92/93 places, 605/605 transitions.
Stuttering acceptance computed with spot in 529 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p2)]
Running random walk in product with property : SimpleLoadBal-PT-10-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SimpleLoadBal-PT-10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SimpleLoadBal-PT-10-LTLFireability-14 finished in 881 ms.
All properties solved by simple procedures.
Total runtime 318256 ms.

BK_STOP 1716960196522

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-10"
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-10, 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-171683810900164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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