Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994500515.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is SimpleLoadBal-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994500515
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 535K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749203565002

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
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
LTLCardinality PT
Running Version 202505121319
[2025-06-06 09:52:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 09:52:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 09:52:46] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2025-06-06 09:52:46] [INFO ] Transformed 104 places.
[2025-06-06 09:52:46] [INFO ] Transformed 605 transitions.
[2025-06-06 09:52:46] [INFO ] Found NUPN structural information;
[2025-06-06 09:52:46] [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]
[2025-06-06 09:52:46] [INFO ] Parsed PT model containing 104 places and 605 transitions and 4148 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA SimpleLoadBal-PT-10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 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 17 ms. Remains 104 /104 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2025-06-06 09:52:46] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 104 cols
[2025-06-06 09:52:46] [INFO ] Computed 29 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:52:47] [INFO ] Implicit Places using invariants in 479 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 19, 42, 43]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 520 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 6 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 568 ms. Remains : 93/104 places, 605/605 transitions.
Support contains 19 out of 93 places after structural reductions.
[2025-06-06 09:52:47] [INFO ] Flatten gal took : 93 ms
[2025-06-06 09:52:47] [INFO ] Flatten gal took : 50 ms
[2025-06-06 09:52:47] [INFO ] Input system was already deterministic with 605 transitions.
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (8 resets) in 1025 ms. (38 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
[2025-06-06 09:52:47] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 93 cols
[2025-06-06 09:52:47] [INFO ] Computed 18 invariants in 10 ms
[2025-06-06 09:52:47] [INFO ] State equation strengthened by 210 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 60/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/91 variables, 13/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 26/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/93 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/93 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/93 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 475/568 variables, 93/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/568 variables, 210/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/568 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/568 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 414 constraints, problems are : Problem set: 0 solved, 1 unsolved in 285 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: 93/93 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 60/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/91 variables, 13/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 26/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:52:48] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 15 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/93 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/93 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/93 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 475/568 variables, 93/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/568 variables, 210/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/568 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/568 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/568 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 416 constraints, problems are : Problem set: 0 solved, 1 unsolved in 553 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: 93/93 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 887ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 130 ms.
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 42 place count 72 transition count 584
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 45 place count 70 transition count 583
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 47 place count 69 transition count 582
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 57 place count 69 transition count 572
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 67 place count 59 transition count 572
Applied a total of 67 rules in 120 ms. Remains 59 /93 variables (removed 34) and now considering 572/605 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 59/93 places, 572/605 transitions.
RANDOM walk for 40000 steps (8 resets) in 549 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1033919 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :0 out of 1
Probabilistic random walk after 1033919 steps, saw 288743 distinct states, run finished after 3005 ms. (steps per millisecond=344 ) properties seen :0
[2025-06-06 09:52:52] [INFO ] Flow matrix only has 442 transitions (discarded 130 similar events)
// Phase 1: matrix 442 rows 59 cols
[2025-06-06 09:52:52] [INFO ] Computed 17 invariants in 7 ms
[2025-06-06 09:52:52] [INFO ] State equation strengthened by 210 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 12/14 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/47 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 33/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/57 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 441/498 variables, 57/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 210/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/498 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/501 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/501 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/501 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/501 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 345 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 59/59 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 12/14 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/47 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 33/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/57 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 441/498 variables, 57/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 210/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/498 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/501 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/501 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/501 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/501 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:52:52] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 6 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/501 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/501 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/501 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 347 constraints, problems are : Problem set: 0 solved, 1 unsolved in 755 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 59/59 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 955ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 77 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 572/572 transitions.
Applied a total of 0 rules in 23 ms. Remains 59 /59 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 59/59 places, 572/572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 572/572 transitions.
Applied a total of 0 rules in 20 ms. Remains 59 /59 variables (removed 0) and now considering 572/572 (removed 0) transitions.
[2025-06-06 09:52:53] [INFO ] Flow matrix only has 442 transitions (discarded 130 similar events)
[2025-06-06 09:52:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:52:53] [INFO ] Implicit Places using invariants in 256 ms returned []
[2025-06-06 09:52:53] [INFO ] Flow matrix only has 442 transitions (discarded 130 similar events)
[2025-06-06 09:52:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:52:53] [INFO ] State equation strengthened by 210 read => feed constraints.
[2025-06-06 09:52:54] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 09:52:54] [INFO ] Redundant transitions in 29 ms returned []
Running 562 sub problems to find dead transitions.
[2025-06-06 09:52:54] [INFO ] Flow matrix only has 442 transitions (discarded 130 similar events)
[2025-06-06 09:52:54] [INFO ] Invariant cache hit.
[2025-06-06 09:52:54] [INFO ] State equation strengthened by 210 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 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 TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 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 TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 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 TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD464 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 TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 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 TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD554 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 TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 4/76 constraints. Problems are: Problem set: 192 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:52:57] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:52:57] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 6 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:52:57] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:52:57] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:52:57] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:52:58] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:52:58] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:52:58] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:52:58] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:52:58] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 4 ms to minimize.
Problem TDEAD231 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:52:58] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:52:58] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:52:58] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:52:58] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:52:58] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:52:59] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:52:59] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 4 ms to minimize.
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 17/93 constraints. Problems are: Problem set: 221 solved, 341 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:53:01] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:53:01] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:53:01] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:53:01] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:53:01] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:53:01] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 6/99 constraints. Problems are: Problem set: 221 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/99 constraints. Problems are: Problem set: 221 solved, 341 unsolved
At refinement iteration 6 (OVERLAPS) 442/501 variables, 59/158 constraints. Problems are: Problem set: 221 solved, 341 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 210/368 constraints. Problems are: Problem set: 221 solved, 341 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 0/368 constraints. Problems are: Problem set: 221 solved, 341 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/501 variables, 0/368 constraints. Problems are: Problem set: 221 solved, 341 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 368 constraints, problems are : Problem set: 221 solved, 341 unsolved in 30019 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 59/59 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 562/562 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 221 solved, 341 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 221 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 13/72 constraints. Problems are: Problem set: 221 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 4/76 constraints. Problems are: Problem set: 221 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 23/99 constraints. Problems are: Problem set: 221 solved, 341 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:53:26] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/100 constraints. Problems are: Problem set: 221 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/100 constraints. Problems are: Problem set: 221 solved, 341 unsolved
At refinement iteration 6 (OVERLAPS) 442/501 variables, 59/159 constraints. Problems are: Problem set: 221 solved, 341 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 210/369 constraints. Problems are: Problem set: 221 solved, 341 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 341/710 constraints. Problems are: Problem set: 221 solved, 341 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 710 constraints, problems are : Problem set: 221 solved, 341 unsolved in 30019 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 59/59 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 341/562 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61555ms problems are : Problem set: 221 solved, 341 unsolved
Search for dead transitions found 221 dead transitions in 61561ms
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 REACHABILITY mode, iteration 1 : 59/59 places, 351/572 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 57 transition count 349
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 55 transition count 347
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 53 transition count 345
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7 place count 52 transition count 343
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 7 rules in 19 ms. Remains 52 /59 variables (removed 7) and now considering 343/351 (removed 8) transitions.
[2025-06-06 09:53:55] [INFO ] Flow matrix only has 266 transitions (discarded 77 similar events)
// Phase 1: matrix 266 rows 52 cols
[2025-06-06 09:53:55] [INFO ] Computed 18 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:53:55] [INFO ] Implicit Places using invariants in 169 ms returned []
[2025-06-06 09:53:55] [INFO ] Flow matrix only has 266 transitions (discarded 77 similar events)
[2025-06-06 09:53:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:53:55] [INFO ] State equation strengthened by 122 read => feed constraints.
[2025-06-06 09:53:56] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 52/59 places, 343/572 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62971 ms. Remains : 52/59 places, 343/572 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
FORMULA SimpleLoadBal-PT-10-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA SimpleLoadBal-PT-10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 605/605 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 93 transition count 595
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 83 transition count 595
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 42 place count 72 transition count 584
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 45 place count 70 transition count 583
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 47 place count 69 transition count 582
Applied a total of 47 rules in 57 ms. Remains 69 /93 variables (removed 24) and now considering 582/605 (removed 23) transitions.
[2025-06-06 09:53:56] [INFO ] Flow matrix only has 452 transitions (discarded 130 similar events)
// Phase 1: matrix 452 rows 69 cols
[2025-06-06 09:53:56] [INFO ] Computed 17 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:53:56] [INFO ] Implicit Places using invariants in 410 ms returned []
[2025-06-06 09:53:56] [INFO ] Flow matrix only has 452 transitions (discarded 130 similar events)
[2025-06-06 09:53:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:53:56] [INFO ] State equation strengthened by 210 read => feed constraints.
[2025-06-06 09:53:57] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 1026 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 09:53:57] [INFO ] Redundant transitions in 4 ms returned []
Running 572 sub problems to find dead transitions.
[2025-06-06 09:53:57] [INFO ] Flow matrix only has 452 transitions (discarded 130 similar events)
[2025-06-06 09:53:57] [INFO ] Invariant cache hit.
[2025-06-06 09:53:57] [INFO ] State equation strengthened by 210 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:53:59] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:54:00] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 3 ms to minimize.
Problem TDEAD333 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:54:01] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:54:01] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:54:01] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:54:01] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 6/70 constraints. Problems are: Problem set: 1 solved, 571 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:54:03] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:54:03] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 2/72 constraints. Problems are: Problem set: 1 solved, 571 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 571 unsolved
At refinement iteration 5 (OVERLAPS) 8/67 variables, 8/80 constraints. Problems are: Problem set: 1 solved, 571 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 8/88 constraints. Problems are: Problem set: 1 solved, 571 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 1/89 constraints. Problems are: Problem set: 1 solved, 571 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:54:09] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:54:09] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:54:09] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:54:09] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:54:09] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:54:09] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 6/95 constraints. Problems are: Problem set: 1 solved, 571 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:54:11] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 1/96 constraints. Problems are: Problem set: 1 solved, 571 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 571 unsolved
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 TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 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 TDEAD81 is UNSAT
Problem TDEAD82 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 TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 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 TDEAD141 is UNSAT
Problem TDEAD142 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 TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 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 TDEAD332 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem 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
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
At refinement iteration 11 (OVERLAPS) 2/69 variables, 3/99 constraints. Problems are: Problem set: 200 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/69 variables, 2/101 constraints. Problems are: Problem set: 200 solved, 372 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:54:18] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 4 ms to minimize.
Problem TDEAD321 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem 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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:54:19] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:54:19] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/69 variables, 3/104 constraints. Problems are: Problem set: 221 solved, 351 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:54:19] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:54:20] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/69 variables, 2/106 constraints. Problems are: Problem set: 221 solved, 351 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/69 variables, 0/106 constraints. Problems are: Problem set: 221 solved, 351 unsolved
At refinement iteration 16 (OVERLAPS) 452/521 variables, 69/175 constraints. Problems are: Problem set: 221 solved, 351 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/521 variables, 210/385 constraints. Problems are: Problem set: 221 solved, 351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 521/521 variables, and 385 constraints, problems are : Problem set: 221 solved, 351 unsolved in 30019 ms.
Refiners :[Domain max(s): 69/69 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 69/69 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 572/551 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 221 solved, 351 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 221 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 5/64 constraints. Problems are: Problem set: 221 solved, 351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 17/81 constraints. Problems are: Problem set: 221 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/81 constraints. Problems are: Problem set: 221 solved, 351 unsolved
At refinement iteration 4 (OVERLAPS) 8/67 variables, 8/89 constraints. Problems are: Problem set: 221 solved, 351 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 8/97 constraints. Problems are: Problem set: 221 solved, 351 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 1/98 constraints. Problems are: Problem set: 221 solved, 351 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/98 constraints. Problems are: Problem set: 221 solved, 351 unsolved
At refinement iteration 8 (OVERLAPS) 2/69 variables, 3/101 constraints. Problems are: Problem set: 221 solved, 351 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 2/103 constraints. Problems are: Problem set: 221 solved, 351 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 3/106 constraints. Problems are: Problem set: 221 solved, 351 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/106 constraints. Problems are: Problem set: 221 solved, 351 unsolved
At refinement iteration 12 (OVERLAPS) 452/521 variables, 69/175 constraints. Problems are: Problem set: 221 solved, 351 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/521 variables, 210/385 constraints. Problems are: Problem set: 221 solved, 351 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/521 variables, 338/723 constraints. Problems are: Problem set: 221 solved, 351 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/521 variables, 0/723 constraints. Problems are: Problem set: 221 solved, 351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/521 variables, and 723 constraints, problems are : Problem set: 221 solved, 351 unsolved in 30019 ms.
Refiners :[Domain max(s): 69/69 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 69/69 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 351/551 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60959ms problems are : Problem set: 221 solved, 351 unsolved
Search for dead transitions found 221 dead transitions in 60962ms
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 : 69/93 places, 361/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 65 transition count 357
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 63 transition count 355
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 61 transition count 353
Applied a total of 6 rules in 14 ms. Remains 61 /69 variables (removed 8) and now considering 353/361 (removed 8) transitions.
[2025-06-06 09:54:58] [INFO ] Flow matrix only has 276 transitions (discarded 77 similar events)
// Phase 1: matrix 276 rows 61 cols
[2025-06-06 09:54:58] [INFO ] Computed 17 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:54:58] [INFO ] Implicit Places using invariants in 197 ms returned []
[2025-06-06 09:54:58] [INFO ] Flow matrix only has 276 transitions (discarded 77 similar events)
[2025-06-06 09:54:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:54:58] [INFO ] State equation strengthened by 122 read => feed constraints.
[2025-06-06 09:54:59] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/93 places, 353/605 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62617 ms. Remains : 61/93 places, 353/605 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0)]
Running random walk in product with property : SimpleLoadBal-PT-10-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 471 ms.
Stack based approach found an accepted trace after 105 steps with 0 reset with depth 106 and stack size 105 in 1 ms.
FORMULA SimpleLoadBal-PT-10-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-10-LTLCardinality-01 finished in 63283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 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.
[2025-06-06 09:54:59] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 93 cols
[2025-06-06 09:54:59] [INFO ] Computed 18 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:54:59] [INFO ] Implicit Places using invariants in 315 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 317 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 4 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 323 ms. Remains : 92/93 places, 605/605 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : SimpleLoadBal-PT-10-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SimpleLoadBal-PT-10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SimpleLoadBal-PT-10-LTLCardinality-04 finished in 418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)))))'
Support contains 4 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.
[2025-06-06 09:55:00] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2025-06-06 09:55:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:55:00] [INFO ] Implicit Places using invariants in 302 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 304 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 312 ms. Remains : 92/93 places, 605/605 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SimpleLoadBal-PT-10-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SimpleLoadBal-PT-10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SimpleLoadBal-PT-10-LTLCardinality-05 finished in 497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 5 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.
[2025-06-06 09:55:00] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2025-06-06 09:55:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:55:00] [INFO ] Implicit Places using invariants in 313 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 316 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 322 ms. Remains : 92/93 places, 605/605 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SimpleLoadBal-PT-10-LTLCardinality-13
Product exploration explored 100000 steps with 2027 reset in 305 ms.
Stack based approach found an accepted trace after 5310 steps with 107 reset with depth 53 and stack size 53 in 18 ms.
FORMULA SimpleLoadBal-PT-10-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-10-LTLCardinality-13 finished in 756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 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 1 ms. Remains 93 /93 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2025-06-06 09:55:01] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2025-06-06 09:55:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:55:01] [INFO ] Implicit Places using invariants in 327 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 329 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 4 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 335 ms. Remains : 92/93 places, 605/605 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SimpleLoadBal-PT-10-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA SimpleLoadBal-PT-10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SimpleLoadBal-PT-10-LTLCardinality-15 finished in 455 ms.
All properties solved by simple procedures.
Total runtime 135619 ms.

BK_STOP 1749203701809

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is SimpleLoadBal-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r212-tall-174901994500515"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;