About the Execution of LTSMin+red for BlocksWorld-PT-01
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1059.407 | 80761.00 | 111934.00 | 206.60 | ?TF??TFFTTFFFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r605-tall-171774426700167.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BlocksWorld-PT-01, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r605-tall-171774426700167
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 42K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 240K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 28K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 170K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 93K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 500K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 32K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 192K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.4K 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 87K 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-01-ReachabilityFireability-2024-00
FORMULA_NAME BlocksWorld-PT-01-ReachabilityFireability-2024-01
FORMULA_NAME BlocksWorld-PT-01-ReachabilityFireability-2024-02
FORMULA_NAME BlocksWorld-PT-01-ReachabilityFireability-2024-03
FORMULA_NAME BlocksWorld-PT-01-ReachabilityFireability-2024-04
FORMULA_NAME BlocksWorld-PT-01-ReachabilityFireability-2024-05
FORMULA_NAME BlocksWorld-PT-01-ReachabilityFireability-2024-06
FORMULA_NAME BlocksWorld-PT-01-ReachabilityFireability-2024-07
FORMULA_NAME BlocksWorld-PT-01-ReachabilityFireability-2024-08
FORMULA_NAME BlocksWorld-PT-01-ReachabilityFireability-2024-09
FORMULA_NAME BlocksWorld-PT-01-ReachabilityFireability-2024-10
FORMULA_NAME BlocksWorld-PT-01-ReachabilityFireability-2024-11
FORMULA_NAME BlocksWorld-PT-01-ReachabilityFireability-2024-12
FORMULA_NAME BlocksWorld-PT-01-ReachabilityFireability-2024-13
FORMULA_NAME BlocksWorld-PT-01-ReachabilityFireability-2024-14
FORMULA_NAME BlocksWorld-PT-01-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717745486119
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 07:31:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-07 07:31:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:31:27] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-06-07 07:31:27] [INFO ] Transformed 109 places.
[2024-06-07 07:31:27] [INFO ] Transformed 181 transitions.
[2024-06-07 07:31:27] [INFO ] Found NUPN structural information;
[2024-06-07 07:31:27] [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]
[2024-06-07 07:31:27] [INFO ] Parsed PT model containing 109 places and 181 transitions and 896 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2123 ms. (18 steps per ms) remains 13/15 properties
FORMULA BlocksWorld-PT-01-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-01-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 336 ms. (118 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1087 ms. (36 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1424 ms. (28 steps per ms) remains 11/13 properties
FORMULA BlocksWorld-PT-01-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-01-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 344 ms. (115 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1452 ms. (27 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1180 ms. (33 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 223 ms. (178 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 154 ms. (258 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 148 ms. (268 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 103 ms. (384 steps per ms) remains 11/11 properties
// Phase 1: matrix 181 rows 109 cols
[2024-06-07 07:31:30] [INFO ] Computed 19 invariants in 12 ms
[2024-06-07 07:31:30] [INFO ] State equation strengthened by 15 read => feed constraints.
Problem BlocksWorld-PT-01-ReachabilityFireability-2024-06 is UNSAT
FORMULA BlocksWorld-PT-01-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-01-ReachabilityFireability-2024-08 is UNSAT
FORMULA BlocksWorld-PT-01-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-01-ReachabilityFireability-2024-10 is UNSAT
FORMULA BlocksWorld-PT-01-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-01-ReachabilityFireability-2024-11 is UNSAT
FORMULA BlocksWorld-PT-01-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-01-ReachabilityFireability-2024-12 is UNSAT
FORMULA BlocksWorld-PT-01-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-01-ReachabilityFireability-2024-13 is UNSAT
FORMULA BlocksWorld-PT-01-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-01-ReachabilityFireability-2024-14 is UNSAT
FORMULA BlocksWorld-PT-01-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 19/19 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 180/289 variables, 109/128 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 14/142 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/142 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/290 variables, 1/143 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/143 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/143 constraints. Problems are: Problem set: 7 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 143 constraints, problems are : Problem set: 7 solved, 4 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 19/19 constraints. Problems are: Problem set: 7 solved, 4 unsolved
[2024-06-07 07:31:31] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 10 ms to minimize.
[2024-06-07 07:31:31] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
Problem BlocksWorld-PT-01-ReachabilityFireability-2024-01 is UNSAT
FORMULA BlocksWorld-PT-01-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-01-ReachabilityFireability-2024-07 is UNSAT
FORMULA BlocksWorld-PT-01-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 2/21 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/21 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 180/289 variables, 109/130 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 14/144 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 2/146 constraints. Problems are: Problem set: 9 solved, 2 unsolved
[2024-06-07 07:31:31] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 1/147 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/147 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/290 variables, 1/148 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/148 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/290 variables, 0/148 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 148 constraints, problems are : Problem set: 9 solved, 2 unsolved in 451 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/11 constraints, Known Traps: 3/3 constraints]
After SMT, in 1445ms problems are : Problem set: 9 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 7 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 181/181 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 109 transition count 180
Applied a total of 1 rules in 102 ms. Remains 109 /109 variables (removed 0) and now considering 180/181 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 109/109 places, 180/181 transitions.
RANDOM walk for 40000 steps (8 resets) in 425 ms. (93 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 597562 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :0 out of 2
Probabilistic random walk after 597562 steps, saw 319411 distinct states, run finished after 3014 ms. (steps per millisecond=198 ) properties seen :0
// Phase 1: matrix 180 rows 109 cols
[2024-06-07 07:31:35] [INFO ] Computed 19 invariants in 7 ms
[2024-06-07 07:31:35] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 92/99 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/109 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 180/289 variables, 109/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 14/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/289 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 142 constraints, problems are : Problem set: 0 solved, 2 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 92/99 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/109 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 180/289 variables, 109/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 14/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 144 constraints, problems are : Problem set: 0 solved, 2 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 267ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 7 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 180/180 transitions.
Applied a total of 0 rules in 31 ms. Remains 109 /109 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 109/109 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 180/180 transitions.
Applied a total of 0 rules in 32 ms. Remains 109 /109 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-06-07 07:31:35] [INFO ] Invariant cache hit.
[2024-06-07 07:31:35] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-07 07:31:35] [INFO ] Invariant cache hit.
[2024-06-07 07:31:35] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-07 07:31:35] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-06-07 07:31:35] [INFO ] Redundant transitions in 5 ms returned []
Running 178 sub problems to find dead transitions.
[2024-06-07 07:31:35] [INFO ] Invariant cache hit.
[2024-06-07 07:31:35] [INFO ] State equation strengthened by 14 read => feed constraints.
Problem TDEAD28 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 15/15 constraints. Problems are: Problem set: 14 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 14 solved, 164 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 2 (OVERLAPS) 2/109 variables, 4/19 constraints. Problems are: Problem set: 18 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/19 constraints. Problems are: Problem set: 18 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 180/289 variables, 109/128 constraints. Problems are: Problem set: 18 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 14/142 constraints. Problems are: Problem set: 18 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/142 constraints. Problems are: Problem set: 18 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/142 constraints. Problems are: Problem set: 18 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 142 constraints, problems are : Problem set: 18 solved, 160 unsolved in 3317 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 18 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 18 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 11/109 variables, 18/19 constraints. Problems are: Problem set: 18 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/19 constraints. Problems are: Problem set: 18 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 180/289 variables, 109/128 constraints. Problems are: Problem set: 18 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 14/142 constraints. Problems are: Problem set: 18 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 160/302 constraints. Problems are: Problem set: 18 solved, 160 unsolved
[2024-06-07 07:31:41] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:31:41] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:31:41] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-07 07:31:41] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:31:41] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:31:41] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:31:41] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:31:42] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:31:42] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:31:42] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:31:42] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:31:42] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-07 07:31:42] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-07 07:31:42] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-07 07:31:42] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:31:42] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:31:42] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:31:42] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:31:42] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:31:43] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 20/322 constraints. Problems are: Problem set: 18 solved, 160 unsolved
[2024-06-07 07:31:43] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:31:44] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:31:44] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:31:44] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:31:44] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:31:44] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 0 ms to minimize.
[2024-06-07 07:31:44] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:31:44] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:31:44] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:31:44] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:31:45] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:31:45] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:31:45] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:31:45] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:31:45] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:31:45] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:31:45] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:31:45] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:31:45] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:31:46] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 20/342 constraints. Problems are: Problem set: 18 solved, 160 unsolved
[2024-06-07 07:31:47] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:31:47] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:31:47] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:31:48] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 4/346 constraints. Problems are: Problem set: 18 solved, 160 unsolved
[2024-06-07 07:31:50] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:31:50] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:31:51] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:31:51] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:31:52] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 5/351 constraints. Problems are: Problem set: 18 solved, 160 unsolved
[2024-06-07 07:31:54] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:31:54] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:31:55] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 3/354 constraints. Problems are: Problem set: 18 solved, 160 unsolved
[2024-06-07 07:31:57] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:31:57] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 3 ms to minimize.
[2024-06-07 07:31:57] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:31:57] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:31:58] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:31:58] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:31:59] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 7/361 constraints. Problems are: Problem set: 18 solved, 160 unsolved
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 2 ms to minimize.
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:32:01] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:32:02] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:32:02] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 6/367 constraints. Problems are: Problem set: 18 solved, 160 unsolved
[2024-06-07 07:32:04] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:32:05] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:32:05] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:32:05] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:32:06] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:32:06] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:32:07] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 7/374 constraints. Problems are: Problem set: 18 solved, 160 unsolved
[2024-06-07 07:32:09] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:32:09] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/289 variables, and 376 constraints, problems are : Problem set: 18 solved, 160 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 160/178 constraints, Known Traps: 74/74 constraints]
After SMT, in 33686ms problems are : Problem set: 18 solved, 160 unsolved
Search for dead transitions found 18 dead transitions in 33689ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 109/109 places, 162/180 transitions.
Graph (complete) has 432 edges and 109 vertex of which 100 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 30 ms. Remains 100 /109 variables (removed 9) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 100 cols
[2024-06-07 07:32:09] [INFO ] Computed 19 invariants in 2 ms
[2024-06-07 07:32:09] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-07 07:32:09] [INFO ] Invariant cache hit.
[2024-06-07 07:32:09] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 100/109 places, 162/180 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 34139 ms. Remains : 100/109 places, 162/180 transitions.
RANDOM walk for 40000 steps (8 resets) in 269 ms. (148 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 723251 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :0 out of 2
Probabilistic random walk after 723251 steps, saw 382546 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :0
[2024-06-07 07:32:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/91 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/100 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:32:12] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 120 constraints, problems are : Problem set: 0 solved, 2 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/91 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/100 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 162/262 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/262 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 122 constraints, problems are : Problem set: 0 solved, 2 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 313ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 7 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 162/162 transitions.
Applied a total of 0 rules in 18 ms. Remains 100 /100 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 100/100 places, 162/162 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 162/162 transitions.
Applied a total of 0 rules in 18 ms. Remains 100 /100 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2024-06-07 07:32:13] [INFO ] Invariant cache hit.
[2024-06-07 07:32:13] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-07 07:32:13] [INFO ] Invariant cache hit.
[2024-06-07 07:32:13] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-06-07 07:32:13] [INFO ] Redundant transitions in 4 ms returned []
Running 160 sub problems to find dead transitions.
[2024-06-07 07:32:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 119 constraints, problems are : Problem set: 0 solved, 160 unsolved in 2815 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 160/279 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-06-07 07:32:18] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:32:18] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 3 ms to minimize.
[2024-06-07 07:32:18] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:32:18] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:32:18] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:32:18] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-06-07 07:32:18] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:32:18] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-07 07:32:18] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:32:18] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:32:18] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:32:18] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:32:18] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:32:19] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:32:19] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:32:19] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-07 07:32:19] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:32:19] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:32:19] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:32:19] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 20/299 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-06-07 07:32:20] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:32:20] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:32:20] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:32:20] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:32:20] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:32:21] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:32:21] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-07 07:32:21] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:32:21] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:32:21] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:32:21] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:32:21] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:32:21] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:32:22] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:32:22] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:32:22] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:32:22] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:32:22] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 18/317 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-06-07 07:32:23] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:32:23] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:32:23] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:32:23] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-06-07 07:32:23] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:32:23] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:32:24] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:32:24] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:32:24] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:32:24] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:32:25] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:32:25] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:32:25] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:32:25] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:32:25] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:32:25] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:32:25] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:32:25] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:32:25] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:32:26] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 20/337 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-06-07 07:32:27] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:32:27] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:32:27] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:32:27] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:32:27] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:32:28] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:32:28] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 2 ms to minimize.
[2024-06-07 07:32:28] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:32:28] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:32:28] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:32:28] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-06-07 07:32:28] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:32:29] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:32:29] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 14/351 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-06-07 07:32:31] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:32:31] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:32:31] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:32:32] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:32:32] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:32:32] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:32:32] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:32:33] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:32:33] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:32:33] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:32:33] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:32:33] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:32:34] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:32:34] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:32:34] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 15/366 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-06-07 07:32:36] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:32:36] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:32:36] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:32:36] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:32:36] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:32:36] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:32:37] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:32:37] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:32:37] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-07 07:32:37] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:32:37] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:32:37] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:32:37] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:32:37] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:32:38] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:32:38] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:32:38] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:32:38] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-06-07 07:32:38] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:32:38] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 20/386 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-06-07 07:32:40] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:32:40] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:32:41] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-07 07:32:41] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:32:41] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:32:41] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:32:41] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:32:42] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:32:42] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:32:42] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:32:42] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-06-07 07:32:42] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:32:42] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-06-07 07:32:42] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:32:43] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:32:43] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:32:43] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:32:43] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2024-06-07 07:32:43] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:32:43] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 20/406 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-06-07 07:32:45] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:32:46] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:32:46] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:32:46] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:32:46] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
SMT process timed out in 33091ms, After SMT, problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 33093ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33283 ms. Remains : 100/100 places, 162/162 transitions.
[2024-06-07 07:32:46] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-06-07 07:32:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 100 places, 162 transitions and 792 arcs took 4 ms.
[2024-06-07 07:32:46] [INFO ] Flatten gal took : 41 ms
Total runtime 79341 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : BlocksWorld-PT-01-ReachabilityFireability-2024-00
Could not compute solution for formula : BlocksWorld-PT-01-ReachabilityFireability-2024-03
BK_STOP 1717745566880
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name BlocksWorld-PT-01-ReachabilityFireability-2024-00
rfs formula type AG
rfs formula formula --invariant=/tmp/1202/inv_0_
rfs formula name BlocksWorld-PT-01-ReachabilityFireability-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/1202/inv_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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-01"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BlocksWorld-PT-01, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r605-tall-171774426700167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-01.tgz
mv BlocksWorld-PT-01 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;