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.r512-smll-171654407200258.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Peterson-PT-3, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407200258
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 27K Apr 12 02:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 12 02:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 12 02:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 12 02:16 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 17K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 108K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 511K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 71K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 344K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 143K 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-PT-3-CTLFireability-2024-00
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-01
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-02
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-03
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-04
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-05
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-06
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-07
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-08
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-09
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-10
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-11
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-12
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-13
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-14
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717269682373

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:21:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 19:21:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:21:24] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2024-06-01 19:21:24] [INFO ] Transformed 244 places.
[2024-06-01 19:21:24] [INFO ] Transformed 332 transitions.
[2024-06-01 19:21:24] [INFO ] Found NUPN structural information;
[2024-06-01 19:21:24] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 308 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Support contains 244 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 19 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-06-01 19:21:24] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-06-01 19:21:24] [INFO ] Computed 15 invariants in 24 ms
[2024-06-01 19:21:24] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-06-01 19:21:24] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 19:21:24] [INFO ] Invariant cache hit.
[2024-06-01 19:21:25] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 19:21:25] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-06-01 19:21:25] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 19:21:25] [INFO ] Invariant cache hit.
[2024-06-01 19:21:25] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 19:21:28] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 11 ms to minimize.
[2024-06-01 19:21:28] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 4 ms to minimize.
[2024-06-01 19:21:28] [INFO ] Deduced a trap composed of 97 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:21:29] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:21:30] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:21:30] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 19:21:34] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 19:21:36] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 4/244 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 19:21:42] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:21:42] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:21:42] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:21:42] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:21:42] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 2 ms to minimize.
[2024-06-01 19:21:42] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 3 ms to minimize.
[2024-06-01 19:21:42] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 3 ms to minimize.
[2024-06-01 19:21:43] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 3 ms to minimize.
[2024-06-01 19:21:43] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:21:43] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:21:43] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 3 ms to minimize.
[2024-06-01 19:21:43] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 3 ms to minimize.
[2024-06-01 19:21:43] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:21:43] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:21:43] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:21:43] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
[2024-06-01 19:21:43] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:21:44] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 3 ms to minimize.
[2024-06-01 19:21:44] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:21:44] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 19:21:44] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 3 ms to minimize.
[2024-06-01 19:21:45] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:21:45] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:21:45] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:21:45] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:21:45] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 3 ms to minimize.
[2024-06-01 19:21:45] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 5 ms to minimize.
[2024-06-01 19:21:45] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 2 ms to minimize.
[2024-06-01 19:21:45] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2024-06-01 19:21:45] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2024-06-01 19:21:46] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:21:46] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:21:46] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:21:46] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:21:46] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:21:46] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:21:46] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:21:46] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:21:47] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:21:47] [INFO ] Deduced a trap composed of 86 places in 74 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 20/307 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 19:21:47] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:21:48] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:21:48] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:21:48] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:21:48] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:21:49] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:21:49] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:21:49] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 15 ms to minimize.
[2024-06-01 19:21:49] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:21:50] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 2 ms to minimize.
[2024-06-01 19:21:50] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:21:50] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:21:51] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 13/320 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 19:21:55] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 244/552 variables, and 321 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30030 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 60/307 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (OVERLAPS) 4/244 variables, 6/313 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 4/317 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 19:22:00] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:22:01] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:22:02] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 19:22:04] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:22:04] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:22:04] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 19:22:09] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 13 (OVERLAPS) 308/552 variables, 244/572 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 57/629 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 328/957 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 957 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30020 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 69/69 constraints]
After SMT, in 60227ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60287ms
Finished structural reductions in LTL mode , in 1 iterations and 61289 ms. Remains : 244/244 places, 332/332 transitions.
Support contains 244 out of 244 places after structural reductions.
[2024-06-01 19:22:26] [INFO ] Flatten gal took : 88 ms
[2024-06-01 19:22:26] [INFO ] Flatten gal took : 76 ms
[2024-06-01 19:22:26] [INFO ] Input system was already deterministic with 332 transitions.
Reduction of identical properties reduced properties to check from 59 to 55
RANDOM walk for 40000 steps (8 resets) in 1995 ms. (20 steps per ms) remains 14/55 properties
BEST_FIRST walk for 40004 steps (8 resets) in 364 ms. (109 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 14/14 properties
[2024-06-01 19:22:28] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 19:22:28] [INFO ] Invariant cache hit.
[2024-06-01 19:22:28] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 207/242 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 207/253 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/243 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 1/244 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 308/552 variables, 244/503 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 57/560 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 19:22:28] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 3 ms to minimize.
[2024-06-01 19:22:29] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:22:29] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 3 ms to minimize.
[2024-06-01 19:22:29] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:22:29] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:22:29] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 3 ms to minimize.
[2024-06-01 19:22:29] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 3 ms to minimize.
[2024-06-01 19:22:29] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:22:30] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 3 ms to minimize.
[2024-06-01 19:22:30] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 2 ms to minimize.
[2024-06-01 19:22:30] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:22:30] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/552 variables, 12/572 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 19:22:30] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:22:30] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:22:30] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 3 ms to minimize.
[2024-06-01 19:22:31] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:22:31] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:22:31] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:22:31] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:22:31] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/552 variables, 8/580 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 19:22:31] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:22:31] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 3 ms to minimize.
[2024-06-01 19:22:31] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:22:31] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 3 ms to minimize.
[2024-06-01 19:22:32] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:22:32] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:22:32] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:22:32] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:22:32] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/552 variables, 9/589 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/552 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 19:22:33] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
SMT process timed out in 5034ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 244 transition count 258
Reduce places removed 74 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 79 rules applied. Total rules applied 153 place count 170 transition count 253
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 158 place count 165 transition count 253
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 158 place count 165 transition count 210
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 244 place count 122 transition count 210
Applied a total of 244 rules in 56 ms. Remains 122 /244 variables (removed 122) and now considering 210/332 (removed 122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 122/244 places, 210/332 transitions.
RANDOM walk for 40000 steps (8 resets) in 426 ms. (93 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 12/12 properties
[2024-06-01 19:22:34] [INFO ] Flow matrix only has 186 transitions (discarded 24 similar events)
// Phase 1: matrix 186 rows 122 cols
[2024-06-01 19:22:34] [INFO ] Computed 15 invariants in 3 ms
[2024-06-01 19:22:34] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 86/118 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 86/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 19:22:34] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:22:34] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2024-06-01 19:22:34] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 19:22:34] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 2 ms to minimize.
[2024-06-01 19:22:34] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 2 ms to minimize.
[2024-06-01 19:22:34] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:22:34] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:22:34] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:22:34] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/119 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 3/122 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 19:22:35] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
[2024-06-01 19:22:35] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 19:22:35] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:22:35] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-06-01 19:22:35] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:22:35] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 2 ms to minimize.
[2024-06-01 19:22:35] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 19:22:35] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:22:35] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
[2024-06-01 19:22:35] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:22:35] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 2 ms to minimize.
[2024-06-01 19:22:35] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:22:35] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 2 ms to minimize.
[2024-06-01 19:22:35] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-06-01 19:22:36] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/122 variables, 8/161 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 19:22:36] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/122 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 19:22:36] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 2 ms to minimize.
[2024-06-01 19:22:36] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
[2024-06-01 19:22:36] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/122 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/122 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 186/308 variables, 122/287 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/308 variables, 57/344 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 19:22:36] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/308 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 19:22:36] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:22:36] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
[2024-06-01 19:22:37] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 2 ms to minimize.
[2024-06-01 19:22:37] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
Problem AtomicPropp52 is UNSAT
[2024-06-01 19:22:37] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/308 variables, 5/350 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/308 variables, 0/350 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-01 19:22:37] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 2 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/308 variables, 1/351 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/308 variables, 0/351 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-01 19:22:37] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 26 (OVERLAPS) 0/308 variables, 1/352 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/308 variables, 0/352 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 28 (OVERLAPS) 0/308 variables, 0/352 constraints. Problems are: Problem set: 1 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 352 constraints, problems are : Problem set: 1 solved, 11 unsolved in 4093 ms.
Refiners :[Domain max(s): 122/122 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 122/122 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 1 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 86/113 variables, 8/35 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 86/121 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/122 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 9/131 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 2/115 variables, 2/133 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 2/135 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 3/118 variables, 3/138 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/118 variables, 3/141 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/118 variables, 12/153 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-01 19:22:38] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/118 variables, 1/154 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-01 19:22:38] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:22:38] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-06-01 19:22:38] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:22:38] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/118 variables, 4/158 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-01 19:22:38] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:22:38] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:22:38] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 3 ms to minimize.
[2024-06-01 19:22:39] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:22:39] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-06-01 19:22:39] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
[2024-06-01 19:22:39] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:22:39] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:22:39] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:22:39] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:22:39] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/118 variables, 11/169 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/118 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 186/304 variables, 118/287 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/304 variables, 57/344 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/304 variables, 11/355 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-01 19:22:39] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/304 variables, 1/356 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-01 19:22:39] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/304 variables, 1/357 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/304 variables, 0/357 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 4/308 variables, 4/361 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/308 variables, 4/365 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/308 variables, 1/366 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/308 variables, 15/381 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/308 variables, 0/381 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 28 (OVERLAPS) 0/308 variables, 0/381 constraints. Problems are: Problem set: 1 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 381 constraints, problems are : Problem set: 1 solved, 11 unsolved in 3116 ms.
Refiners :[Domain max(s): 122/122 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 122/122 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 11/12 constraints, Known Traps: 54/54 constraints]
After SMT, in 7228ms problems are : Problem set: 1 solved, 11 unsolved
Parikh walk visited 3 properties in 2792 ms.
Support contains 13 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 210/210 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 122 transition count 205
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 117 transition count 204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 116 transition count 204
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 12 place count 116 transition count 200
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 20 place count 112 transition count 200
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 40 place count 102 transition count 190
Applied a total of 40 rules in 24 ms. Remains 102 /122 variables (removed 20) and now considering 190/210 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 102/122 places, 190/210 transitions.
RANDOM walk for 40000 steps (8 resets) in 177 ms. (224 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 8/8 properties
Probably explored full state space saw : 91782 states, properties seen :7
Probabilistic random walk after 458910 steps, saw 91782 distinct states, run finished after 1701 ms. (steps per millisecond=269 ) properties seen :7
Explored full state space saw : 91784 states, properties seen :0
Exhaustive walk after 458920 steps, saw 91784 distinct states, run finished after 775 ms. (steps per millisecond=592 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
FORMULA Peterson-PT-3-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 19:22:46] [INFO ] Flatten gal took : 28 ms
[2024-06-01 19:22:46] [INFO ] Flatten gal took : 30 ms
[2024-06-01 19:22:46] [INFO ] Input system was already deterministic with 332 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 244 transition count 331
Reduce places removed 1 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 13 rules applied. Total rules applied 14 place count 243 transition count 319
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 26 place count 231 transition count 319
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 32 place count 228 transition count 316
Applied a total of 32 rules in 28 ms. Remains 228 /244 variables (removed 16) and now considering 316/332 (removed 16) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 228/244 places, 316/332 transitions.
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 20 ms
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 21 ms
[2024-06-01 19:22:47] [INFO ] Input system was already deterministic with 316 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 244 transition count 329
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 241 transition count 329
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 6 place count 241 transition count 321
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 233 transition count 321
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 40 place count 224 transition count 312
Applied a total of 40 rules in 37 ms. Remains 224 /244 variables (removed 20) and now considering 312/332 (removed 20) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 224/244 places, 312/332 transitions.
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 16 ms
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 18 ms
[2024-06-01 19:22:47] [INFO ] Input system was already deterministic with 312 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 18 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 18 ms
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 19 ms
[2024-06-01 19:22:47] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 18 ms
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 18 ms
[2024-06-01 19:22:47] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 18 ms
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 15 ms
[2024-06-01 19:22:47] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 13 ms
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 14 ms
[2024-06-01 19:22:47] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 13 ms
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 14 ms
[2024-06-01 19:22:47] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 16 ms
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 14 ms
[2024-06-01 19:22:47] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 12 ms
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 13 ms
[2024-06-01 19:22:47] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 192 place count 148 transition count 189
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 286 place count 101 transition count 189
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 310 place count 89 transition count 177
Applied a total of 310 rules in 19 ms. Remains 89 /244 variables (removed 155) and now considering 177/332 (removed 155) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 89/244 places, 177/332 transitions.
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 6 ms
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 7 ms
[2024-06-01 19:22:47] [INFO ] Input system was already deterministic with 177 transitions.
RANDOM walk for 13651 steps (4 resets) in 39 ms. (341 steps per ms) remains 0/1 properties
FORMULA Peterson-PT-3-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 11 ms
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 14 ms
[2024-06-01 19:22:47] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 11 ms
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 12 ms
[2024-06-01 19:22:47] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 244 transition count 246
Reduce places removed 86 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 87 rules applied. Total rules applied 173 place count 158 transition count 245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 174 place count 157 transition count 245
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 174 place count 157 transition count 198
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 268 place count 110 transition count 198
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 290 place count 99 transition count 187
Applied a total of 290 rules in 22 ms. Remains 99 /244 variables (removed 145) and now considering 187/332 (removed 145) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 99/244 places, 187/332 transitions.
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 6 ms
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 7 ms
[2024-06-01 19:22:47] [INFO ] Input system was already deterministic with 187 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 19:22:47] [INFO ] Flatten gal took : 9 ms
[2024-06-01 19:22:48] [INFO ] Flatten gal took : 10 ms
[2024-06-01 19:22:48] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 19:22:48] [INFO ] Flatten gal took : 10 ms
[2024-06-01 19:22:48] [INFO ] Flatten gal took : 11 ms
[2024-06-01 19:22:48] [INFO ] Input system was already deterministic with 332 transitions.
[2024-06-01 19:22:48] [INFO ] Flatten gal took : 17 ms
[2024-06-01 19:22:48] [INFO ] Flatten gal took : 18 ms
[2024-06-01 19:22:48] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 25 ms.
[2024-06-01 19:22:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 244 places, 332 transitions and 1016 arcs took 9 ms.
Total runtime 84268 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Peterson-PT-3-CTLFireability-2024-00
Could not compute solution for formula : Peterson-PT-3-CTLFireability-2024-01
Could not compute solution for formula : Peterson-PT-3-CTLFireability-2024-02
Could not compute solution for formula : Peterson-PT-3-CTLFireability-2024-03
Could not compute solution for formula : Peterson-PT-3-CTLFireability-2024-04
Could not compute solution for formula : Peterson-PT-3-CTLFireability-2024-05
Could not compute solution for formula : Peterson-PT-3-CTLFireability-2024-06
Could not compute solution for formula : Peterson-PT-3-CTLFireability-2024-07
Could not compute solution for formula : Peterson-PT-3-CTLFireability-2024-08
Could not compute solution for formula : Peterson-PT-3-CTLFireability-2024-10
Could not compute solution for formula : Peterson-PT-3-CTLFireability-2024-11
Could not compute solution for formula : Peterson-PT-3-CTLFireability-2024-12
Could not compute solution for formula : Peterson-PT-3-CTLFireability-2024-13
Could not compute solution for formula : Peterson-PT-3-CTLFireability-2024-14

BK_STOP 1717269768783

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name Peterson-PT-3-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/992/ctl_0_
ctl formula name Peterson-PT-3-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/992/ctl_1_
ctl formula name Peterson-PT-3-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/992/ctl_2_
ctl formula name Peterson-PT-3-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/992/ctl_3_
ctl formula name Peterson-PT-3-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/992/ctl_4_
ctl formula name Peterson-PT-3-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/992/ctl_5_
ctl formula name Peterson-PT-3-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/992/ctl_6_
ctl formula name Peterson-PT-3-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/992/ctl_7_
ctl formula name Peterson-PT-3-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/992/ctl_8_
ctl formula name Peterson-PT-3-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/992/ctl_9_
ctl formula name Peterson-PT-3-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/992/ctl_10_
ctl formula name Peterson-PT-3-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/992/ctl_11_
ctl formula name Peterson-PT-3-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/992/ctl_12_
ctl formula name Peterson-PT-3-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/992/ctl_13_
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="Peterson-PT-3"
export BK_EXAMINATION="CTLFireability"
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 Peterson-PT-3, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654407200258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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