About the Execution of GreatSPN+red for BridgeAndVehicles-PT-V80P20N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16187.123 | 2253784.00 | 8314782.00 | 180.40 | ?F????????????TF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620397900276.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BridgeAndVehicles-PT-V80P20N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397900276
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.3M
-rw-r--r-- 1 mcc users 23K Apr 13 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 13 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 330K Apr 13 00:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 13 00:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 115K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 334K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 13 01:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 13 01:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 885K Apr 13 01:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.4M Apr 13 01:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.7M 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 BridgeAndVehicles-PT-V80P20N10-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716290209905
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P20N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 11:16:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 11:16:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:16:51] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2024-05-21 11:16:51] [INFO ] Transformed 188 places.
[2024-05-21 11:16:51] [INFO ] Transformed 2108 transitions.
[2024-05-21 11:16:51] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 289 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 186 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Applied a total of 2 rules in 44 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2024-05-21 11:16:52] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-05-21 11:16:52] [INFO ] Computed 5 invariants in 24 ms
[2024-05-21 11:16:52] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-05-21 11:17:18] [INFO ] Deduced a trap composed of 5 places in 318 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20115 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 1/1 constraints]
After SMT, in 55133ms problems are : Problem set: 0 solved, 2105 unsolved
Search for dead transitions found 0 dead transitions in 55234ms
[2024-05-21 11:17:47] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 11:17:47] [INFO ] Invariant cache hit.
[2024-05-21 11:17:47] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 11:17:47] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 11:17:47] [INFO ] Invariant cache hit.
[2024-05-21 11:17:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 11:17:47] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 2105 sub problems to find dead transitions.
[2024-05-21 11:17:47] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 11:17:47] [INFO ] Invariant cache hit.
[2024-05-21 11:17:47] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-05-21 11:18:12] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 2 ms to minimize.
[2024-05-21 11:18:29] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 2 ms to minimize.
Problem TDEAD1148 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1423 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 7 constraints, problems are : Problem set: 26 solved, 2079 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 26 solved, 2079 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 26 solved, 2079 unsolved
Problem TDEAD1434 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1874 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD1973 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1995 is UNSAT
Problem TDEAD2006 is UNSAT
Problem TDEAD2017 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 2/7 constraints. Problems are: Problem set: 80 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 7 constraints, problems are : Problem set: 80 solved, 2025 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 2/2 constraints]
After SMT, in 74821ms problems are : Problem set: 80 solved, 2025 unsolved
Search for dead transitions found 80 dead transitions in 74855ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in LTL mode, iteration 1 : 186/188 places, 2028/2108 transitions.
Applied a total of 0 rules in 23 ms. Remains 186 /186 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 130510 ms. Remains : 186/188 places, 2028/2108 transitions.
Support contains 186 out of 186 places after structural reductions.
[2024-05-21 11:19:02] [INFO ] Flatten gal took : 191 ms
[2024-05-21 11:19:03] [INFO ] Flatten gal took : 151 ms
[2024-05-21 11:19:04] [INFO ] Input system was already deterministic with 2028 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (56 resets) in 3590 ms. (11 steps per ms) remains 4/24 properties
BEST_FIRST walk for 40003 steps (20 resets) in 176 ms. (226 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40001 steps (20 resets) in 275 ms. (144 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (21 resets) in 227 ms. (175 steps per ms) remains 2/3 properties
[2024-05-21 11:19:05] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 186 cols
[2024-05-21 11:19:05] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 11:19:05] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 174/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 367/546 variables, 179/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 21/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 9/555 variables, 7/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 630 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 186/186 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 174/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 367/546 variables, 179/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 21/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/555 variables, 7/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/555 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 186/186 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1302ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 493 ms.
Support contains 5 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2027
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2027
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 183 transition count 2026
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 181 transition count 2024
Applied a total of 9 rules in 339 ms. Remains 181 /186 variables (removed 5) and now considering 2024/2028 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 340 ms. Remains : 181/186 places, 2024/2028 transitions.
RANDOM walk for 40000 steps (80 resets) in 593 ms. (67 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (39 resets) in 277 ms. (143 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (40 resets) in 305 ms. (130 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 268797 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :1 out of 2
Probabilistic random walk after 268797 steps, saw 90193 distinct states, run finished after 3005 ms. (steps per millisecond=89 ) properties seen :1
[2024-05-21 11:19:11] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
// Phase 1: matrix 365 rows 181 cols
[2024-05-21 11:19:11] [INFO ] Computed 4 invariants in 7 ms
[2024-05-21 11:19:11] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/546 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/546 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 206 constraints, problems are : Problem set: 0 solved, 1 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 21/21 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/546 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/546 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 207 constraints, problems are : Problem set: 0 solved, 1 unsolved in 535 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 829ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 105 ms.
Support contains 4 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 2024/2024 transitions.
Applied a total of 0 rules in 175 ms. Remains 181 /181 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 181/181 places, 2024/2024 transitions.
RANDOM walk for 40000 steps (80 resets) in 661 ms. (60 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (38 resets) in 226 ms. (176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 290793 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 1
Probabilistic random walk after 290793 steps, saw 96329 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2024-05-21 11:19:15] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 11:19:15] [INFO ] Invariant cache hit.
[2024-05-21 11:19:15] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/546 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/546 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 206 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 21/21 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/546 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/546 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 207 constraints, problems are : Problem set: 0 solved, 1 unsolved in 581 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 829ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 101 ms.
Support contains 4 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 2024/2024 transitions.
Applied a total of 0 rules in 220 ms. Remains 181 /181 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 181/181 places, 2024/2024 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 2024/2024 transitions.
Applied a total of 0 rules in 147 ms. Remains 181 /181 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
[2024-05-21 11:19:16] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 11:19:16] [INFO ] Invariant cache hit.
[2024-05-21 11:19:17] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-21 11:19:17] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 11:19:17] [INFO ] Invariant cache hit.
[2024-05-21 11:19:17] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 11:19:18] [INFO ] Implicit Places using invariants and state equation in 1401 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1746 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 179/181 places, 2024/2024 transitions.
Applied a total of 0 rules in 150 ms. Remains 179 /179 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2044 ms. Remains : 179/181 places, 2024/2024 transitions.
RANDOM walk for 40000 steps (80 resets) in 621 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (40 resets) in 260 ms. (153 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 283402 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 1
Probabilistic random walk after 283402 steps, saw 91906 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
[2024-05-21 11:19:21] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
// Phase 1: matrix 365 rows 179 cols
[2024-05-21 11:19:21] [INFO ] Computed 4 invariants in 5 ms
[2024-05-21 11:19:21] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/544 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/544 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 544/544 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 21/21 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/544 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/544 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 544/544 variables, and 205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 916 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1189ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 167 ms.
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 2024/2024 transitions.
Applied a total of 0 rules in 120 ms. Remains 179 /179 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 179/179 places, 2024/2024 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 2024/2024 transitions.
Applied a total of 0 rules in 120 ms. Remains 179 /179 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
[2024-05-21 11:19:23] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 11:19:23] [INFO ] Invariant cache hit.
[2024-05-21 11:19:23] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-21 11:19:23] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 11:19:23] [INFO ] Invariant cache hit.
[2024-05-21 11:19:23] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 11:19:24] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
[2024-05-21 11:19:24] [INFO ] Redundant transitions in 106 ms returned []
Running 2021 sub problems to find dead transitions.
[2024-05-21 11:19:24] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 11:19:24] [INFO ] Invariant cache hit.
[2024-05-21 11:19:24] [INFO ] State equation strengthened by 21 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running BridgeAndVehicles-PT-V80P20N10
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 188
TRANSITIONS: 2108
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.064s, Sys 0.011s]
SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.008s, 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: 651
MODEL NAME: /home/mcc/execution/model
188 places, 2108 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 BridgeAndVehicles-PT-V80P20N10-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-00 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-01 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-02 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-03 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-04 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-05 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-06 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-07 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-08 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-09 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-10 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-11 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-12 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-13 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716292463689
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.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 LTLFireability -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
Error in allocating array of size 2097152 at unique_table.cc, line 313
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="BridgeAndVehicles-PT-V80P20N10"
export BK_EXAMINATION="LTLFireability"
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 BridgeAndVehicles-PT-V80P20N10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620397900276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V80P20N10.tgz
mv BridgeAndVehicles-PT-V80P20N10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;