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.r601-tall-171774424000214.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 greatspnxred
Input is BlocksWorld-PT-07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r601-tall-171774424000214
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 292K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 356K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.9M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 31K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 230K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 933K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 599K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.7M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 8.1M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.8K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 1.5M Jun 7 06:26 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 BlocksWorld-PT-07-ReachabilityCardinality-2024-00
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2024-01
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2024-02
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2024-03
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2024-04
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2024-05
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2024-06
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2024-07
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2024-08
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2024-09
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2024-10
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2024-11
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2024-12
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2024-13
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2024-14
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717760607127

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-07 11:43:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-07 11:43:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 11:43:28] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2024-06-07 11:43:28] [INFO ] Transformed 1559 places.
[2024-06-07 11:43:28] [INFO ] Transformed 2965 transitions.
[2024-06-07 11:43:28] [INFO ] Found NUPN structural information;
[2024-06-07 11:43:28] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37]
[2024-06-07 11:43:28] [INFO ] Parsed PT model containing 1559 places and 2965 transitions and 14810 arcs in 336 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 116 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 7028 ms. (5 steps per ms) remains 8/16 properties
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 4910 ms. (8 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2974 ms. (13 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 605 ms. (66 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10983 ms. (3 steps per ms) remains 7/8 properties
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 385 ms. (103 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 379 ms. (105 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 456 ms. (87 steps per ms) remains 7/7 properties
// Phase 1: matrix 2965 rows 1559 cols
[2024-06-07 11:43:36] [INFO ] Computed 77 invariants in 56 ms
[2024-06-07 11:43:36] [INFO ] State equation strengthened by 63 read => feed constraints.
Problem BlocksWorld-PT-07-ReachabilityCardinality-2024-00 is UNSAT
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-07-ReachabilityCardinality-2024-03 is UNSAT
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-07-ReachabilityCardinality-2024-04 is UNSAT
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-07-ReachabilityCardinality-2024-05 is UNSAT
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-07-ReachabilityCardinality-2024-06 is UNSAT
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-07-ReachabilityCardinality-2024-07 is UNSAT
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1559 variables, 77/77 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1559 variables, 0/77 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2964/4523 variables, 1559/1636 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4523 variables, 62/1698 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4523 variables, 0/1698 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4524 variables, 1/1699 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4524 variables, 0/1699 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4524 variables, 0/1699 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4524/4524 variables, and 1699 constraints, problems are : Problem set: 6 solved, 1 unsolved in 2330 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1559/1559 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1442/1504 variables, 64/64 constraints. Problems are: Problem set: 6 solved, 1 unsolved
[2024-06-07 11:43:42] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1504 variables, 1/65 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1504 variables, 0/65 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 55/1559 variables, 13/78 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1559 variables, 0/78 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2964/4523 variables, 1559/1637 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4523 variables, 62/1699 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4523 variables, 1/1700 constraints. Problems are: Problem set: 6 solved, 1 unsolved
[2024-06-07 11:43:45] [INFO ] Deduced a trap composed of 144 places in 871 ms of which 10 ms to minimize.
[2024-06-07 11:43:45] [INFO ] Deduced a trap composed of 204 places in 222 ms of which 7 ms to minimize.
[2024-06-07 11:43:45] [INFO ] Deduced a trap composed of 76 places in 335 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/4523 variables, 3/1703 constraints. Problems are: Problem set: 6 solved, 1 unsolved
[2024-06-07 11:43:46] [INFO ] Deduced a trap composed of 399 places in 722 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/4523 variables, 1/1704 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4523 variables, 0/1704 constraints. Problems are: Problem set: 6 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4524/4524 variables, and 1705 constraints, problems are : Problem set: 6 solved, 1 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1559/1559 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 10671ms problems are : Problem set: 6 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 62 out of 1559 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1559/1559 places, 2965/2965 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1559 transition count 2964
Applied a total of 1 rules in 7663 ms. Remains 1559 /1559 variables (removed 0) and now considering 2964/2965 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7674 ms. Remains : 1559/1559 places, 2964/2965 transitions.
RANDOM walk for 40000 steps (8 resets) in 1826 ms. (21 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 446 ms. (89 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 367828 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 1
Probabilistic random walk after 367828 steps, saw 318928 distinct states, run finished after 3005 ms. (steps per millisecond=122 ) properties seen :0
// Phase 1: matrix 2964 rows 1559 cols
[2024-06-07 11:43:58] [INFO ] Computed 77 invariants in 29 ms
[2024-06-07 11:43:58] [INFO ] State equation strengthened by 62 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1442/1504 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1504 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/1559 variables, 13/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1559 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2964/4523 variables, 1559/1636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4523 variables, 62/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4523 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4523 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4523/4523 variables, and 1698 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1341 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1559/1559 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1442/1504 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 11:44:00] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1504 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1504 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 55/1559 variables, 13/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1559 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2964/4523 variables, 1559/1637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4523 variables, 62/1699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4523 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 11:44:02] [INFO ] Deduced a trap composed of 144 places in 945 ms of which 8 ms to minimize.
[2024-06-07 11:44:03] [INFO ] Deduced a trap composed of 204 places in 187 ms of which 3 ms to minimize.
[2024-06-07 11:44:03] [INFO ] Deduced a trap composed of 76 places in 311 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/4523 variables, 3/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 11:44:04] [INFO ] Deduced a trap composed of 399 places in 811 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/4523 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4523 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/4523 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4523/4523 variables, and 1704 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1559/1559 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 6428ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 192 ms.
Support contains 62 out of 1559 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1559/1559 places, 2964/2964 transitions.
Applied a total of 0 rules in 5215 ms. Remains 1559 /1559 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5215 ms. Remains : 1559/1559 places, 2964/2964 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1559/1559 places, 2964/2964 transitions.
Applied a total of 0 rules in 5224 ms. Remains 1559 /1559 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
[2024-06-07 11:44:15] [INFO ] Invariant cache hit.
[2024-06-07 11:44:16] [INFO ] Implicit Places using invariants in 1150 ms returned []
[2024-06-07 11:44:16] [INFO ] Invariant cache hit.
[2024-06-07 11:44:18] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-07 11:44:20] [INFO ] Implicit Places using invariants and state equation in 3704 ms returned []
Implicit Place search using SMT with State Equation took 4869 ms to find 0 implicit places.
[2024-06-07 11:44:20] [INFO ] Redundant transitions in 190 ms returned []
Running 2957 sub problems to find dead transitions.
[2024-06-07 11:44:20] [INFO ] Invariant cache hit.
[2024-06-07 11:44:20] [INFO ] State equation strengthened by 62 read => feed constraints.
Problem TDEAD115 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2094 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2262 is UNSAT
Problem TDEAD2314 is UNSAT
Problem TDEAD2364 is UNSAT
Problem TDEAD2412 is UNSAT
Problem TDEAD2458 is UNSAT
Problem TDEAD2502 is UNSAT
Problem TDEAD2544 is UNSAT
Problem TDEAD2622 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2754 is UNSAT
Problem TDEAD2808 is UNSAT
Problem TDEAD2832 is UNSAT
Problem TDEAD2854 is UNSAT
Problem TDEAD2874 is UNSAT
Problem TDEAD2892 is UNSAT
Problem TDEAD2908 is UNSAT
Problem TDEAD2922 is UNSAT
Problem TDEAD2934 is UNSAT
Problem TDEAD2944 is UNSAT
Problem TDEAD2952 is UNSAT
Problem TDEAD2958 is UNSAT
Problem TDEAD2962 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 1.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 1.0)
(s534 0.0)
(s535 1.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 1.0)
(s553 0.0)
(s554 0.0)
(s556 1.0)
(s557 0.0)
(s558 1.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 1.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 1.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 1.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 1.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 1.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 1.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 1.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 1.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 1.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 1.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 1.0)
(s954timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 64/64 constraints. Problems are: Problem set: 64 solved, 2893 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1552/4523 variables, and 64 constraints, problems are : Problem set: 64 solved, 2893 unsolved in 30120 ms.
Refiners :[Positive P Invariants (semi-flows): 64/77 constraints, State Equation: 0/1559 constraints, ReadFeed: 0/62 constraints, PredecessorRefiner: 2925/1482 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 64 solved, 2893 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 7/7 constraints. Problems are: Problem set: 64 solved, 2893 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/4523 variables, and 7 constraints, problems are : Problem set: 64 solved, 2893 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 7/77 constraints, State Equation: 0/1559 constraints, ReadFeed: 0/62 constraints, PredecessorRefiner: 1443/1482 constraints, Known Traps: 0/0 constraints]
After SMT, in 84803ms problems are : Problem set: 64 solved, 2893 unsolved
Search for dead transitions found 64 dead transitions in 84835ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 1559/1559 places, 2900/2964 transitions.
Graph (complete) has 7352 edges and 1559 vertex of which 1529 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.2 ms
Discarding 30 places :
Also discarding 0 output transitions
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 1 rules in 5377 ms. Remains 1529 /1559 variables (removed 30) and now considering 2900/2900 (removed 0) transitions.
// Phase 1: matrix 2900 rows 1529 cols
[2024-06-07 11:45:51] [INFO ] Computed 79 invariants in 28 ms
[2024-06-07 11:45:52] [INFO ] Implicit Places using invariants in 1070 ms returned []
[2024-06-07 11:45:52] [INFO ] Invariant cache hit.
[2024-06-07 11:45:53] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-07 11:45:54] [INFO ] Implicit Places using invariants and state equation in 2718 ms returned []
Implicit Place search using SMT with State Equation took 3793 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1529/1559 places, 2900/2964 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 104319 ms. Remains : 1529/1559 places, 2900/2964 transitions.
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
RANDOM walk for 40000 steps (8 resets) in 1387 ms. (28 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 409489 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 1
Probabilistic random walk after 409489 steps, saw 356430 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
// Phase 1: matrix 2900 rows 1527 cols
[2024-06-07 11:45:58] [INFO ] Computed 77 invariants in 20 ms
[2024-06-07 11:45:58] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1399/1459 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1459 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/1527 variables, 15/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1527 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2900/4427 variables, 1527/1604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4427 variables, 12/1616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4427 variables, 0/1616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4427 variables, 0/1616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4427/4427 variables, and 1616 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1059 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1527/1527 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1399/1459 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1459 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/1527 variables, 15/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1527 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2900/4427 variables, 1527/1604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4427 variables, 12/1616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4427 variables, 1/1617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 11:46:00] [INFO ] Deduced a trap composed of 256 places in 258 ms of which 4 ms to minimize.
[2024-06-07 11:46:01] [INFO ] Deduced a trap composed of 364 places in 511 ms of which 6 ms to minimize.
[2024-06-07 11:46:01] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2024-06-07 11:46:02] [INFO ] Deduced a trap composed of 111 places in 466 ms of which 5 ms to minimize.
[2024-06-07 11:46:02] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/4427 variables, 5/1622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 11:46:02] [INFO ] Deduced a trap composed of 204 places in 184 ms of which 3 ms to minimize.
[2024-06-07 11:46:02] [INFO ] Deduced a trap composed of 204 places in 182 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/4427 variables, 2/1624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 11:46:03] [INFO ] Deduced a trap composed of 364 places in 490 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/4427 variables, 1/1625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4427 variables, 0/1625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/4427 variables, 0/1625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4427/4427 variables, and 1625 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4660 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1527/1527 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 5779ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 212 ms.
Support contains 60 out of 1527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1527/1527 places, 2900/2900 transitions.
Applied a total of 0 rules in 5240 ms. Remains 1527 /1527 variables (removed 0) and now considering 2900/2900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5241 ms. Remains : 1527/1527 places, 2900/2900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1527/1527 places, 2900/2900 transitions.
Applied a total of 0 rules in 5333 ms. Remains 1527 /1527 variables (removed 0) and now considering 2900/2900 (removed 0) transitions.
[2024-06-07 11:46:14] [INFO ] Invariant cache hit.
[2024-06-07 11:46:15] [INFO ] Implicit Places using invariants in 1033 ms returned []
[2024-06-07 11:46:15] [INFO ] Invariant cache hit.
[2024-06-07 11:46:16] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-07 11:46:18] [INFO ] Implicit Places using invariants and state equation in 2694 ms returned []
Implicit Place search using SMT with State Equation took 3732 ms to find 0 implicit places.
[2024-06-07 11:46:18] [INFO ] Redundant transitions in 131 ms returned []
Running 2893 sub problems to find dead transitions.
[2024-06-07 11:46:18] [INFO ] Invariant cache hit.
[2024-06-07 11:46:18] [INFO ] State equation strengthened by 12 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2893 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1520/4427 variables, and 64 constraints, problems are : Problem set: 0 solved, 2893 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 64/77 constraints, State Equation: 0/1527 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 2893/1450 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2893 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2893 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/4427 variables, and 64 constraints, problems are : Problem set: 0 solved, 2893 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 64/77 constraints, State Equation: 0/1527 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 1443/1450 constraints, Known Traps: 0/0 constraints]
After SMT, in 81915ms problems are : Problem set: 0 solved, 2893 unsolved
Search for dead transitions found 0 dead transitions in 81948ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91167 ms. Remains : 1527/1527 places, 2900/2900 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 4991 ms. Remains 1527 /1527 variables (removed 0) and now considering 2900/2900 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-07 11:47:45] [INFO ] Invariant cache hit.
[2024-06-07 11:47:45] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 11:47:46] [INFO ] [Nat]Absence check using 77 positive place invariants in 37 ms returned sat
[2024-06-07 11:47:47] [INFO ] After 1058ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-07 11:47:47] [INFO ] Deduced a trap composed of 112 places in 103 ms of which 2 ms to minimize.
[2024-06-07 11:47:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
TRAPS : Iteration 1
[2024-06-07 11:47:48] [INFO ] Deduced a trap composed of 76 places in 613 ms of which 7 ms to minimize.
[2024-06-07 11:47:48] [INFO ] Deduced a trap composed of 205 places in 188 ms of which 3 ms to minimize.
[2024-06-07 11:47:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1035 ms
TRAPS : Iteration 2
[2024-06-07 11:47:50] [INFO ] Deduced a trap composed of 76 places in 1097 ms of which 12 ms to minimize.
[2024-06-07 11:47:51] [INFO ] Deduced a trap composed of 144 places in 1090 ms of which 10 ms to minimize.
[2024-06-07 11:47:52] [INFO ] Deduced a trap composed of 76 places in 1083 ms of which 10 ms to minimize.
[2024-06-07 11:47:53] [INFO ] Deduced a trap composed of 393 places in 1127 ms of which 10 ms to minimize.
[2024-06-07 11:47:53] [INFO ] Deduced a trap composed of 258 places in 257 ms of which 4 ms to minimize.
[2024-06-07 11:47:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5165 ms
TRAPS : Iteration 3
[2024-06-07 11:47:54] [INFO ] Deduced a trap composed of 281 places in 280 ms of which 4 ms to minimize.
[2024-06-07 11:47:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 436 ms
TRAPS : Iteration 4
[2024-06-07 11:47:55] [INFO ] Deduced a trap composed of 112 places in 102 ms of which 2 ms to minimize.
[2024-06-07 11:47:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
TRAPS : Iteration 5
[2024-06-07 11:47:55] [INFO ] Deduced a trap composed of 204 places in 202 ms of which 3 ms to minimize.
[2024-06-07 11:47:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 370 ms
TRAPS : Iteration 6
[2024-06-07 11:47:55] [INFO ] After 9709ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-07 11:47:56] [INFO ] After 10111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 15327 ms.
[2024-06-07 11:47:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-06-07 11:47:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1527 places, 2900 transitions and 14424 arcs took 16 ms.
[2024-06-07 11:47:56] [INFO ] Flatten gal took : 306 ms
Total runtime 268252 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BlocksWorld-PT-07

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1527
TRANSITIONS: 2900
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.068s, Sys 0.009s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.007s, Sys 0.003s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 713
MODEL NAME: /home/mcc/execution/414/model
1527 places, 2900 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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="BlocksWorld-PT-07"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BlocksWorld-PT-07, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r601-tall-171774424000214"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-07.tgz
mv BlocksWorld-PT-07 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;