About the Execution of GreatSPN+red for Peterson-COL-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13651.039 | 1300357.00 | 4193474.00 | 1582.20 | TFTFFTFFT?T?TTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r267-smll-171654405900217.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 Peterson-COL-4, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405900217
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 9.1K Apr 12 02:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 02:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 02:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 02:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 03:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 44K 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 Peterson-COL-4-CTLCardinality-2024-00
FORMULA_NAME Peterson-COL-4-CTLCardinality-2024-01
FORMULA_NAME Peterson-COL-4-CTLCardinality-2024-02
FORMULA_NAME Peterson-COL-4-CTLCardinality-2024-03
FORMULA_NAME Peterson-COL-4-CTLCardinality-2024-04
FORMULA_NAME Peterson-COL-4-CTLCardinality-2024-05
FORMULA_NAME Peterson-COL-4-CTLCardinality-2024-06
FORMULA_NAME Peterson-COL-4-CTLCardinality-2024-07
FORMULA_NAME Peterson-COL-4-CTLCardinality-2024-08
FORMULA_NAME Peterson-COL-4-CTLCardinality-2024-09
FORMULA_NAME Peterson-COL-4-CTLCardinality-2024-10
FORMULA_NAME Peterson-COL-4-CTLCardinality-2024-11
FORMULA_NAME Peterson-COL-4-CTLCardinality-2024-12
FORMULA_NAME Peterson-COL-4-CTLCardinality-2024-13
FORMULA_NAME Peterson-COL-4-CTLCardinality-2024-14
FORMULA_NAME Peterson-COL-4-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716729903484
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 13:25:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 13:25:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 13:25:06] [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-05-26 13:25:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 13:25:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1224 ms
[2024-05-26 13:25:07] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 33 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 37 ms.
[2024-05-26 13:25:07] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 7 ms.
[2024-05-26 13:25:07] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40008 steps (8 resets) in 1605 ms. (24 steps per ms) remains 69/95 properties
BEST_FIRST walk for 4002 steps (8 resets) in 94 ms. (42 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 129 ms. (30 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 132 ms. (30 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 166 ms. (23 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 139 ms. (28 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 69/69 properties
// Phase 1: matrix 14 rows 9 cols
[2024-05-26 13:25:09] [INFO ] Computed 1 invariants in 11 ms
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 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 AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp94 is UNSAT
After SMT solving in domain Real declared 9/23 variables, and 1 constraints, problems are : Problem set: 69 solved, 0 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/9 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
After SMT, in 438ms problems are : Problem set: 69 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 69 atomic propositions for a total of 16 simplifications.
FORMULA Peterson-COL-4-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 13:25:09] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-05-26 13:25:09] [INFO ] Flatten gal took : 24 ms
[2024-05-26 13:25:09] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Peterson-COL-4-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 13:25:09] [INFO ] Flatten gal took : 4 ms
Domain [Process(5), Tour(4), Process(5)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 4)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-26 13:25:09] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 60 ms.
[2024-05-26 13:25:09] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 40 transitions.
Support contains 450 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 21 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-05-26 13:25:09] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-05-26 13:25:09] [INFO ] Computed 19 invariants in 23 ms
[2024-05-26 13:25:10] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-26 13:25:10] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-05-26 13:25:10] [INFO ] Invariant cache hit.
[2024-05-26 13:25:10] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-26 13:25:11] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1080 ms to find 0 implicit places.
Running 685 sub problems to find dead transitions.
[2024-05-26 13:25:11] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-05-26 13:25:11] [INFO ] Invariant cache hit.
[2024-05-26 13:25:11] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 13:25:22] [INFO ] Deduced a trap composed of 27 places in 593 ms of which 110 ms to minimize.
[2024-05-26 13:25:23] [INFO ] Deduced a trap composed of 36 places in 443 ms of which 9 ms to minimize.
[2024-05-26 13:25:23] [INFO ] Deduced a trap composed of 91 places in 309 ms of which 6 ms to minimize.
[2024-05-26 13:25:23] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 14 ms to minimize.
[2024-05-26 13:25:23] [INFO ] Deduced a trap composed of 47 places in 252 ms of which 5 ms to minimize.
[2024-05-26 13:25:24] [INFO ] Deduced a trap composed of 121 places in 329 ms of which 5 ms to minimize.
[2024-05-26 13:25:24] [INFO ] Deduced a trap composed of 21 places in 274 ms of which 4 ms to minimize.
[2024-05-26 13:25:24] [INFO ] Deduced a trap composed of 13 places in 375 ms of which 7 ms to minimize.
[2024-05-26 13:25:25] [INFO ] Deduced a trap composed of 17 places in 321 ms of which 6 ms to minimize.
[2024-05-26 13:25:25] [INFO ] Deduced a trap composed of 69 places in 247 ms of which 5 ms to minimize.
[2024-05-26 13:25:25] [INFO ] Deduced a trap composed of 45 places in 245 ms of which 4 ms to minimize.
[2024-05-26 13:25:26] [INFO ] Deduced a trap composed of 70 places in 257 ms of which 4 ms to minimize.
[2024-05-26 13:25:26] [INFO ] Deduced a trap composed of 14 places in 251 ms of which 5 ms to minimize.
[2024-05-26 13:25:26] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 4 ms to minimize.
[2024-05-26 13:25:26] [INFO ] Deduced a trap composed of 58 places in 263 ms of which 5 ms to minimize.
[2024-05-26 13:25:27] [INFO ] Deduced a trap composed of 26 places in 221 ms of which 4 ms to minimize.
[2024-05-26 13:25:27] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 3 ms to minimize.
[2024-05-26 13:25:27] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 6 ms to minimize.
[2024-05-26 13:25:27] [INFO ] Deduced a trap composed of 50 places in 231 ms of which 7 ms to minimize.
[2024-05-26 13:25:28] [INFO ] Deduced a trap composed of 21 places in 279 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 13:25:29] [INFO ] Deduced a trap composed of 25 places in 338 ms of which 6 ms to minimize.
[2024-05-26 13:25:29] [INFO ] Deduced a trap composed of 62 places in 373 ms of which 8 ms to minimize.
[2024-05-26 13:25:29] [INFO ] Deduced a trap composed of 87 places in 400 ms of which 7 ms to minimize.
[2024-05-26 13:25:30] [INFO ] Deduced a trap composed of 88 places in 278 ms of which 5 ms to minimize.
[2024-05-26 13:25:30] [INFO ] Deduced a trap composed of 66 places in 355 ms of which 6 ms to minimize.
[2024-05-26 13:25:30] [INFO ] Deduced a trap composed of 70 places in 269 ms of which 4 ms to minimize.
[2024-05-26 13:25:31] [INFO ] Deduced a trap composed of 39 places in 348 ms of which 4 ms to minimize.
[2024-05-26 13:25:31] [INFO ] Deduced a trap composed of 47 places in 293 ms of which 6 ms to minimize.
[2024-05-26 13:25:31] [INFO ] Deduced a trap composed of 90 places in 271 ms of which 4 ms to minimize.
[2024-05-26 13:25:32] [INFO ] Deduced a trap composed of 40 places in 278 ms of which 5 ms to minimize.
[2024-05-26 13:25:32] [INFO ] Deduced a trap composed of 47 places in 264 ms of which 4 ms to minimize.
[2024-05-26 13:25:32] [INFO ] Deduced a trap composed of 87 places in 288 ms of which 2 ms to minimize.
[2024-05-26 13:25:32] [INFO ] Deduced a trap composed of 87 places in 190 ms of which 4 ms to minimize.
[2024-05-26 13:25:33] [INFO ] Deduced a trap composed of 44 places in 256 ms of which 6 ms to minimize.
[2024-05-26 13:25:33] [INFO ] Deduced a trap composed of 58 places in 285 ms of which 9 ms to minimize.
[2024-05-26 13:25:33] [INFO ] Deduced a trap composed of 43 places in 434 ms of which 6 ms to minimize.
[2024-05-26 13:25:34] [INFO ] Deduced a trap composed of 159 places in 250 ms of which 4 ms to minimize.
[2024-05-26 13:25:34] [INFO ] Deduced a trap composed of 14 places in 275 ms of which 5 ms to minimize.
[2024-05-26 13:25:34] [INFO ] Deduced a trap composed of 72 places in 173 ms of which 3 ms to minimize.
[2024-05-26 13:25:35] [INFO ] Deduced a trap composed of 25 places in 387 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/1110 variables, and 54 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 9/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 685/685 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 13:25:43] [INFO ] Deduced a trap composed of 80 places in 348 ms of which 6 ms to minimize.
[2024-05-26 13:25:43] [INFO ] Deduced a trap composed of 47 places in 236 ms of which 6 ms to minimize.
[2024-05-26 13:25:43] [INFO ] Deduced a trap composed of 43 places in 251 ms of which 5 ms to minimize.
[2024-05-26 13:25:43] [INFO ] Deduced a trap composed of 69 places in 174 ms of which 3 ms to minimize.
[2024-05-26 13:25:44] [INFO ] Deduced a trap composed of 69 places in 181 ms of which 4 ms to minimize.
[2024-05-26 13:25:44] [INFO ] Deduced a trap composed of 69 places in 126 ms of which 3 ms to minimize.
[2024-05-26 13:25:44] [INFO ] Deduced a trap composed of 164 places in 280 ms of which 6 ms to minimize.
[2024-05-26 13:25:44] [INFO ] Deduced a trap composed of 158 places in 277 ms of which 6 ms to minimize.
[2024-05-26 13:25:44] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 4 ms to minimize.
[2024-05-26 13:25:45] [INFO ] Deduced a trap composed of 65 places in 276 ms of which 6 ms to minimize.
[2024-05-26 13:25:45] [INFO ] Deduced a trap composed of 105 places in 218 ms of which 5 ms to minimize.
[2024-05-26 13:25:45] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 3 ms to minimize.
[2024-05-26 13:25:46] [INFO ] Deduced a trap composed of 18 places in 398 ms of which 6 ms to minimize.
[2024-05-26 13:25:46] [INFO ] Deduced a trap composed of 14 places in 330 ms of which 11 ms to minimize.
[2024-05-26 13:25:46] [INFO ] Deduced a trap composed of 36 places in 338 ms of which 5 ms to minimize.
[2024-05-26 13:25:47] [INFO ] Deduced a trap composed of 43 places in 389 ms of which 7 ms to minimize.
[2024-05-26 13:25:47] [INFO ] Deduced a trap composed of 67 places in 354 ms of which 7 ms to minimize.
[2024-05-26 13:25:48] [INFO ] Deduced a trap composed of 65 places in 366 ms of which 6 ms to minimize.
[2024-05-26 13:25:48] [INFO ] Deduced a trap composed of 37 places in 389 ms of which 7 ms to minimize.
[2024-05-26 13:25:48] [INFO ] Deduced a trap composed of 10 places in 336 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 13:25:50] [INFO ] Deduced a trap composed of 22 places in 321 ms of which 7 ms to minimize.
[2024-05-26 13:25:50] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 4 ms to minimize.
[2024-05-26 13:25:50] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 3 ms to minimize.
[2024-05-26 13:25:51] [INFO ] Deduced a trap composed of 47 places in 282 ms of which 5 ms to minimize.
[2024-05-26 13:25:51] [INFO ] Deduced a trap composed of 32 places in 327 ms of which 6 ms to minimize.
[2024-05-26 13:25:51] [INFO ] Deduced a trap composed of 30 places in 364 ms of which 6 ms to minimize.
[2024-05-26 13:25:52] [INFO ] Deduced a trap composed of 10 places in 363 ms of which 6 ms to minimize.
[2024-05-26 13:25:53] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 5 ms to minimize.
[2024-05-26 13:25:53] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 5 ms to minimize.
[2024-05-26 13:25:53] [INFO ] Deduced a trap composed of 35 places in 302 ms of which 5 ms to minimize.
[2024-05-26 13:25:54] [INFO ] Deduced a trap composed of 54 places in 203 ms of which 3 ms to minimize.
[2024-05-26 13:25:54] [INFO ] Deduced a trap composed of 54 places in 186 ms of which 3 ms to minimize.
[2024-05-26 13:25:55] [INFO ] Deduced a trap composed of 57 places in 372 ms of which 6 ms to minimize.
[2024-05-26 13:25:55] [INFO ] Deduced a trap composed of 54 places in 257 ms of which 4 ms to minimize.
[2024-05-26 13:25:55] [INFO ] Deduced a trap composed of 54 places in 357 ms of which 7 ms to minimize.
[2024-05-26 13:25:56] [INFO ] Deduced a trap composed of 32 places in 305 ms of which 5 ms to minimize.
[2024-05-26 13:25:56] [INFO ] Deduced a trap composed of 93 places in 271 ms of which 5 ms to minimize.
[2024-05-26 13:25:57] [INFO ] Deduced a trap composed of 82 places in 276 ms of which 6 ms to minimize.
[2024-05-26 13:25:57] [INFO ] Deduced a trap composed of 10 places in 306 ms of which 5 ms to minimize.
[2024-05-26 13:25:57] [INFO ] Deduced a trap composed of 42 places in 233 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 13:25:59] [INFO ] Deduced a trap composed of 62 places in 125 ms of which 3 ms to minimize.
[2024-05-26 13:25:59] [INFO ] Deduced a trap composed of 82 places in 210 ms of which 3 ms to minimize.
[2024-05-26 13:26:01] [INFO ] Deduced a trap composed of 96 places in 412 ms of which 6 ms to minimize.
[2024-05-26 13:26:02] [INFO ] Deduced a trap composed of 58 places in 205 ms of which 4 ms to minimize.
[2024-05-26 13:26:02] [INFO ] Deduced a trap composed of 36 places in 256 ms of which 4 ms to minimize.
[2024-05-26 13:26:02] [INFO ] Deduced a trap composed of 101 places in 162 ms of which 3 ms to minimize.
[2024-05-26 13:26:03] [INFO ] Deduced a trap composed of 80 places in 259 ms of which 5 ms to minimize.
[2024-05-26 13:26:03] [INFO ] Deduced a trap composed of 58 places in 319 ms of which 5 ms to minimize.
[2024-05-26 13:26:04] [INFO ] Deduced a trap composed of 76 places in 153 ms of which 3 ms to minimize.
[2024-05-26 13:26:05] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2024-05-26 13:26:05] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 3 ms to minimize.
[2024-05-26 13:26:05] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-05-26 13:26:05] [INFO ] Deduced a trap composed of 57 places in 252 ms of which 5 ms to minimize.
[2024-05-26 13:26:06] [INFO ] Deduced a trap composed of 80 places in 145 ms of which 3 ms to minimize.
[2024-05-26 13:26:06] [INFO ] Deduced a trap composed of 80 places in 151 ms of which 3 ms to minimize.
[2024-05-26 13:26:06] [INFO ] Deduced a trap composed of 81 places in 148 ms of which 3 ms to minimize.
[2024-05-26 13:26:06] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 3 ms to minimize.
[2024-05-26 13:26:06] [INFO ] Deduced a trap composed of 84 places in 159 ms of which 4 ms to minimize.
[2024-05-26 13:26:07] [INFO ] Deduced a trap composed of 61 places in 221 ms of which 4 ms to minimize.
[2024-05-26 13:26:07] [INFO ] Deduced a trap composed of 70 places in 309 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 13:26:09] [INFO ] Deduced a trap composed of 81 places in 264 ms of which 4 ms to minimize.
[2024-05-26 13:26:10] [INFO ] Deduced a trap composed of 63 places in 378 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/1110 variables, and 116 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 9/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/685 constraints, Known Traps: 102/102 constraints]
After SMT, in 60447ms problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 60468ms
Finished structural reductions in LTL mode , in 1 iterations and 61596 ms. Remains : 480/480 places, 690/690 transitions.
Support contains 450 out of 480 places after structural reductions.
[2024-05-26 13:26:11] [INFO ] Flatten gal took : 138 ms
[2024-05-26 13:26:11] [INFO ] Flatten gal took : 118 ms
[2024-05-26 13:26:12] [INFO ] Input system was already deterministic with 690 transitions.
RANDOM walk for 40000 steps (8 resets) in 1931 ms. (20 steps per ms) remains 30/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 29/29 properties
[2024-05-26 13:26:13] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-05-26 13:26:13] [INFO ] Invariant cache hit.
[2024-05-26 13:26:13] [INFO ] State equation strengthened by 116 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 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 AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 5/455 variables, 5/10 constraints. Problems are: Problem set: 27 solved, 2 unsolved
[2024-05-26 13:26:14] [INFO ] Deduced a trap composed of 112 places in 178 ms of which 4 ms to minimize.
[2024-05-26 13:26:14] [INFO ] Deduced a trap composed of 80 places in 177 ms of which 3 ms to minimize.
[2024-05-26 13:26:14] [INFO ] Deduced a trap composed of 64 places in 188 ms of which 5 ms to minimize.
[2024-05-26 13:26:14] [INFO ] Deduced a trap composed of 145 places in 113 ms of which 2 ms to minimize.
[2024-05-26 13:26:14] [INFO ] Deduced a trap composed of 129 places in 133 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 5/15 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/15 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/460 variables, 5/20 constraints. Problems are: Problem set: 27 solved, 2 unsolved
[2024-05-26 13:26:15] [INFO ] Deduced a trap composed of 112 places in 158 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 1/21 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/21 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 630/1090 variables, 460/481 constraints. Problems are: Problem set: 27 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1090 variables, 116/597 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/597 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 20/1110 variables, 20/617 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1110 variables, 4/621 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1110 variables, 0/621 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1110 variables, 0/621 constraints. Problems are: Problem set: 27 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 621 constraints, problems are : Problem set: 27 solved, 2 unsolved in 2428 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 27 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 330/455 variables, 10/10 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 6/16 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/16 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 5/460 variables, 5/21 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/21 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 630/1090 variables, 460/481 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1090 variables, 116/597 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1090 variables, 1/598 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1090 variables, 0/598 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 20/1110 variables, 20/618 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1110 variables, 4/622 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1110 variables, 1/623 constraints. Problems are: Problem set: 27 solved, 2 unsolved
[2024-05-26 13:26:18] [INFO ] Deduced a trap composed of 64 places in 415 ms of which 8 ms to minimize.
[2024-05-26 13:26:18] [INFO ] Deduced a trap composed of 32 places in 316 ms of which 5 ms to minimize.
[2024-05-26 13:26:19] [INFO ] Deduced a trap composed of 47 places in 311 ms of which 6 ms to minimize.
[2024-05-26 13:26:19] [INFO ] Deduced a trap composed of 45 places in 318 ms of which 5 ms to minimize.
[2024-05-26 13:26:20] [INFO ] Deduced a trap composed of 61 places in 333 ms of which 4 ms to minimize.
[2024-05-26 13:26:20] [INFO ] Deduced a trap composed of 22 places in 345 ms of which 7 ms to minimize.
[2024-05-26 13:26:20] [INFO ] Deduced a trap composed of 70 places in 324 ms of which 5 ms to minimize.
[2024-05-26 13:26:21] [INFO ] Deduced a trap composed of 135 places in 374 ms of which 7 ms to minimize.
SMT process timed out in 8114ms, After SMT, problems are : Problem set: 27 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 125 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 480 transition count 610
Reduce places removed 80 places and 0 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 1 with 160 rules applied. Total rules applied 240 place count 400 transition count 530
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 320 place count 320 transition count 530
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 320 place count 320 transition count 510
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 360 place count 300 transition count 510
Applied a total of 360 rules in 138 ms. Remains 300 /480 variables (removed 180) and now considering 510/690 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 300/480 places, 510/690 transitions.
RANDOM walk for 40000 steps (8 resets) in 974 ms. (41 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 1/1 properties
[2024-05-26 13:26:22] [INFO ] Flow matrix only has 450 transitions (discarded 60 similar events)
// Phase 1: matrix 450 rows 300 cols
[2024-05-26 13:26:22] [INFO ] Computed 19 invariants in 8 ms
[2024-05-26 13:26:22] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 150/275 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/280 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 450/730 variables, 280/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/730 variables, 116/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/730 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 20/750 variables, 20/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/750 variables, 4/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/750 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 750/750 variables, and 435 constraints, problems are : Problem set: 0 solved, 1 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 300/300 constraints, ReadFeed: 116/116 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/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 150/275 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/280 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 450/730 variables, 280/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/730 variables, 116/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/730 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 20/750 variables, 20/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/750 variables, 4/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 13:26:23] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 5 ms to minimize.
[2024-05-26 13:26:23] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 4 ms to minimize.
[2024-05-26 13:26:24] [INFO ] Deduced a trap composed of 28 places in 250 ms of which 4 ms to minimize.
[2024-05-26 13:26:24] [INFO ] Deduced a trap composed of 54 places in 242 ms of which 4 ms to minimize.
[2024-05-26 13:26:24] [INFO ] Deduced a trap composed of 8 places in 235 ms of which 4 ms to minimize.
[2024-05-26 13:26:25] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 4 ms to minimize.
[2024-05-26 13:26:25] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 4 ms to minimize.
[2024-05-26 13:26:26] [INFO ] Deduced a trap composed of 95 places in 222 ms of which 5 ms to minimize.
[2024-05-26 13:26:26] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 4 ms to minimize.
[2024-05-26 13:26:26] [INFO ] Deduced a trap composed of 51 places in 226 ms of which 4 ms to minimize.
[2024-05-26 13:26:27] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 4 ms to minimize.
[2024-05-26 13:26:27] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 4 ms to minimize.
[2024-05-26 13:26:27] [INFO ] Deduced a trap composed of 59 places in 213 ms of which 4 ms to minimize.
[2024-05-26 13:26:28] [INFO ] Deduced a trap composed of 20 places in 223 ms of which 4 ms to minimize.
[2024-05-26 13:26:28] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 4 ms to minimize.
[2024-05-26 13:26:28] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 4 ms to minimize.
[2024-05-26 13:26:29] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 4 ms to minimize.
[2024-05-26 13:26:29] [INFO ] Deduced a trap composed of 40 places in 226 ms of which 4 ms to minimize.
[2024-05-26 13:26:30] [INFO ] Deduced a trap composed of 43 places in 243 ms of which 4 ms to minimize.
[2024-05-26 13:26:30] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/750 variables, 20/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 13:26:31] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 2 ms to minimize.
[2024-05-26 13:26:31] [INFO ] Deduced a trap composed of 27 places in 239 ms of which 4 ms to minimize.
[2024-05-26 13:26:31] [INFO ] Deduced a trap composed of 94 places in 177 ms of which 4 ms to minimize.
[2024-05-26 13:26:32] [INFO ] Deduced a trap composed of 86 places in 175 ms of which 4 ms to minimize.
[2024-05-26 13:26:32] [INFO ] Deduced a trap composed of 57 places in 231 ms of which 4 ms to minimize.
[2024-05-26 13:26:32] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 4 ms to minimize.
[2024-05-26 13:26:33] [INFO ] Deduced a trap composed of 85 places in 176 ms of which 4 ms to minimize.
[2024-05-26 13:26:33] [INFO ] Deduced a trap composed of 77 places in 234 ms of which 4 ms to minimize.
[2024-05-26 13:26:33] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 4 ms to minimize.
[2024-05-26 13:26:34] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 4 ms to minimize.
[2024-05-26 13:26:34] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 4 ms to minimize.
[2024-05-26 13:26:35] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 4 ms to minimize.
[2024-05-26 13:26:35] [INFO ] Deduced a trap composed of 50 places in 191 ms of which 3 ms to minimize.
[2024-05-26 13:26:36] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 3 ms to minimize.
[2024-05-26 13:26:36] [INFO ] Deduced a trap composed of 59 places in 238 ms of which 5 ms to minimize.
[2024-05-26 13:26:36] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 3 ms to minimize.
Problem AtomicPropp27 is UNSAT
After SMT solving in domain Int declared 750/750 variables, and 472 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14793 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 300/300 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 36/36 constraints]
After SMT, in 15183ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 28 atomic propositions for a total of 7 simplifications.
[2024-05-26 13:26:37] [INFO ] Flatten gal took : 69 ms
[2024-05-26 13:26:37] [INFO ] Flatten gal took : 69 ms
[2024-05-26 13:26:37] [INFO ] Input system was already deterministic with 690 transitions.
Support contains 365 out of 480 places (down from 445) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 50 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 480/480 places, 690/690 transitions.
[2024-05-26 13:26:37] [INFO ] Flatten gal took : 42 ms
[2024-05-26 13:26:37] [INFO ] Flatten gal took : 43 ms
[2024-05-26 13:26:37] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 480/480 places, 690/690 transitions.
[2024-05-26 13:26:37] [INFO ] Flatten gal took : 28 ms
[2024-05-26 13:26:37] [INFO ] Flatten gal took : 34 ms
[2024-05-26 13:26:37] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 13 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 480/480 places, 690/690 transitions.
[2024-05-26 13:26:37] [INFO ] Flatten gal took : 29 ms
[2024-05-26 13:26:37] [INFO ] Flatten gal took : 35 ms
[2024-05-26 13:26:38] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 480 transition count 494
Reduce places removed 196 places and 0 transitions.
Iterating post reduction 1 with 196 rules applied. Total rules applied 392 place count 284 transition count 494
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 392 place count 284 transition count 410
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 560 place count 200 transition count 410
Applied a total of 560 rules in 41 ms. Remains 200 /480 variables (removed 280) and now considering 410/690 (removed 280) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 200/480 places, 410/690 transitions.
[2024-05-26 13:26:38] [INFO ] Flatten gal took : 19 ms
[2024-05-26 13:26:38] [INFO ] Flatten gal took : 22 ms
[2024-05-26 13:26:38] [INFO ] Input system was already deterministic with 410 transitions.
RANDOM walk for 40000 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 426 steps (0 resets) in 13 ms. (30 steps per ms) remains 0/1 properties
FORMULA Peterson-COL-4-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 480/480 places, 690/690 transitions.
[2024-05-26 13:26:38] [INFO ] Flatten gal took : 27 ms
[2024-05-26 13:26:38] [INFO ] Flatten gal took : 32 ms
[2024-05-26 13:26:38] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 480 transition count 686
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 476 transition count 686
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 8 place count 476 transition count 666
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 48 place count 456 transition count 666
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 80 place count 440 transition count 650
Applied a total of 80 rules in 53 ms. Remains 440 /480 variables (removed 40) and now considering 650/690 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 440/480 places, 650/690 transitions.
[2024-05-26 13:26:38] [INFO ] Flatten gal took : 26 ms
[2024-05-26 13:26:38] [INFO ] Flatten gal took : 27 ms
[2024-05-26 13:26:38] [INFO ] Input system was already deterministic with 650 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 480/480 places, 690/690 transitions.
[2024-05-26 13:26:38] [INFO ] Flatten gal took : 26 ms
[2024-05-26 13:26:38] [INFO ] Flatten gal took : 30 ms
[2024-05-26 13:26:38] [INFO ] Input system was already deterministic with 690 transitions.
[2024-05-26 13:26:38] [INFO ] Flatten gal took : 28 ms
[2024-05-26 13:26:38] [INFO ] Flatten gal took : 27 ms
[2024-05-26 13:26:38] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-05-26 13:26:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 480 places, 690 transitions and 2120 arcs took 8 ms.
Total runtime 92961 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Peterson-COL-4
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 480
TRANSITIONS: 690
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.018s, Sys 0.000s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]
----------------------------------------------------------------------
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: 1037
MODEL NAME: /home/mcc/execution/411/model
480 places, 690 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.
Building monolithic NSF...
FORMULA Peterson-COL-4-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-COL-4-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-COL-4-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-COL-4-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-COL-4-CTLCardinality-2024-09 CANNOT_COMPUTE
FORMULA Peterson-COL-4-CTLCardinality-2024-11 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716731203841
--------------------
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
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="Peterson-COL-4"
export BK_EXAMINATION="CTLCardinality"
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 Peterson-COL-4, 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 r267-smll-171654405900217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-4.tgz
mv Peterson-COL-4 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 ;