About the Execution of LTSMin+red for PolyORBLF-COL-S04J06T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16204.936 | 393732.00 | 538910.00 | 185.90 | F?F??F?TFTTF?T?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446500161.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-COL-S04J06T10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446500161
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 17:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 11 17:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 11 17:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 11 17:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S04J06T10-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717250742893
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:05:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:05:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:05:44] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 14:05:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 14:05:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 670 ms
[2024-06-01 14:05:45] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 966 PT places and 5456.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
[2024-06-01 14:05:45] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-06-01 14:05:45] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (19 resets) in 2251 ms. (17 steps per ms) remains 60/77 properties
BEST_FIRST walk for 4002 steps (8 resets) in 85 ms. (46 steps per ms) remains 59/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 86 ms. (46 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 57 ms. (68 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
[2024-06-01 14:05:46] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 14:05:46] [INFO ] Computed 26 invariants in 7 ms
[2024-06-01 14:05:46] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp44 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 55 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp39 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 4/6 constraints. Problems are: Problem set: 6 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 53 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 3 (OVERLAPS) 21/74 variables, 9/15 constraints. Problems are: Problem set: 32 solved, 27 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 5/20 constraints. Problems are: Problem set: 53 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/20 constraints. Problems are: Problem set: 53 solved, 6 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 6 (OVERLAPS) 7/81 variables, 6/26 constraints. Problems are: Problem set: 57 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 57 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 57 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 57 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 57 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 57 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 57 solved, 2 unsolved in 584 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 57 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 57 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/32 variables, 4/4 constraints. Problems are: Problem set: 57 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 57 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/38 variables, 3/7 constraints. Problems are: Problem set: 57 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 57 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/48 variables, 2/9 constraints. Problems are: Problem set: 57 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 57 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/52 variables, 1/10 constraints. Problems are: Problem set: 57 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 57 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 27/79 variables, 15/25 constraints. Problems are: Problem set: 57 solved, 2 unsolved
[2024-06-01 14:05:47] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 11 ms to minimize.
Problem AtomicPropp36 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 1/26 constraints. Problems are: Problem set: 58 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 58 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 58 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 58 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/143 variables, 1/114 constraints. Problems are: Problem set: 58 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 0/114 constraints. Problems are: Problem set: 58 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/145 variables, 2/116 constraints. Problems are: Problem set: 58 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/145 variables, 1/117 constraints. Problems are: Problem set: 58 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/145 variables, 0/117 constraints. Problems are: Problem set: 58 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/145 variables, 0/117 constraints. Problems are: Problem set: 58 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 117 constraints, problems are : Problem set: 58 solved, 1 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/59 constraints, Known Traps: 1/1 constraints]
After SMT, in 852ms problems are : Problem set: 58 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
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 80 transition count 59
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 74 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 73 transition count 58
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 15 place count 73 transition count 54
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 23 place count 69 transition count 54
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 3 with 12 rules applied. Total rules applied 35 place count 63 transition count 48
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 63 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 39 place count 61 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 61 transition count 46
Applied a total of 40 rules in 36 ms. Remains 61 /81 variables (removed 20) and now considering 46/65 (removed 19) transitions.
Running 45 sub problems to find dead transitions.
[2024-06-01 14:05:47] [INFO ] Flow matrix only has 45 transitions (discarded 1 similar events)
// Phase 1: matrix 45 rows 61 cols
[2024-06-01 14:05:47] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 14:05:47] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 14:05:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
[2024-06-01 14:05:47] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-06-01 14:05:47] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 14:05:47] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 14:05:48] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 1/61 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 14:05:48] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:05:48] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 45/106 variables, 61/93 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 14:05:48] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 2 ms to minimize.
[2024-06-01 14:05:48] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:05:48] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 14:05:49] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (OVERLAPS) 0/106 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 105 constraints, problems are : Problem set: 0 solved, 45 unsolved in 2031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 61/61 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 14:05:49] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:05:49] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 14:05:50] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 14:05:50] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 1/61 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 14:05:50] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 14:05:50] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 45/106 variables, 61/103 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 8/111 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 45/156 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 13 (OVERLAPS) 0/106 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 156 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1822 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 61/61 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 17/17 constraints]
After SMT, in 3879ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 3881ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3930 ms. Remains : 61/81 places, 46/65 transitions.
RANDOM walk for 40004 steps (18 resets) in 410 ms. (97 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (12 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
Probably explored full state space saw : 332412 states, properties seen :0
Probabilistic random walk after 995552 steps, saw 332412 distinct states, run finished after 1792 ms. (steps per millisecond=555 ) properties seen :0
Explored full state space saw : 332430 states, properties seen :0
Exhaustive walk after 995607 steps, saw 332430 distinct states, run finished after 1558 ms. (steps per millisecond=639 ) properties seen :0
Successfully simplified 59 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:05:55] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 14:05:55] [INFO ] Flatten gal took : 29 ms
[2024-06-01 14:05:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:05:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:05:55] [INFO ] Flatten gal took : 12 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 14:05:55] [INFO ] Unfolded HLPN to a Petri net with 966 places and 5354 transitions 36134 arcs in 102 ms.
[2024-06-01 14:05:55] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Support contains 473 out of 966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 966/966 places, 2644/2644 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 962 transition count 2644
Applied a total of 4 rules in 64 ms. Remains 962 /966 variables (removed 4) and now considering 2644/2644 (removed 0) transitions.
Running 2640 sub problems to find dead transitions.
[2024-06-01 14:05:55] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
// Phase 1: matrix 2604 rows 962 cols
[2024-06-01 14:05:55] [INFO ] Computed 58 invariants in 181 ms
[2024-06-01 14:05:55] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 0.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 0.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 10.0)
(s243 1.0)
(s244 0.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 0.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 0.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 0.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 0.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 0.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 0.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 0.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 0.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 0.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2640 unsolved
SMT process timed out in 34648ms, After SMT, problems are : Problem set: 0 solved, 2640 unsolved
Search for dead transitions found 0 dead transitions in 34682ms
[2024-06-01 14:06:30] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
[2024-06-01 14:06:30] [INFO ] Invariant cache hit.
[2024-06-01 14:06:30] [INFO ] Implicit Places using invariants in 716 ms returned []
[2024-06-01 14:06:30] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
[2024-06-01 14:06:30] [INFO ] Invariant cache hit.
[2024-06-01 14:06:32] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:06:48] [INFO ] Implicit Places using invariants and state equation in 17310 ms returned []
Implicit Place search using SMT with State Equation took 18031 ms to find 0 implicit places.
Running 2640 sub problems to find dead transitions.
[2024-06-01 14:06:48] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
[2024-06-01 14:06:48] [INFO ] Invariant cache hit.
[2024-06-01 14:06:48] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/958 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 2640 unsolved
[2024-06-01 14:07:30] [INFO ] Deduced a trap composed of 83 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:07:31] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 1 ms to minimize.
[2024-06-01 14:07:31] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:07:31] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 2 ms to minimize.
[2024-06-01 14:07:31] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 2 ms to minimize.
[2024-06-01 14:07:31] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-06-01 14:07:31] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 2 ms to minimize.
[2024-06-01 14:07:32] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 1 ms to minimize.
[2024-06-01 14:07:32] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 958/3566 variables, and 63 constraints, problems are : Problem set: 0 solved, 2640 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 41/43 constraints, State Equation: 0/962 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2640/2640 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2640 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/958 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 2640 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/958 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 2640 unsolved
[2024-06-01 14:07:36] [INFO ] Deduced a trap composed of 201 places in 575 ms of which 7 ms to minimize.
[2024-06-01 14:07:37] [INFO ] Deduced a trap composed of 459 places in 576 ms of which 7 ms to minimize.
[2024-06-01 14:07:38] [INFO ] Deduced a trap composed of 263 places in 602 ms of which 7 ms to minimize.
[2024-06-01 14:07:38] [INFO ] Deduced a trap composed of 252 places in 609 ms of which 7 ms to minimize.
[2024-06-01 14:07:39] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 1 ms to minimize.
[2024-06-01 14:07:41] [INFO ] Deduced a trap composed of 486 places in 591 ms of which 7 ms to minimize.
[2024-06-01 14:07:44] [INFO ] Deduced a trap composed of 560 places in 700 ms of which 7 ms to minimize.
[2024-06-01 14:07:45] [INFO ] Deduced a trap composed of 570 places in 719 ms of which 7 ms to minimize.
[2024-06-01 14:07:46] [INFO ] Deduced a trap composed of 566 places in 656 ms of which 5 ms to minimize.
[2024-06-01 14:07:47] [INFO ] Deduced a trap composed of 543 places in 678 ms of which 8 ms to minimize.
[2024-06-01 14:07:47] [INFO ] Deduced a trap composed of 550 places in 625 ms of which 7 ms to minimize.
[2024-06-01 14:07:48] [INFO ] Deduced a trap composed of 567 places in 631 ms of which 5 ms to minimize.
[2024-06-01 14:07:49] [INFO ] Deduced a trap composed of 568 places in 673 ms of which 9 ms to minimize.
[2024-06-01 14:07:49] [INFO ] Deduced a trap composed of 535 places in 640 ms of which 7 ms to minimize.
[2024-06-01 14:07:50] [INFO ] Deduced a trap composed of 658 places in 721 ms of which 8 ms to minimize.
[2024-06-01 14:07:51] [INFO ] Deduced a trap composed of 552 places in 665 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 958/3566 variables, and 79 constraints, problems are : Problem set: 0 solved, 2640 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 41/43 constraints, State Equation: 0/962 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2640 constraints, Known Traps: 25/25 constraints]
After SMT, in 74462ms problems are : Problem set: 0 solved, 2640 unsolved
Search for dead transitions found 0 dead transitions in 74490ms
Starting structural reductions in LTL mode, iteration 1 : 962/966 places, 2644/2644 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127289 ms. Remains : 962/966 places, 2644/2644 transitions.
Support contains 473 out of 962 places after structural reductions.
[2024-06-01 14:08:02] [INFO ] Flatten gal took : 182 ms
[2024-06-01 14:08:03] [INFO ] Flatten gal took : 143 ms
[2024-06-01 14:08:03] [INFO ] Input system was already deterministic with 2644 transitions.
RANDOM walk for 40000 steps (8 resets) in 1611 ms. (24 steps per ms) remains 23/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 76 ms. (51 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 196 ms. (20 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 66 ms. (59 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 65 ms. (60 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (8 resets) in 58 ms. (67 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 23/23 properties
[2024-06-01 14:08:04] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
[2024-06-01 14:08:04] [INFO ] Invariant cache hit.
[2024-06-01 14:08:04] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 1 (OVERLAPS) 128/530 variables, 15/15 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 0/15 constraints. Problems are: Problem set: 5 solved, 18 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 3 (OVERLAPS) 432/962 variables, 43/58 constraints. Problems are: Problem set: 22 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/962 variables, 0/58 constraints. Problems are: Problem set: 22 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3566/3566 variables, and 1020 constraints, problems are : Problem set: 22 solved, 1 unsolved in 2029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 962/962 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 22 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 22 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 22 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 909/922 variables, 24/25 constraints. Problems are: Problem set: 22 solved, 1 unsolved
[2024-06-01 14:08:07] [INFO ] Deduced a trap composed of 85 places in 360 ms of which 5 ms to minimize.
[2024-06-01 14:08:07] [INFO ] Deduced a trap composed of 84 places in 334 ms of which 4 ms to minimize.
[2024-06-01 14:08:07] [INFO ] Deduced a trap composed of 84 places in 325 ms of which 5 ms to minimize.
[2024-06-01 14:08:08] [INFO ] Deduced a trap composed of 83 places in 277 ms of which 4 ms to minimize.
[2024-06-01 14:08:08] [INFO ] Deduced a trap composed of 83 places in 238 ms of which 4 ms to minimize.
[2024-06-01 14:08:08] [INFO ] Deduced a trap composed of 84 places in 180 ms of which 2 ms to minimize.
[2024-06-01 14:08:08] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 2 ms to minimize.
[2024-06-01 14:08:08] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:08:08] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/922 variables, 9/34 constraints. Problems are: Problem set: 22 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/922 variables, 0/34 constraints. Problems are: Problem set: 22 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 13/935 variables, 13/47 constraints. Problems are: Problem set: 22 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/935 variables, 0/47 constraints. Problems are: Problem set: 22 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/960 variables, 19/66 constraints. Problems are: Problem set: 22 solved, 1 unsolved
[2024-06-01 14:08:09] [INFO ] Deduced a trap composed of 240 places in 666 ms of which 6 ms to minimize.
[2024-06-01 14:08:09] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/960 variables, 2/68 constraints. Problems are: Problem set: 22 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/960 variables, 0/68 constraints. Problems are: Problem set: 22 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3564/3566 variables, and 1028 constraints, problems are : Problem set: 22 solved, 1 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 960/962 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/23 constraints, Known Traps: 11/11 constraints]
After SMT, in 7175ms problems are : Problem set: 22 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 962/962 places, 2644/2644 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 962 transition count 2554
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 872 transition count 2554
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 120 Pre rules applied. Total rules applied 180 place count 872 transition count 2434
Deduced a syphon composed of 120 places in 3 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 420 place count 752 transition count 2434
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 600 place count 662 transition count 2344
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 620 place count 662 transition count 2324
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 640 place count 642 transition count 2324
Applied a total of 640 rules in 409 ms. Remains 642 /962 variables (removed 320) and now considering 2324/2644 (removed 320) transitions.
Running 2320 sub problems to find dead transitions.
[2024-06-01 14:08:12] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 642 cols
[2024-06-01 14:08:12] [INFO ] Computed 58 invariants in 109 ms
[2024-06-01 14:08:12] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/638 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/638 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
[2024-06-01 14:08:49] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 2 ms to minimize.
[2024-06-01 14:08:50] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 2 ms to minimize.
[2024-06-01 14:08:50] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 9 ms to minimize.
[2024-06-01 14:08:50] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:08:50] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 0 ms to minimize.
[2024-06-01 14:08:50] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:08:50] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:08:50] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 2 ms to minimize.
[2024-06-01 14:08:50] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:08:51] [INFO ] Deduced a trap composed of 271 places in 629 ms of which 5 ms to minimize.
[2024-06-01 14:08:52] [INFO ] Deduced a trap composed of 281 places in 572 ms of which 5 ms to minimize.
SMT process timed out in 40959ms, After SMT, problems are : Problem set: 0 solved, 2320 unsolved
Search for dead transitions found 0 dead transitions in 40996ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41414 ms. Remains : 642/962 places, 2324/2644 transitions.
RANDOM walk for 40000 steps (9 resets) in 598 ms. (66 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 178078 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 1
Probabilistic random walk after 178078 steps, saw 128371 distinct states, run finished after 3006 ms. (steps per millisecond=59 ) properties seen :0
[2024-06-01 14:08:56] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 14:08:56] [INFO ] Invariant cache hit.
[2024-06-01 14:08:56] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 586/599 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/599 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/612 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/640 variables, 22/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/640 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2284/2924 variables, 640/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2924 variables, 200/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2924 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/2926 variables, 2/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2926 variables, 1/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2926 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2926 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2926/2926 variables, and 900 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2253 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 642/642 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 586/599 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:08:58] [INFO ] Deduced a trap composed of 52 places in 276 ms of which 3 ms to minimize.
[2024-06-01 14:08:59] [INFO ] Deduced a trap composed of 52 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:08:59] [INFO ] Deduced a trap composed of 52 places in 169 ms of which 3 ms to minimize.
[2024-06-01 14:08:59] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 2 ms to minimize.
[2024-06-01 14:08:59] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 2 ms to minimize.
[2024-06-01 14:08:59] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:08:59] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:08:59] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/599 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/599 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 13/612 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:08:59] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:09:00] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/612 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/612 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/640 variables, 22/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/640 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2284/2924 variables, 640/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2924 variables, 200/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2924 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2924 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/2926 variables, 2/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2926 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2926 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2926 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2926/2926 variables, and 911 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6318 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 642/642 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 8595ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 332 ms.
Support contains 12 out of 642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 642/642 places, 2324/2324 transitions.
Applied a total of 0 rules in 89 ms. Remains 642 /642 variables (removed 0) and now considering 2324/2324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 642/642 places, 2324/2324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 642/642 places, 2324/2324 transitions.
Applied a total of 0 rules in 77 ms. Remains 642 /642 variables (removed 0) and now considering 2324/2324 (removed 0) transitions.
[2024-06-01 14:09:05] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 14:09:05] [INFO ] Invariant cache hit.
[2024-06-01 14:09:06] [INFO ] Implicit Places using invariants in 854 ms returned []
[2024-06-01 14:09:06] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 14:09:06] [INFO ] Invariant cache hit.
[2024-06-01 14:09:07] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 14:09:30] [INFO ] Implicit Places using invariants and state equation in 24048 ms returned []
Implicit Place search using SMT with State Equation took 24905 ms to find 0 implicit places.
[2024-06-01 14:09:30] [INFO ] Redundant transitions in 104 ms returned []
Running 2320 sub problems to find dead transitions.
[2024-06-01 14:09:30] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 14:09:30] [INFO ] Invariant cache hit.
[2024-06-01 14:09:30] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/638 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/638 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
[2024-06-01 14:10:10] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:10:10] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 2 ms to minimize.
[2024-06-01 14:10:10] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 2 ms to minimize.
[2024-06-01 14:10:10] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 1 ms to minimize.
[2024-06-01 14:10:11] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:10:11] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:10:11] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:10:11] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:10:11] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:10:12] [INFO ] Deduced a trap composed of 273 places in 565 ms of which 5 ms to minimize.
[2024-06-01 14:10:12] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:10:15] [INFO ] Deduced a trap composed of 69 places in 266 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 638/2926 variables, and 66 constraints, problems are : Problem set: 0 solved, 2320 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 42/43 constraints, State Equation: 0/642 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2320/2320 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/638 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/638 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/638 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
[2024-06-01 14:10:25] [INFO ] Deduced a trap composed of 23 places in 636 ms of which 5 ms to minimize.
[2024-06-01 14:10:26] [INFO ] Deduced a trap composed of 288 places in 619 ms of which 5 ms to minimize.
[2024-06-01 14:10:34] [INFO ] Deduced a trap composed of 342 places in 466 ms of which 5 ms to minimize.
[2024-06-01 14:10:52] [INFO ] Deduced a trap composed of 269 places in 472 ms of which 4 ms to minimize.
SMT process timed out in 81983ms, After SMT, problems are : Problem set: 0 solved, 2320 unsolved
Search for dead transitions found 0 dead transitions in 82018ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107124 ms. Remains : 642/642 places, 2324/2324 transitions.
Successfully simplified 22 atomic propositions for a total of 6 simplifications.
[2024-06-01 14:10:52] [INFO ] Flatten gal took : 110 ms
[2024-06-01 14:10:52] [INFO ] Flatten gal took : 119 ms
[2024-06-01 14:10:52] [INFO ] Input system was already deterministic with 2644 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 962/962 places, 2644/2644 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 952 transition count 2634
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 952 transition count 2634
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 942 transition count 2624
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 942 transition count 2624
Applied a total of 40 rules in 75 ms. Remains 942 /962 variables (removed 20) and now considering 2624/2644 (removed 20) transitions.
Running 2620 sub problems to find dead transitions.
[2024-06-01 14:10:52] [INFO ] Flow matrix only has 2584 transitions (discarded 40 similar events)
// Phase 1: matrix 2584 rows 942 cols
[2024-06-01 14:10:53] [INFO ] Computed 58 invariants in 123 ms
[2024-06-01 14:10:53] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/938 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2620 unsolved
SMT process timed out in 34880ms, After SMT, problems are : Problem set: 0 solved, 2620 unsolved
Search for dead transitions found 0 dead transitions in 34904ms
Finished structural reductions in LTL mode , in 1 iterations and 34987 ms. Remains : 942/962 places, 2624/2644 transitions.
[2024-06-01 14:11:27] [INFO ] Flatten gal took : 107 ms
[2024-06-01 14:11:28] [INFO ] Flatten gal took : 118 ms
[2024-06-01 14:11:28] [INFO ] Input system was already deterministic with 2624 transitions.
Starting structural reductions in LTL mode, iteration 0 : 962/962 places, 2644/2644 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 952 transition count 2634
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 952 transition count 2634
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 942 transition count 2624
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 942 transition count 2624
Applied a total of 40 rules in 48 ms. Remains 942 /962 variables (removed 20) and now considering 2624/2644 (removed 20) transitions.
Running 2620 sub problems to find dead transitions.
[2024-06-01 14:11:28] [INFO ] Flow matrix only has 2584 transitions (discarded 40 similar events)
[2024-06-01 14:11:28] [INFO ] Invariant cache hit.
[2024-06-01 14:11:28] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 10.0)
(s243 1.0)
(s244 0.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/938 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2620 unsolved
SMT process timed out in 34712ms, After SMT, problems are : Problem set: 0 solved, 2620 unsolved
Search for dead transitions found 0 dead transitions in 34737ms
Finished structural reductions in LTL mode , in 1 iterations and 34790 ms. Remains : 942/962 places, 2624/2644 transitions.
[2024-06-01 14:12:03] [INFO ] Flatten gal took : 94 ms
[2024-06-01 14:12:03] [INFO ] Flatten gal took : 94 ms
[2024-06-01 14:12:03] [INFO ] Input system was already deterministic with 2624 transitions.
Starting structural reductions in LTL mode, iteration 0 : 962/962 places, 2644/2644 transitions.
Applied a total of 0 rules in 13 ms. Remains 962 /962 variables (removed 0) and now considering 2644/2644 (removed 0) transitions.
Running 2640 sub problems to find dead transitions.
[2024-06-01 14:12:03] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
// Phase 1: matrix 2604 rows 962 cols
[2024-06-01 14:12:03] [INFO ] Computed 58 invariants in 94 ms
[2024-06-01 14:12:03] [INFO ] State equation strengthened by 200 read => feed constraints.
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 : PolyORBLF-COL-S04J06T10-CTLCardinality-2024-00
Could not compute solution for formula : PolyORBLF-COL-S04J06T10-CTLCardinality-2024-01
Could not compute solution for formula : PolyORBLF-COL-S04J06T10-CTLCardinality-2024-02
Could not compute solution for formula : PolyORBLF-COL-S04J06T10-CTLCardinality-2024-03
Could not compute solution for formula : PolyORBLF-COL-S04J06T10-CTLCardinality-2024-04
Could not compute solution for formula : PolyORBLF-COL-S04J06T10-CTLCardinality-2024-05
Could not compute solution for formula : PolyORBLF-COL-S04J06T10-CTLCardinality-2024-06
Could not compute solution for formula : PolyORBLF-COL-S04J06T10-CTLCardinality-2024-07
Could not compute solution for formula : PolyORBLF-COL-S04J06T10-CTLCardinality-2024-08
Could not compute solution for formula : PolyORBLF-COL-S04J06T10-CTLCardinality-2024-09
Could not compute solution for formula : PolyORBLF-COL-S04J06T10-CTLCardinality-2024-10
Could not compute solution for formula : PolyORBLF-COL-S04J06T10-CTLCardinality-2024-11
Could not compute solution for formula : PolyORBLF-COL-S04J06T10-CTLCardinality-2024-12
Could not compute solution for formula : PolyORBLF-COL-S04J06T10-CTLCardinality-2024-13
Could not compute solution for formula : PolyORBLF-COL-S04J06T10-CTLCardinality-2024-14
Could not compute solution for formula : PolyORBLF-COL-S04J06T10-CTLCardinality-2024-15
BK_STOP 1717251136625
--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-COL-S04J06T10-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/934/ctl_0_
ctl formula name PolyORBLF-COL-S04J06T10-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/934/ctl_1_
ctl formula name PolyORBLF-COL-S04J06T10-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/934/ctl_2_
ctl formula name PolyORBLF-COL-S04J06T10-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/934/ctl_3_
ctl formula name PolyORBLF-COL-S04J06T10-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/934/ctl_4_
ctl formula name PolyORBLF-COL-S04J06T10-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/934/ctl_5_
ctl formula name PolyORBLF-COL-S04J06T10-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/934/ctl_6_
ctl formula name PolyORBLF-COL-S04J06T10-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/934/ctl_7_
ctl formula name PolyORBLF-COL-S04J06T10-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/934/ctl_8_
ctl formula name PolyORBLF-COL-S04J06T10-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/934/ctl_9_
ctl formula name PolyORBLF-COL-S04J06T10-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/934/ctl_10_
ctl formula name PolyORBLF-COL-S04J06T10-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/934/ctl_11_
ctl formula name PolyORBLF-COL-S04J06T10-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/934/ctl_12_
ctl formula name PolyORBLF-COL-S04J06T10-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/934/ctl_13_
ctl formula name PolyORBLF-COL-S04J06T10-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/934/ctl_14_
ctl formula name PolyORBLF-COL-S04J06T10-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/934/ctl_15_
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="PolyORBLF-COL-S04J06T10"
export BK_EXAMINATION="CTLCardinality"
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 PolyORBLF-COL-S04J06T10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446500161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S04J06T10.tgz
mv PolyORBLF-COL-S04J06T10 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;