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.r377-smll-171683809800135.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 SieveSingleMsgMbox-PT-d2m64, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683809800135
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 12 19:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 12 19:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716929252989

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m64
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 20:47:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 20:47:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 20:47:36] [INFO ] Load time of PNML (sax parser for PT used): 503 ms
[2024-05-28 20:47:36] [INFO ] Transformed 2398 places.
[2024-05-28 20:47:36] [INFO ] Transformed 1954 transitions.
[2024-05-28 20:47:36] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 810 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 43 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1984 places in 22 ms
Reduce places removed 1984 places and 0 transitions.
RANDOM walk for 40000 steps (8859 resets) in 3825 ms. (10 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (189 resets) in 137 ms. (29 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (184 resets) in 78 ms. (50 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (172 resets) in 92 ms. (43 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (382 resets) in 103 ms. (38 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (383 resets) in 75 ms. (52 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (180 resets) in 106 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (170 resets) in 51 ms. (76 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (163 resets) in 66 ms. (59 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (184 resets) in 70 ms. (56 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (168 resets) in 78 ms. (50 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (157 resets) in 125 ms. (31 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (178 resets) in 97 ms. (40 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (181 resets) in 107 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (178 resets) in 98 ms. (40 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (180 resets) in 68 ms. (58 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (178 resets) in 71 ms. (55 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 192626 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :6 out of 16
Probabilistic random walk after 192626 steps, saw 87585 distinct states, run finished after 3008 ms. (steps per millisecond=64 ) properties seen :6
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1954 rows 414 cols
[2024-05-28 20:47:41] [INFO ] Computed 6 invariants in 98 ms
[2024-05-28 20:47:41] [INFO ] State equation strengthened by 1674 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 173/262 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-2024-02 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-2024-10 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-2024-12 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-2024-13 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-2024-15 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 152/414 variables, 3/6 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/6 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1954/2368 variables, 414/420 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2368 variables, 1674/2094 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2368 variables, 0/2094 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/2368 variables, 0/2094 constraints. Problems are: Problem set: 5 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2368/2368 variables, and 2094 constraints, problems are : Problem set: 5 solved, 5 unsolved in 4404 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 1674/1674 constraints, PredecessorRefiner: 10/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 145/177 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 52/229 variables, 2/3 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 185/414 variables, 3/6 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-05-28 20:47:47] [INFO ] Deduced a trap composed of 158 places in 533 ms of which 54 ms to minimize.
[2024-05-28 20:47:48] [INFO ] Deduced a trap composed of 106 places in 403 ms of which 6 ms to minimize.
[2024-05-28 20:47:48] [INFO ] Deduced a trap composed of 92 places in 464 ms of which 6 ms to minimize.
[2024-05-28 20:47:49] [INFO ] Deduced a trap composed of 44 places in 419 ms of which 6 ms to minimize.
[2024-05-28 20:47:49] [INFO ] Deduced a trap composed of 106 places in 511 ms of which 5 ms to minimize.
[2024-05-28 20:47:50] [INFO ] Deduced a trap composed of 106 places in 362 ms of which 4 ms to minimize.
[2024-05-28 20:47:50] [INFO ] Deduced a trap composed of 168 places in 339 ms of which 3 ms to minimize.
[2024-05-28 20:47:51] [INFO ] Deduced a trap composed of 224 places in 557 ms of which 7 ms to minimize.
[2024-05-28 20:47:51] [INFO ] Deduced a trap composed of 188 places in 587 ms of which 6 ms to minimize.
[2024-05-28 20:47:52] [INFO ] Deduced a trap composed of 202 places in 605 ms of which 7 ms to minimize.
SMT process timed out in 11248ms, After SMT, problems are : Problem set: 5 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.12 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 926 place count 293 transition count 714
Iterating global reduction 1 with 95 rules applied. Total rules applied 1021 place count 293 transition count 714
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 1032 place count 293 transition count 703
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 1094 place count 231 transition count 641
Iterating global reduction 2 with 62 rules applied. Total rules applied 1156 place count 231 transition count 641
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 1182 place count 231 transition count 615
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1208 place count 205 transition count 585
Iterating global reduction 3 with 26 rules applied. Total rules applied 1234 place count 205 transition count 585
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 3 with 90 rules applied. Total rules applied 1324 place count 205 transition count 495
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1329 place count 200 transition count 484
Iterating global reduction 4 with 5 rules applied. Total rules applied 1334 place count 200 transition count 484
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1339 place count 195 transition count 479
Iterating global reduction 4 with 5 rules applied. Total rules applied 1344 place count 195 transition count 479
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1347 place count 192 transition count 475
Iterating global reduction 4 with 3 rules applied. Total rules applied 1350 place count 192 transition count 475
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1352 place count 190 transition count 473
Iterating global reduction 4 with 2 rules applied. Total rules applied 1354 place count 190 transition count 473
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1356 place count 188 transition count 471
Iterating global reduction 4 with 2 rules applied. Total rules applied 1358 place count 188 transition count 471
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1359 place count 187 transition count 470
Iterating global reduction 4 with 1 rules applied. Total rules applied 1360 place count 187 transition count 470
Applied a total of 1360 rules in 369 ms. Remains 187 /414 variables (removed 227) and now considering 470/1954 (removed 1484) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 392 ms. Remains : 187/414 places, 470/1954 transitions.
RANDOM walk for 40000 steps (8979 resets) in 612 ms. (65 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (4201 resets) in 476 ms. (83 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (4204 resets) in 304 ms. (131 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1870 resets) in 259 ms. (153 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1890 resets) in 181 ms. (219 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1878 resets) in 145 ms. (273 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 395331 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :1 out of 5
Probabilistic random walk after 395331 steps, saw 185269 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :1
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 470 rows 187 cols
[2024-05-28 20:47:56] [INFO ] Computed 4 invariants in 5 ms
[2024-05-28 20:47:56] [INFO ] State equation strengthened by 326 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 77/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 12/125 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 375/500 variables, 125/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 231/360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 157/657 variables, 62/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/657 variables, 95/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/657 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/657 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 657/657 variables, and 517 constraints, problems are : Problem set: 0 solved, 4 unsolved in 737 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 187/187 constraints, ReadFeed: 326/326 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 77/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 12/125 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 20:47:57] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-05-28 20:47:57] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 375/500 variables, 125/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 231/362 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 157/657 variables, 62/424 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/657 variables, 95/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/657 variables, 4/523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 20:47:59] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/657 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/657 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/657 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 657/657 variables, and 524 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3730 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 187/187 constraints, ReadFeed: 326/326 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 4529ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 7508 ms.
Support contains 22 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 470/470 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 180 transition count 389
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 180 transition count 389
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 173 transition count 382
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 173 transition count 382
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 173 transition count 378
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 170 transition count 373
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 170 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 170 transition count 372
Applied a total of 39 rules in 70 ms. Remains 170 /187 variables (removed 17) and now considering 372/470 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 170/187 places, 372/470 transitions.
RANDOM walk for 40000 steps (9007 resets) in 453 ms. (88 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4104 resets) in 276 ms. (144 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4159 resets) in 235 ms. (169 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1842 resets) in 182 ms. (218 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1855 resets) in 181 ms. (219 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 417894 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 4
Probabilistic random walk after 417894 steps, saw 194582 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
// Phase 1: matrix 372 rows 170 cols
[2024-05-28 20:48:11] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 20:48:12] [INFO ] State equation strengthened by 244 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 73/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 11/120 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 355/475 variables, 120/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 227/351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 67/542 variables, 50/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/542 variables, 17/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/542 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/542 variables, and 418 constraints, problems are : Problem set: 0 solved, 4 unsolved in 757 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 170/170 constraints, ReadFeed: 244/244 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 73/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 11/120 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 355/475 variables, 120/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 227/351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 67/542 variables, 50/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/542 variables, 17/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 4/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 20:48:13] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/542 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 542/542 variables, and 423 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2437 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 170/170 constraints, ReadFeed: 244/244 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 3245ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1735 ms.
Support contains 22 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 372/372 transitions.
Applied a total of 0 rules in 22 ms. Remains 170 /170 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 170/170 places, 372/372 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 372/372 transitions.
Applied a total of 0 rules in 18 ms. Remains 170 /170 variables (removed 0) and now considering 372/372 (removed 0) transitions.
[2024-05-28 20:48:17] [INFO ] Invariant cache hit.
[2024-05-28 20:48:17] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-28 20:48:17] [INFO ] Invariant cache hit.
[2024-05-28 20:48:17] [INFO ] State equation strengthened by 244 read => feed constraints.
[2024-05-28 20:48:18] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1195 ms to find 0 implicit places.
[2024-05-28 20:48:18] [INFO ] Redundant transitions in 26 ms returned []
Running 371 sub problems to find dead transitions.
[2024-05-28 20:48:18] [INFO ] Invariant cache hit.
[2024-05-28 20:48:18] [INFO ] State equation strengthened by 244 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 372/542 variables, 170/174 constraints. Problems are: Problem set: 0 solved, 371 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 244/418 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 8 (OVERLAPS) 0/542 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 371 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/542 variables, and 418 constraints, problems are : Problem set: 0 solved, 371 unsolved in 24893 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 170/170 constraints, ReadFeed: 244/244 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 372/542 variables, 170/174 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 244/418 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 371/789 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-05-28 20:48:59] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 2 ms to minimize.
[2024-05-28 20:49:00] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-28 20:49:01] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 2 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 3/792 constraints. Problems are: Problem set: 3 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 542/542 variables, and 792 constraints, problems are : Problem set: 3 solved, 368 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 170/170 constraints, ReadFeed: 244/244 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 3/3 constraints]
After SMT, in 55931ms problems are : Problem set: 3 solved, 368 unsolved
Search for dead transitions found 3 dead transitions in 55939ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 170/170 places, 369/372 transitions.
Graph (complete) has 638 edges and 170 vertex of which 167 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 167 /170 variables (removed 3) and now considering 369/369 (removed 0) transitions.
// Phase 1: matrix 369 rows 167 cols
[2024-05-28 20:49:14] [INFO ] Computed 3 invariants in 3 ms
[2024-05-28 20:49:14] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-28 20:49:14] [INFO ] Invariant cache hit.
[2024-05-28 20:49:14] [INFO ] State equation strengthened by 243 read => feed constraints.
[2024-05-28 20:49:15] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 167/170 places, 369/372 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 58288 ms. Remains : 167/170 places, 369/372 transitions.
RANDOM walk for 40000 steps (8921 resets) in 340 ms. (117 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4101 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4151 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1886 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1926 resets) in 72 ms. (547 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 521551 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 4
Probabilistic random walk after 521551 steps, saw 240577 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
[2024-05-28 20:49:18] [INFO ] Invariant cache hit.
[2024-05-28 20:49:18] [INFO ] State equation strengthened by 243 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 81/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/107 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 349/456 variables, 107/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 223/333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 80/536 variables, 60/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 20/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/536 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 413 constraints, problems are : Problem set: 0 solved, 4 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, ReadFeed: 243/243 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 81/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/107 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 349/456 variables, 107/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 223/333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 80/536 variables, 60/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 20/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 20:49:20] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/536 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/536 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/536 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/536 variables, and 418 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2481 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, ReadFeed: 243/243 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 3070ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 8837 ms.
Support contains 22 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 369/369 transitions.
Applied a total of 0 rules in 19 ms. Remains 167 /167 variables (removed 0) and now considering 369/369 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 167/167 places, 369/369 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 369/369 transitions.
Applied a total of 0 rules in 14 ms. Remains 167 /167 variables (removed 0) and now considering 369/369 (removed 0) transitions.
[2024-05-28 20:49:30] [INFO ] Invariant cache hit.
[2024-05-28 20:49:30] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-28 20:49:30] [INFO ] Invariant cache hit.
[2024-05-28 20:49:30] [INFO ] State equation strengthened by 243 read => feed constraints.
[2024-05-28 20:49:31] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
[2024-05-28 20:49:31] [INFO ] Redundant transitions in 7 ms returned []
Running 368 sub problems to find dead transitions.
[2024-05-28 20:49:31] [INFO ] Invariant cache hit.
[2024-05-28 20:49:31] [INFO ] State equation strengthened by 243 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD341 is UNSAT
At refinement iteration 4 (OVERLAPS) 369/536 variables, 167/170 constraints. Problems are: Problem set: 3 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 243/413 constraints. Problems are: Problem set: 3 solved, 365 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 0/413 constraints. Problems are: Problem set: 3 solved, 365 unsolved
At refinement iteration 7 (OVERLAPS) 0/536 variables, 0/413 constraints. Problems are: Problem set: 3 solved, 365 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 413 constraints, problems are : Problem set: 3 solved, 365 unsolved in 24985 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, ReadFeed: 243/243 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 368/532 variables, 164/167 constraints. Problems are: Problem set: 3 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 242/409 constraints. Problems are: Problem set: 3 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 28/437 constraints. Problems are: Problem set: 3 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 0/437 constraints. Problems are: Problem set: 3 solved, 365 unsolved
At refinement iteration 8 (OVERLAPS) 4/536 variables, 3/440 constraints. Problems are: Problem set: 3 solved, 365 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 1/441 constraints. Problems are: Problem set: 3 solved, 365 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 337/778 constraints. Problems are: Problem set: 3 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 536/536 variables, and 778 constraints, problems are : Problem set: 3 solved, 365 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, ReadFeed: 243/243 constraints, PredecessorRefiner: 365/368 constraints, Known Traps: 0/0 constraints]
After SMT, in 55833ms problems are : Problem set: 3 solved, 365 unsolved
Search for dead transitions found 3 dead transitions in 55838ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 167/167 places, 366/369 transitions.
Graph (complete) has 629 edges and 167 vertex of which 164 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 164 /167 variables (removed 3) and now considering 366/366 (removed 0) transitions.
// Phase 1: matrix 366 rows 164 cols
[2024-05-28 20:50:27] [INFO ] Computed 3 invariants in 2 ms
[2024-05-28 20:50:27] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-28 20:50:27] [INFO ] Invariant cache hit.
[2024-05-28 20:50:27] [INFO ] State equation strengthened by 242 read => feed constraints.
[2024-05-28 20:50:28] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 164/167 places, 366/369 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 57857 ms. Remains : 164/167 places, 366/369 transitions.
RANDOM walk for 40000 steps (8974 resets) in 386 ms. (103 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (4039 resets) in 264 ms. (150 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (4033 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1885 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1851 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 565604 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 4
Probabilistic random walk after 565604 steps, saw 258752 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
[2024-05-28 20:50:31] [INFO ] Invariant cache hit.
[2024-05-28 20:50:31] [INFO ] State equation strengthened by 242 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 81/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/107 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 20:50:32] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 347/454 variables, 107/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 223/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 76/530 variables, 57/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 19/410 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/530 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/530 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/530 variables, and 410 constraints, problems are : Problem set: 0 solved, 4 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 164/164 constraints, ReadFeed: 242/242 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 81/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/107 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 347/454 variables, 107/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 223/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 76/530 variables, 57/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 19/410 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/530 variables, 4/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 20:50:33] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 2 ms to minimize.
Problem SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-2024-03 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (INCLUDED_ONLY) 0/530 variables, 1/415 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/530 variables, 0/415 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/530 variables, 0/415 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/530 variables, and 415 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1466 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 164/164 constraints, ReadFeed: 242/242 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 2151ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 1872 ms.
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 366/366 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 147 transition count 205
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 147 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 147 transition count 203
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 53 place count 130 transition count 184
Iterating global reduction 1 with 17 rules applied. Total rules applied 70 place count 130 transition count 184
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 79 place count 130 transition count 175
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 90 place count 119 transition count 156
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 119 transition count 156
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 108 place count 119 transition count 149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 116 transition count 145
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 116 transition count 145
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 113 transition count 142
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 113 transition count 142
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 111 transition count 140
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 111 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 126 place count 111 transition count 138
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 128 place count 109 transition count 136
Iterating global reduction 4 with 2 rules applied. Total rules applied 130 place count 109 transition count 136
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 131 place count 108 transition count 135
Iterating global reduction 4 with 1 rules applied. Total rules applied 132 place count 108 transition count 135
Applied a total of 132 rules in 50 ms. Remains 108 /164 variables (removed 56) and now considering 135/366 (removed 231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 108/164 places, 135/366 transitions.
RANDOM walk for 40000 steps (9021 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4126 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1848 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1925 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 765796 steps, run timeout after 3001 ms. (steps per millisecond=255 ) properties seen :0 out of 3
Probabilistic random walk after 765796 steps, saw 345170 distinct states, run finished after 3001 ms. (steps per millisecond=255 ) properties seen :0
// Phase 1: matrix 135 rows 108 cols
[2024-05-28 20:50:39] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 20:50:39] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 58/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 118/185 variables, 67/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 42/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 58/243 variables, 41/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 17/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/243 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 170 constraints, problems are : Problem set: 0 solved, 3 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 58/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 20:50:39] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:50:39] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 118/185 variables, 67/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 42/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 58/243 variables, 41/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 17/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/243 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 175 constraints, problems are : Problem set: 0 solved, 3 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 887ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2669 ms.
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 135/135 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 108/108 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 135/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-28 20:50:42] [INFO ] Invariant cache hit.
[2024-05-28 20:50:42] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-28 20:50:42] [INFO ] Invariant cache hit.
[2024-05-28 20:50:42] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-28 20:50:43] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2024-05-28 20:50:43] [INFO ] Redundant transitions in 1 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-28 20:50:43] [INFO ] Invariant cache hit.
[2024-05-28 20:50:43] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 135/243 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 59/170 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 170 constraints, problems are : Problem set: 0 solved, 134 unsolved in 4311 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 135/243 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 59/170 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 134/304 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-28 20:50:50] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD116 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 1/305 constraints. Problems are: Problem set: 2 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/305 constraints. Problems are: Problem set: 2 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/243 variables, 0/305 constraints. Problems are: Problem set: 2 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 305 constraints, problems are : Problem set: 2 solved, 132 unsolved in 11855 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 1/1 constraints]
After SMT, in 16306ms problems are : Problem set: 2 solved, 132 unsolved
Search for dead transitions found 2 dead transitions in 16308ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 108/108 places, 133/135 transitions.
Graph (complete) has 314 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 106 /108 variables (removed 2) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 106 cols
[2024-05-28 20:50:59] [INFO ] Computed 2 invariants in 2 ms
[2024-05-28 20:50:59] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-28 20:50:59] [INFO ] Invariant cache hit.
[2024-05-28 20:50:59] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 20:50:59] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 106/108 places, 133/135 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 17130 ms. Remains : 106/108 places, 133/135 transitions.
RANDOM walk for 40000 steps (8961 resets) in 207 ms. (192 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4108 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1864 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1885 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 728893 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 3
Probabilistic random walk after 728893 steps, saw 329232 distinct states, run finished after 3004 ms. (steps per millisecond=242 ) properties seen :0
[2024-05-28 20:51:03] [INFO ] Invariant cache hit.
[2024-05-28 20:51:03] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 105/148 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 30/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 89/237 variables, 61/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 28/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/239 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/239 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/239 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 166 constraints, problems are : Problem set: 0 solved, 3 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 105/148 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 30/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 89/237 variables, 61/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 28/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/239 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/239 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/239 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 169 constraints, problems are : Problem set: 0 solved, 3 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 746ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 3531 ms.
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 133/133 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 106/106 places, 133/133 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 133/133 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-05-28 20:51:07] [INFO ] Invariant cache hit.
[2024-05-28 20:51:07] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-28 20:51:07] [INFO ] Invariant cache hit.
[2024-05-28 20:51:07] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 20:51:07] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2024-05-28 20:51:07] [INFO ] Redundant transitions in 0 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-28 20:51:07] [INFO ] Invariant cache hit.
[2024-05-28 20:51:07] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/239 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 58/166 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 166 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4406 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/239 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 58/166 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 132/298 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-28 20:51:15] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/239 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 299 constraints, problems are : Problem set: 0 solved, 132 unsolved in 11866 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 1/1 constraints]
After SMT, in 16408ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 16410ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16825 ms. Remains : 106/106 places, 133/133 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 106 transition count 126
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 100 transition count 126
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 100 transition count 111
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 85 transition count 111
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 79 transition count 105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 77 transition count 114
Applied a total of 59 rules in 26 ms. Remains 77 /106 variables (removed 29) and now considering 114/133 (removed 19) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 114 rows 77 cols
[2024-05-28 20:51:24] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 20:51:24] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-28 20:51:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 20:51:24] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 20:51:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 20:51:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 20:51:24] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-28 20:51:24] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 4 ms to minimize.
[2024-05-28 20:51:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-28 20:51:24] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:51:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
TRAPS : Iteration 1
[2024-05-28 20:51:24] [INFO ] After 316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-28 20:51:24] [INFO ] After 416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 630 ms.
[2024-05-28 20:51:24] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-28 20:51:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 133 transitions and 526 arcs took 7 ms.
[2024-05-28 20:51:25] [INFO ] Flatten gal took : 60 ms
Total runtime 229801 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SieveSingleMsgMbox-PT-d2m64

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/407/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 106
TRANSITIONS: 133
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.001s]


SAVING FILE /home/mcc/execution/407/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.001s]


----------------------------------------------------------------------
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: 767
MODEL NAME: /home/mcc/execution/407/model
106 places, 133 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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716930987726

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="SieveSingleMsgMbox-PT-d2m64"
export BK_EXAMINATION="ReachabilityFireability"
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 SieveSingleMsgMbox-PT-d2m64, 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 r377-smll-171683809800135"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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