About the Execution of GreatSPN+red for JoinFreeModules-PT-0200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8988.132 | 1451810.00 | 3021572.00 | 2439.60 | ???????????????? | 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.r223-tall-171649610600057.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 JoinFreeModules-PT-0200, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649610600057
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 11 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 613K May 18 16:42 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 JoinFreeModules-PT-0200-CTLCardinality-2024-00
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-2024-01
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-2024-02
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-2024-03
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-2024-04
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-2024-05
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-2024-06
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-2024-07
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-2024-08
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-2024-09
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-2024-10
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-2024-11
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-2023-12
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-2023-13
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-2023-14
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716499527215
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0200
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 21:25:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 21:25:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 21:25:28] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2024-05-23 21:25:28] [INFO ] Transformed 1001 places.
[2024-05-23 21:25:28] [INFO ] Transformed 1601 transitions.
[2024-05-23 21:25:28] [INFO ] Parsed PT model containing 1001 places and 1601 transitions and 4602 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Reduce places removed 1 places and 0 transitions.
Support contains 138 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 82 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2024-05-23 21:25:28] [INFO ] Computed 200 invariants in 31 ms
[2024-05-23 21:25:28] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20463ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20500ms
[2024-05-23 21:25:49] [INFO ] Invariant cache hit.
[2024-05-23 21:25:49] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-23 21:25:49] [INFO ] Invariant cache hit.
[2024-05-23 21:25:50] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 21:25:50] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:25:50] [INFO ] Invariant cache hit.
[2024-05-23 21:25:50] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
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 Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60334ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60345ms
Finished structural reductions in LTL mode , in 1 iterations and 81744 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Support contains 138 out of 1000 places after structural reductions.
[2024-05-23 21:26:50] [INFO ] Flatten gal took : 121 ms
[2024-05-23 21:26:50] [INFO ] Flatten gal took : 66 ms
[2024-05-23 21:26:51] [INFO ] Input system was already deterministic with 1601 transitions.
Support contains 134 out of 1000 places (down from 138) after GAL structural reductions.
RANDOM walk for 40193 steps (8 resets) in 785 ms. (51 steps per ms) remains 53/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 51/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 48/48 properties
[2024-05-23 21:26:52] [INFO ] Invariant cache hit.
[2024-05-23 21:26:52] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 234/305 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 488/793 variables, 305/366 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/793 variables, 61/427 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/793 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/793 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 793/2601 variables, and 427 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1828 ms.
Refiners :[Positive P Invariants (semi-flows): 61/200 constraints, State Equation: 305/1000 constraints, ReadFeed: 61/200 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 234/305 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-23 21:26:54] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 12 ms to minimize.
[2024-05-23 21:26:54] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
[2024-05-23 21:26:54] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-23 21:26:54] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-23 21:26:54] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-23 21:26:54] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-23 21:26:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-23 21:26:54] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-23 21:26:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-23 21:26:54] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-23 21:26:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-23 21:26:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-23 21:26:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 21:26:55] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 7 ms to minimize.
[2024-05-23 21:26:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 21:26:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-23 21:26:55] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-23 21:26:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-23 21:26:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-23 21:26:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-23 21:26:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-23 21:26:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 5 ms to minimize.
[2024-05-23 21:26:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-23 21:26:55] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 488/793 variables, 305/390 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/793 variables, 61/451 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/793 variables, 48/499 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-23 21:26:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 21:26:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-23 21:26:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-23 21:26:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-23 21:26:57] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-23 21:26:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-23 21:26:58] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/793 variables, 7/506 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 793/2601 variables, and 506 constraints, problems are : Problem set: 0 solved, 48 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 61/200 constraints, State Equation: 305/1000 constraints, ReadFeed: 61/200 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 31/31 constraints]
After SMT, in 6879ms problems are : Problem set: 0 solved, 48 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 71 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Graph (complete) has 2400 edges and 1000 vertex of which 305 are kept as prefixes of interest. Removing 695 places using SCC suffix rule.4 ms
Discarding 695 places :
Also discarding 1112 output transitions
Drop transitions (Output transitions of discarded places.) removed 1112 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 488
Applied a total of 2 rules in 32 ms. Remains 305 /1000 variables (removed 695) and now considering 488/1601 (removed 1113) transitions.
Running 366 sub problems to find dead transitions.
// Phase 1: matrix 488 rows 305 cols
[2024-05-23 21:26:59] [INFO ] Computed 61 invariants in 4 ms
[2024-05-23 21:26:59] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 61/305 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (OVERLAPS) 488/793 variables, 305/366 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/793 variables, 61/427 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/793 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (OVERLAPS) 0/793 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 366 unsolved
No progress, stopping.
After SMT solving in domain Real declared 793/793 variables, and 427 constraints, problems are : Problem set: 0 solved, 366 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, State Equation: 305/305 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 61/305 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (OVERLAPS) 488/793 variables, 305/366 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/793 variables, 61/427 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/793 variables, 366/793 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-23 21:27:25] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-23 21:27:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 21:27:25] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 8 ms to minimize.
[2024-05-23 21:27:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-23 21:27:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-23 21:27:25] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-23 21:27:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 21:27:27] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-23 21:27:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 21:27:27] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-23 21:27:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-23 21:27:29] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 21:27:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-23 21:27:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-23 21:27:31] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-23 21:27:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 21:27:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/793 variables, 17/810 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 793/793 variables, and 810 constraints, problems are : Problem set: 0 solved, 366 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, State Equation: 305/305 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 17/17 constraints]
After SMT, in 40087ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 40091ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40123 ms. Remains : 305/1000 places, 488/1601 transitions.
RANDOM walk for 40385 steps (8 resets) in 202 ms. (198 steps per ms) remains 30/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
[2024-05-23 21:27:39] [INFO ] Invariant cache hit.
[2024-05-23 21:27:39] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 137/175 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 280/455 variables, 175/210 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 35/245 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 0/455 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/793 variables, and 245 constraints, problems are : Problem set: 0 solved, 28 unsolved in 690 ms.
Refiners :[Positive P Invariants (semi-flows): 35/61 constraints, State Equation: 175/305 constraints, ReadFeed: 35/61 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 137/175 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-23 21:27:40] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-23 21:27:40] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-23 21:27:40] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
[2024-05-23 21:27:40] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-23 21:27:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-23 21:27:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-23 21:27:40] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 21:27:40] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-23 21:27:40] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-23 21:27:40] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-23 21:27:40] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 280/455 variables, 175/221 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 35/256 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 28/284 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-23 21:27:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/455 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 455/793 variables, and 285 constraints, problems are : Problem set: 0 solved, 28 unsolved in 2277 ms.
Refiners :[Positive P Invariants (semi-flows): 35/61 constraints, State Equation: 175/305 constraints, ReadFeed: 35/61 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 12/12 constraints]
After SMT, in 2977ms problems are : Problem set: 0 solved, 28 unsolved
Fused 28 Parikh solutions to 9 different solutions.
Parikh walk visited 27 properties in 34517 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 488/488 transitions.
Graph (complete) has 732 edges and 305 vertex of which 10 are kept as prefixes of interest. Removing 295 places using SCC suffix rule.1 ms
Discarding 295 places :
Also discarding 472 output transitions
Drop transitions (Output transitions of discarded places.) removed 472 transitions
Applied a total of 1 rules in 2 ms. Remains 10 /305 variables (removed 295) and now considering 16/488 (removed 472) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 10/305 places, 16/488 transitions.
RANDOM walk for 40182 steps (8 resets) in 101 ms. (393 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3062611 steps, run timeout after 3001 ms. (steps per millisecond=1020 ) properties seen :0 out of 1
Probabilistic random walk after 3062611 steps, saw 2182199 distinct states, run finished after 3007 ms. (steps per millisecond=1018 ) properties seen :0
// Phase 1: matrix 16 rows 10 cols
[2024-05-23 21:28:20] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 21:28:20] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 16/26 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 14 constraints, problems are : Problem set: 0 solved, 1 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 10/10 constraints, ReadFeed: 2/2 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/26 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 21:28:20] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/26 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 16 constraints, problems are : Problem set: 0 solved, 1 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 10/10 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 120ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 16/16 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-05-23 21:28:20] [INFO ] Invariant cache hit.
[2024-05-23 21:28:20] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-23 21:28:20] [INFO ] Invariant cache hit.
[2024-05-23 21:28:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 21:28:20] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-23 21:28:20] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-23 21:28:20] [INFO ] Invariant cache hit.
[2024-05-23 21:28:20] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 2/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 16/26 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 14 constraints, problems are : Problem set: 0 solved, 12 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 10/10 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 2/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 16/26 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 26 constraints, problems are : Problem set: 0 solved, 12 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 10/10 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 211ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 212ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 10/10 places, 16/16 transitions.
[2024-05-23 21:28:20] [INFO ] Flatten gal took : 51 ms
[2024-05-23 21:28:20] [INFO ] Flatten gal took : 45 ms
[2024-05-23 21:28:20] [INFO ] Input system was already deterministic with 1601 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 87 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2024-05-23 21:28:21] [INFO ] Computed 200 invariants in 10 ms
[2024-05-23 21:28:21] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20290ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20300ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 20391 ms. Remains : 1000/1000 places, 1601/1601 transitions.
[2024-05-23 21:28:41] [INFO ] Flatten gal took : 43 ms
[2024-05-23 21:28:41] [INFO ] Flatten gal took : 34 ms
[2024-05-23 21:28:41] [INFO ] Input system was already deterministic with 1601 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 21 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:28:41] [INFO ] Invariant cache hit.
[2024-05-23 21:28:41] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20225ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20235ms
Finished structural reductions in LTL mode , in 1 iterations and 20258 ms. Remains : 1000/1000 places, 1601/1601 transitions.
[2024-05-23 21:29:01] [INFO ] Flatten gal took : 35 ms
[2024-05-23 21:29:01] [INFO ] Flatten gal took : 34 ms
[2024-05-23 21:29:01] [INFO ] Input system was already deterministic with 1601 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 58 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:29:01] [INFO ] Invariant cache hit.
[2024-05-23 21:29:01] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20239ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20249ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 20309 ms. Remains : 1000/1000 places, 1601/1601 transitions.
[2024-05-23 21:29:22] [INFO ] Flatten gal took : 31 ms
[2024-05-23 21:29:22] [INFO ] Flatten gal took : 30 ms
[2024-05-23 21:29:22] [INFO ] Input system was already deterministic with 1601 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 12 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:29:22] [INFO ] Invariant cache hit.
[2024-05-23 21:29:22] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20232ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20241ms
Finished structural reductions in LTL mode , in 1 iterations and 20255 ms. Remains : 1000/1000 places, 1601/1601 transitions.
[2024-05-23 21:29:42] [INFO ] Flatten gal took : 30 ms
[2024-05-23 21:29:42] [INFO ] Flatten gal took : 30 ms
[2024-05-23 21:29:42] [INFO ] Input system was already deterministic with 1601 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 54 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:29:42] [INFO ] Invariant cache hit.
[2024-05-23 21:29:42] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20280ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20291ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 20347 ms. Remains : 1000/1000 places, 1601/1601 transitions.
[2024-05-23 21:30:03] [INFO ] Flatten gal took : 29 ms
[2024-05-23 21:30:03] [INFO ] Flatten gal took : 29 ms
[2024-05-23 21:30:03] [INFO ] Input system was already deterministic with 1601 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 12 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:30:03] [INFO ] Invariant cache hit.
[2024-05-23 21:30:03] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s3 4.0)
(s4 5.0)
(s5 5.0)
(s6 2.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 2.0)
(s13 4.0)
(s14 5.0)
(s15 5.0)
(s16 2.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s23 4.0)
(s24 5.0)
(s25 5.0)
(s26 2.0)
(s28 4.0)
(s29 5.0)
(s30 5.0)
(s31 2.0)
(s33 4.0)
(s34 5.0)
(s35 5.0)
(s36 2.0)
(s38 4.0)
(s39 5.0)
(s40 5.0)
(s41 2.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 2.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s58 4.0)
(s59 5.0)
(s60 5.0)
(s61 2.0)
(s63 4.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s68 4.0)
(s69 5.0)
(s70 5.0)
(s71 2.0)
(s73 4.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 2.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s88 4.0)
(s89 5.0)
(s90 5.0)
(s91 2.0)
(s93 4.0)
(s94 5.0)
(s95 5.0)
(s96 2.0)
(s98 4.0)
(s99 5.0)
(s100 5.0)
(s101 2.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 2.0)
(s108 4.0)
(s109 5.0)
(s110 5.0)
(s111 2.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s118 4.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s123 4.0)
(s124 5.0)
(s125 5.0)
(s126 2.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 2.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 2.0)
(s138 4.0)
(s139 5.0)
(s140 5.0)
(s141 2.0)
(s143 4.0)
(s144 5.0)
(s145 5.0)
(s146 2.0)
(s148 4.0)
(s149 5.0)
(s150 5.0)
(s151 2.0)
(s153 4.0)
(s154 5.0)
(s155 5.0)
(s156 2.0)
(s158 4.0)
(s159 5.0)
(s160 5.0)
(s161 2.0)
(s163 4.0)
(s164 5.0)
(s165 5.0)
(s166 2.0)
(s168 4.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s173 4.0)
(s174 5.0)
(s175 5.0)
(s176 2.0)
(s178 4.0)
(s179 5.0)
(s180 5.0)
(s181 2.0)
(s183 4.0)
(s184 5.0)
(s185 5.0)
(s186 2.0)
(s188 4.0)
(s189 5.0)
(s190 5.0)
(s191 2.0)
(s193 4.0)
(s194 5.0)
(s195 5.0)
(s196 2.0)
(s198 4.0)
(s199 5.0)
(s200 5.0)
(s201 2.0)
(s203 4.0)
(s204 5.0)
(s205 5.0)
(s206 2.0)
(s208 4.0)
(s209 5.0)
(s210 5.0)
(s211 2.0)
(s213 4.0)
(s214 5.0)
(s215 5.0)
(s216 2.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s221 2.0)
(s223 4.0)
(s224 5.0)
(s225 5.0)
(s226 2.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s231 2.0)
(s233 4.0)
(s234 5.0)
(s235 5.0)
(s236 2.0)
(s238 4.0)
(s239 5.0)
(s240 5.0)
(s241 2.0)
(s243 4.0)
(s244 5.0)
(s245 5.0)
(s246 2.0)
(s248 4.0)
(s249 5.0)
(s250 5.0)
(s251 2.0)
(s253 4.0)
(s254 5.0)
(s255 5.0)
(s256 2.0)
(s258 4.0)
(s259 5.0)
(s260 5.0)
(s261 2.0)
(s263 4.0)
(s264 5.0)
(s265 5.0)
(s266 2.0)
(s268 4.0)
(s269 5.0)
(s270 5.0)
(s271 2.0)
(s273 4.0)
(s274 5.0)
(s275 5.0)
(s276 2.0)
(s278 4.0)
(s279 5.0)
(s280 5.0)
(s281 2.0)
(s283 4.0)
(s284 5.0)
(s285 5.0)
(s286 2.0)
(s288 4.0)
(s289 5.0)
(s290 5.0)
(s291 2.0)
(s293 4.0)
(s294 5.0)
(s295 5.0)
(s296 2.0)
(s298 4.0)
(s299 5.0)
(s300 5.0)
(s301 2.0)
(s303 4.0)
(s304 5.0)
(s305 5.0)
(s306 2.0)
(s308 4.0)
(s309 5.0)
(s310 5.0)
(s311 2.0)
(s313 4.0)
(s314 5.0)
(s315 5.0)
(s316 2.0)
(s318 4.0)
(s319 5.0)
(s320 5.0)
(s321 2.0)
(s323 4.0)
(s324 5.0)
(s325 5.0)
(s326 2.0)
(s328 4.0)
(s329 5.0)
(s330 5.0)
(s331 2.0)
(s333 4.0)
(s334 5.0)
(s335 5.0)
(s336 2.0)
(s338 4.0)
(s339 5.0)
(s340 5.0)
(s341 2.0)
(s343 4.0)
(s344 5.0)
(s345 5.0)
(s346 2.0)
(s348 4.0)
(s349 5.0)
(s350 5.0)
(s351 2.0)
(s353 4.0)
(s354 5.0)
(s355 5.0)
(s356 2.0)
(s358 4.0)
(s359 5.0)
(s360 5.0)
(s361 2.0)
(s363 4.0)
(s364 5.0)
(s365 5.0)
(s366 2.0)
(s368 4.0)
(s369 5.0)
(s370 5.0)
(s371 2.0)
(s373 4.0)
(s374 5.0)
(s375 5.0)
(s376 2.0)
(s378 4.0)
(s379 5.0)
(s380 5.0)
(s381 2.0)
(s383 4.0)
(s384 5.0)
(s385 5.0)
(s386 2.0)
(s388 4.0)
(s389 5.0)
(s390 5.0)
(s391 2.0)
(s393 4.0)
(s394 5.0)
(s395 5.0)
(s396 2.0)
(s398 4.0)
(s399 5.0)
(s400 5.0)
(s401 2.0)
(s403 4.0)
(s404 5.0)
(s405 5.0)
(s406 2.0)
(s408 4.0)
(s409 5.0)
(s410 5.0)
(s411 2.0)
(s413 4.0)
(s414 5.0)
(s415 5.0)
(s416 2.0)
(s418 4.0)
(s419 5.0)
(s420 5.0)
(s421 2.0)
(s423 4.0)
(s424 5.0)
(s425 5.0)
(s426 2.0)
(s428 4.0)
(s429 5.0)
(s430 5.0)
(s431 2.0)
(s433 4.0)
(s434 5.0)
(s435 5.0)
(s436 2.0)
(s438 4.0)
(s439 5.0)
(s440 5.0)
(s441 2.0)
(s443 4.0)
(s444 5.0)
(s445 5.0)
(s446 2.0)
(s448 4.0)
(s449 5.0)
(s450 5.0)
(s451 2.0)
(s453 4.0)
(s454 5.0)
(s455 5.0)
(s456 2.0)
(s458 4.0)
(s459 5.0)
(s460 5.0)
(s461 2.0)
(s463 4.0)
(s464 5.0)
(s465 5.0)
(s466 2.0)
(s468 4.0)
(s469 5.0)
(s470 5.0)
(s471 2.0)
(s473 4.0)
(s474 5.0)
(s475 5.0)
(s476 2.0)
(s478 4.0)
(s479 5.0)
(s480 5.0)
(s481 2.0)
(s483 4.0)
(s484 5.0)
(s485 5.0)
(s486 2.0)
(s488 4.0)
(s489 5.0)
(s490 5.0)
(s491 2.0)
(s493 4.0)
(s494 5.0)
(s495 5.0)
(s496 2.0)
(s498 4.0)
(s499 5.0)
(s500 5.0)
(s501 2.0)
(s503 4.0)
(s504 5.0)
(s505 5.0)
(s506 2.0)
(s508 4.0)
(s509 5.0)
(s510 5.0)
(s511 2.0)
(s513 4.0)
(s514 5.0)
(s515 5.0)
(s516 2.0)
(s518 4.0)
(s519 5.0)
(s520 5.0)
(s521 2.0)
(s523 4.0)
(s524 5.0)
(s525 5.0)
(s526 2.0)
(s528 4.0)
(s529 5.0)
(s530 5.0)
(s531 2.0)
(s533 4.0)
(s534 5.0)
(s535 5.0)
(s536 2.0)
(s538 4.0)
(s539 5.0)
(s540 5.0)
(s541 2.0)
(s543 4.0)
(s544 5.0)
(s545 5.0)
(s546 2.0)
(s548 4.0)
(s549 5.0)
(s550 5.0)
(s551 2.0)
(s553 4.0)
(s554 5.0)
(s555 5.0)
(s556 2.0)
(s558 4.0)
(s559 5.0)
(s560 5.0)
(s561 2.0)
(s563 4.0)
(s564 5.0)
(s565 5.0)
(s566 2.0)
(s568 4.0)
(s569 5.0)
(s570 5.0)
(s571 2.0)
(s573 4.0)
(s574 5.0)
(s575 5.0)
(s576 2.0)
(s578 4.0)
(s579 5.0)
(s580 5.0)
(s581 2.0)
(s583 4.0)
(s584 5.0)
(s585 5.0)
(s586 2.0)
(s588 4.0)
(s589 5.0)
(s590 5.0)
(s591 2.0)
(s593 4.0)
(s594 5.0)
(s595 5.0)
(s596 2.0)
(s598 4.0)
(s599 5.0)
(s600 5.0)
(s601 2.0)
(s603 4.0)
(s604 5.0)
(s605 5.0)
(s606 2.0)
(s608 4.0)
(s609 5.0)
(s610 5.0)
(s611 2.0)
(s613 4.0)
(s614 5.0)
(s615 5.0)
(s616 2.0)
(s618 4.0)
(s619 5.0)
(s620 5.0)
(s621 2.0)
(s623 4.0)
(s624 5.0)
(s625 5.0)
(s626 2.0)
(s628 4.0)
(s629 5.0)
(s630 5.0)
(s631 2.0)
(s633 4.0)
(s634 5.0)
(s635 5.0)
(s636 2.0)
(s638 4.0)
(s639 5.0)
(s640 5.0)
(s641 2.0)
(s643 4.0)
(s644 5.0)
(s645 5.0)
(s646 2.0)
(s648 4.0)
(s649 5.0)
(s650 5.0)
(s651 2.0)
(s653 4.0)
(s654 5.0)
(s655 5.0)
(s656 2.0)
(s658 4.0)
(s659 5.0)
(s660 5.0)
(s661 2.0)
(s663 4.0)
(s664 5.0)
(s665 5.0)
(s666 2.0)
(s668 4.0)
(s669 5.0)
(s670 5.0)
(s671 2.0)
(s673 4.0)
(s674 5.0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20271ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20282ms
Finished structural reductions in LTL mode , in 1 iterations and 20296 ms. Remains : 1000/1000 places, 1601/1601 transitions.
[2024-05-23 21:30:23] [INFO ] Flatten gal took : 27 ms
[2024-05-23 21:30:23] [INFO ] Flatten gal took : 26 ms
[2024-05-23 21:30:23] [INFO ] Input system was already deterministic with 1601 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 11 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:30:23] [INFO ] Invariant cache hit.
[2024-05-23 21:30:23] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20236ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20245ms
Finished structural reductions in LTL mode , in 1 iterations and 20258 ms. Remains : 1000/1000 places, 1601/1601 transitions.
[2024-05-23 21:30:43] [INFO ] Flatten gal took : 27 ms
[2024-05-23 21:30:43] [INFO ] Flatten gal took : 27 ms
[2024-05-23 21:30:44] [INFO ] Input system was already deterministic with 1601 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 11 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:30:44] [INFO ] Invariant cache hit.
[2024-05-23 21:30:44] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20222ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20230ms
Finished structural reductions in LTL mode , in 1 iterations and 20243 ms. Remains : 1000/1000 places, 1601/1601 transitions.
[2024-05-23 21:31:04] [INFO ] Flatten gal took : 26 ms
[2024-05-23 21:31:04] [INFO ] Flatten gal took : 27 ms
[2024-05-23 21:31:04] [INFO ] Input system was already deterministic with 1601 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 11 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:31:04] [INFO ] Invariant cache hit.
[2024-05-23 21:31:04] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20226ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20234ms
Finished structural reductions in LTL mode , in 1 iterations and 20247 ms. Remains : 1000/1000 places, 1601/1601 transitions.
[2024-05-23 21:31:24] [INFO ] Flatten gal took : 26 ms
[2024-05-23 21:31:24] [INFO ] Flatten gal took : 26 ms
[2024-05-23 21:31:24] [INFO ] Input system was already deterministic with 1601 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 11 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:31:24] [INFO ] Invariant cache hit.
[2024-05-23 21:31:24] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s3 4.0)
(s4 5.0)
(s5 5.0)
(s6 2.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 2.0)
(s13 4.0)
(s14 5.0)
(s15 5.0)
(s16 2.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s23 4.0)
(s24 5.0)
(s25 5.0)
(s26 2.0)
(s28 4.0)
(s29 5.0)
(s30 5.0)
(s31 2.0)
(s33 4.0)
(s34 5.0)
(s35 5.0)
(s36 2.0)
(s38 4.0)
(s39 5.0)
(s40 5.0)
(s41 2.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 2.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s58 4.0)
(s59 5.0)
(s60 5.0)
(s61 2.0)
(s63 4.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s68 4.0)
(s69 5.0)
(s70 5.0)
(s71 2.0)
(s73 4.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 2.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s88 4.0)
(s89 5.0)
(s90 5.0)
(s91 2.0)
(s93 4.0)
(s94 5.0)
(s95 5.0)
(s96 2.0)
(s98 4.0)
(s99 5.0)
(s100 5.0)
(s101 2.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 2.0)
(s108 4.0)
(s109 5.0)
(s110 5.0)
(s111 2.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s118 4.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s123 4.0)
(s124 5.0)
(s125 5.0)
(s126 2.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 2.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 2.0)
(s138 4.0)
(s139 5.0)
(s140 5.0)
(s141 2.0)
(s143 4.0)
(s144 5.0)
(s145 5.0)
(s146 2.0)
(s148 4.0)
(s149 5.0)
(s150 5.0)
(s151 2.0)
(s153 4.0)
(s154 5.0)
(s155 5.0)
(s156 2.0)
(s158 4.0)
(s159 5.0)
(s160 5.0)
(s161 2.0)
(s163 4.0)
(s164 5.0)
(s165 5.0)
(s166 2.0)
(s168 4.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s173 4.0)
(s174 5.0)
(s175 5.0)
(s176 2.0)
(s178 4.0)
(s179 5.0)
(s180 5.0)
(s181 2.0)
(s183 4.0)
(s184 5.0)
(s185 5.0)
(s186 2.0)
(s188 4.0)
(s189 5.0)
(s190 5.0)
(s191 2.0)
(s193 4.0)
(s194 5.0)
(s195 5.0)
(s196 2.0)
(s198 4.0)
(s199 5.0)
(s200 5.0)
(s201 2.0)
(s203 4.0)
(s204 5.0)
(s205 5.0)
(s206 2.0)
(s208 4.0)
(s209 5.0)
(s210 5.0)
(s211 2.0)
(s213 4.0)
(s214 5.0)
(s215 5.0)
(s216 2.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s221 2.0)
(s223 4.0)
(s224 5.0)
(s225 5.0)
(s226 2.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s231 2.0)
(s233 4.0)
(s234 5.0)
(s235 5.0)
(s236 2.0)
(s238 4.0)
(s239 5.0)
(s240 5.0)
(s241 2.0)
(s243 4.0)
(s244 5.0)
(s245 5.0)
(s246 2.0)
(s248 4.0)
(s249 5.0)
(s250 5.0)
(s251 2.0)
(s253 4.0)
(s254 5.0)
(s255 5.0)
(s256 2.0)
(s258 4.0)
(s259 5.0)
(s260 5.0)
(s261 2.0)
(s263 4.0)
(s264 5.0)
(s265 5.0)
(s266 2.0)
(s268 4.0)
(s269 5.0)
(s270 5.0)
(s271 2.0)
(s273 4.0)
(s274 5.0)
(s275 5.0)
(s276 2.0)
(s278 4.0)
(s279 5.0)
(s280 5.0)
(s281 2.0)
(s283 4.0)
(s284 5.0)
(s285 5.0)
(s286 2.0)
(s288 4.0)
(s289 5.0)
(s290 5.0)
(s291 2.0)
(s293 4.0)
(s294 5.0)
(s295 5.0)
(s296 2.0)
(s298 4.0)
(s299 5.0)
(s300 5.0)
(s301 2.0)
(s303 4.0)
(s304 5.0)
(s305 5.0)
(s306 2.0)
(s308 4.0)
(s309 5.0)
(s310 5.0)
(s311 2.0)
(s313 4.0)
(s314 5.0)
(s315 5.0)
(s316 2.0)
(s318 4.0)
(s319 5.0)
(s320 5.0)
(s321 2.0)
(s323 4.0)
(s324 5.0)
(s325 5.0)
(s326 2.0)
(s328 4.0)
(s329 5.0)
(s330 5.0)
(s331 2.0)
(s333 4.0)
(s334 5.0)
(s335 5.0)
(s336 2.0)
(s338 4.0)
(s339 5.0)
(s340 5.0)
(s341 2.0)
(s343 4.0)
(s344 5.0)
(s345 5.0)
(s346 2.0)
(s348 4.0)
(s349 5.0)
(s350 5.0)
(s351 2.0)
(s353 4.0)
(s354 5.0)
(s355 5.0)
(s356 2.0)
(s358 4.0)
(s359 5.0)
(s360 5.0)
(s361 2.0)
(s363 4.0)
(s364 5.0)
(s365 5.0)
(s366 2.0)
(s368 4.0)
(s369 5.0)
(s370 5.0)
(s371 2.0)
(s373 4.0)
(s374 5.0)
(s375 5.0)
(s376 2.0)
(s378 4.0)
(s379 5.0)
(s380 5.0)
(s381 2.0)
(s383 4.0)
(s384 5.0)
(s385 5.0)
(s386 2.0)
(s388 4.0)
(s389 5.0)
(s390 5.0)
(s391 2.0)
(s393 4.0)
(s394 5.0)
(s395 5.0)
(s396 2.0)
(s398 4.0)
(s399 5.0)
(s400 5.0)
(s401 2.0)
(s403 4.0)
(s404 5.0)
(s405 5.0)
(s406 2.0)
(s408 4.0)
(s409 5.0)
(s410 5.0)
(s411 2.0)
(s413 4.0)
(s414 5.0)
(s415 5.0)
(s416 2.0)
(s418 4.0)
(s419 5.0)
(s420 5.0)
(s421 2.0)
(s423 4.0)
(s424 5.0)
(s425 5.0)
(s426 2.0)
(s428 4.0)
(s429 5.0)
(s430 5.0)
(s431 2.0)
(s433 4.0)
(s434 5.0)
(s435 5.0)
(s436 2.0)
(s438 4.0)
(s439 5.0)
(s440 5.0)
(s441 2.0)
(s443 4.0)
(s444 5.0)
(s445 5.0)
(s446 2.0)
(s448 4.0)
(s449 5.0)
(s450 5.0)
(s451 2.0)
(s453 4.0)
(s454 5.0)
(s455 5.0)
(s456 2.0)
(s458 4.0)
(s459 5.0)
(s460 5.0)
(s461 2.0)
(s463 4.0)
(s464 5.0)
(s465 5.0)
(s466 2.0)
(s468 4.0)
(s469 5.0)
(s470 5.0)
(s471 2.0)
(s473 4.0)
(s474 5.0)
(s475 5.0)
(s476 2.0)
(s478 4.0)
(s479 5.0)
(s480 5.0)
(s481 2.0)
(s483 4.0)
(s484 5.0)
(s485 5.0)
(s486 2.0)
(s488 4.0)
(s489 5.0)
(s490 5.0)
(s491 2.0)
(s493 4.0)
(s494 5.0)
(s495 5.0)
(s496 2.0)
(s498 4.0)
(s499 5.0)
(s500 5.0)
(s501 2.0)
(s503 4.0)
(s504 5.0)
(s505 5.0)
(s506 2.0)
(s508 4.0)
(s509 5.0)
(s510 5.0)
(s511 2.0)
(s513 4.0)
(s514 5.0)
(s515 5.0)
(s516 2.0)
(s518 4.0)
(s519 5.0)
(s520 5.0)
(s521 2.0)
(s523 4.0)
(s524 5.0)
(s525 5.0)
(s526 2.0)
(s528 4.0)
(s529 5.0)
(s530 5.0)
(s531 2.0)
(s533 4.0)
(s534 5.0)
(s535 5.0)
(s536 2.0)
(s538 4.0)
(s539 5.0)
(s540 5.0)
(s541 2.0)
(s543 4.0)
(s544 5.0)
(s545 5.0)
(s546 2.0)
(s548 4.0)
(s549 5.0)
(s550 timeout
5.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20229ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20237ms
Finished structural reductions in LTL mode , in 1 iterations and 20250 ms. Remains : 1000/1000 places, 1601/1601 transitions.
[2024-05-23 21:31:45] [INFO ] Flatten gal took : 27 ms
[2024-05-23 21:31:45] [INFO ] Flatten gal took : 27 ms
[2024-05-23 21:31:45] [INFO ] Input system was already deterministic with 1601 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 11 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:31:45] [INFO ] Invariant cache hit.
[2024-05-23 21:31:45] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s3 4.0)
(s4 5.0)
(s5 5.0)
(s6 2.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 2.0)
(s13 4.0)
(s14 5.0)
(s15 5.0)
(s16 2.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s23 4.0)
(s24 5.0)
(s25 5.0)
(s26 2.0)
(s28 4.0)
(s29 5.0)
(s30 5.0)
(s31 2.0)
(s33 4.0)
(s34 5.0)
(s35 5.0)
(s36 2.0)
(s38 4.0)
(s39 5.0)
(s40 5.0)
(s41 2.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 2.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s58 4.0)
(s59 5.0)
(s60 5.0)
(s61 2.0)
(s63 4.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s68 4.0)
(s69 5.0)
(s70 5.0)
(s71 2.0)
(s73 4.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 2.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s88 4.0)
(s89 5.0)
(s90 5.0)
(s91 2.0)
(s93 4.0)
(s94 5.0)
(s95 5.0)
(s96 2.0)
(s98 4.0)
(s99 5.0)
(s100 5.0)
(s101 2.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 2.0)
(s108 4.0)
(s109 5.0)
(s110 5.0)
(s111 2.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s118 4.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s123 4.0)
(s124 5.0)
(s125 5.0)
(s126 2.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 2.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 2.0)
(s138 4.0)
(s139 5.0)
(s140 5.0)
(s141 2.0)
(s143 4.0)
(s144 5.0)
(s145 5.0)
(s146 2.0)
(s148 4.0)
(s149 5.0)
(s150 5.0)
(s151 2.0)
(s153 4.0)
(s154 5.0)
(s155 5.0)
(s156 2.0)
(s158 4.0)
(s159 5.0)
(s160 5.0)
(s161 2.0)
(s163 4.0)
(s164 5.0)
(s165 5.0)
(s166 2.0)
(s168 4.0)
(s169 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20224ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20232ms
Finished structural reductions in LTL mode , in 1 iterations and 20245 ms. Remains : 1000/1000 places, 1601/1601 transitions.
[2024-05-23 21:32:05] [INFO ] Flatten gal took : 29 ms
[2024-05-23 21:32:05] [INFO ] Flatten gal took : 38 ms
[2024-05-23 21:32:05] [INFO ] Input system was already deterministic with 1601 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 11 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:32:05] [INFO ] Invariant cache hit.
[2024-05-23 21:32:05] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20222ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20230ms
Finished structural reductions in LTL mode , in 1 iterations and 20243 ms. Remains : 1000/1000 places, 1601/1601 transitions.
[2024-05-23 21:32:25] [INFO ] Flatten gal took : 29 ms
[2024-05-23 21:32:25] [INFO ] Flatten gal took : 25 ms
[2024-05-23 21:32:25] [INFO ] Input system was already deterministic with 1601 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 10 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:32:25] [INFO ] Invariant cache hit.
[2024-05-23 21:32:25] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20220ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20228ms
Finished structural reductions in LTL mode , in 1 iterations and 20240 ms. Remains : 1000/1000 places, 1601/1601 transitions.
[2024-05-23 21:32:46] [INFO ] Flatten gal took : 25 ms
[2024-05-23 21:32:46] [INFO ] Flatten gal took : 25 ms
[2024-05-23 21:32:46] [INFO ] Input system was already deterministic with 1601 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 12 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:32:46] [INFO ] Invariant cache hit.
[2024-05-23 21:32:46] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20221ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20229ms
Finished structural reductions in LTL mode , in 1 iterations and 20243 ms. Remains : 1000/1000 places, 1601/1601 transitions.
[2024-05-23 21:33:06] [INFO ] Flatten gal took : 28 ms
[2024-05-23 21:33:06] [INFO ] Flatten gal took : 25 ms
[2024-05-23 21:33:06] [INFO ] Input system was already deterministic with 1601 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 10 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:33:06] [INFO ] Invariant cache hit.
[2024-05-23 21:33:06] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20225ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20233ms
Finished structural reductions in LTL mode , in 1 iterations and 20245 ms. Remains : 1000/1000 places, 1601/1601 transitions.
[2024-05-23 21:33:26] [INFO ] Flatten gal took : 26 ms
[2024-05-23 21:33:26] [INFO ] Flatten gal took : 24 ms
[2024-05-23 21:33:26] [INFO ] Input system was already deterministic with 1601 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 10 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:33:26] [INFO ] Invariant cache hit.
[2024-05-23 21:33:26] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20225ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20233ms
Finished structural reductions in LTL mode , in 1 iterations and 20245 ms. Remains : 1000/1000 places, 1601/1601 transitions.
[2024-05-23 21:33:47] [INFO ] Flatten gal took : 27 ms
[2024-05-23 21:33:47] [INFO ] Flatten gal took : 25 ms
[2024-05-23 21:33:47] [INFO ] Input system was already deterministic with 1601 transitions.
[2024-05-23 21:33:47] [INFO ] Flatten gal took : 25 ms
[2024-05-23 21:33:47] [INFO ] Flatten gal took : 26 ms
[2024-05-23 21:33:47] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-23 21:33:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1000 places, 1601 transitions and 4600 arcs took 15 ms.
Total runtime 498962 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running JoinFreeModules-PT-0200
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/405/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1000
TRANSITIONS: 1601
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.023s, Sys 0.007s]
SAVING FILE /home/mcc/execution/405/model (.net / .def) ...
EXPORT TIME: [User 0.004s, 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: 861
MODEL NAME: /home/mcc/execution/405/model
1000 places, 1601 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 JoinFreeModules-PT-0200-CTLCardinality-2024-00 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0200-CTLCardinality-2024-01 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0200-CTLCardinality-2024-02 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0200-CTLCardinality-2024-03 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0200-CTLCardinality-2024-04 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0200-CTLCardinality-2024-05 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0200-CTLCardinality-2024-06 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0200-CTLCardinality-2024-07 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0200-CTLCardinality-2024-08 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0200-CTLCardinality-2024-09 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0200-CTLCardinality-2024-10 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0200-CTLCardinality-2024-11 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0200-CTLCardinality-2023-12 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0200-CTLCardinality-2023-13 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0200-CTLCardinality-2023-14 CANNOT_COMPUTE
FORMULA JoinFreeModules-PT-0200-CTLCardinality-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716500979025
--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-0200"
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 JoinFreeModules-PT-0200, 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 r223-tall-171649610600057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0200.tgz
mv JoinFreeModules-PT-0200 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 ;