Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399100235.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 itstools
Input is BridgeAndVehicles-PT-V50P20N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399100235
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.2M
-rw-r--r-- 1 mcc users 25K Apr 13 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 13 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 226K Apr 13 00:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 875K Apr 13 00:50 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 11K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 68K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 195K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 13 01:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 01:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 723K Apr 13 01:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.8M Apr 13 01:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:29 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.9M 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-V50P20N20-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716328995411

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P20N20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 22:03:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:03:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:03:16] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2024-05-21 22:03:16] [INFO ] Transformed 138 places.
[2024-05-21 22:03:16] [INFO ] Transformed 2348 transitions.
[2024-05-21 22:03:16] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 312 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 55 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-05-21 22:03:17] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-05-21 22:03:17] [INFO ] Computed 7 invariants in 31 ms
[2024-05-21 22:03:17] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 22:03:42] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/428 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20118 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 22:04:14] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 2 ms to minimize.
SMT process timed out in 56717ms, After SMT, problems are : Problem set: 0 solved, 2345 unsolved
Search for dead transitions found 0 dead transitions in 56778ms
[2024-05-21 22:04:14] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 22:04:14] [INFO ] Invariant cache hit.
[2024-05-21 22:04:14] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-21 22:04:14] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 22:04:14] [INFO ] Invariant cache hit.
[2024-05-21 22:04:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:04:15] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 1166 ms to find 0 implicit places.
Running 2345 sub problems to find dead transitions.
[2024-05-21 22:04:15] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 22:04:15] [INFO ] Invariant cache hit.
[2024-05-21 22:04:15] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 22:04:41] [INFO ] Deduced a trap composed of 5 places in 328 ms of which 3 ms to minimize.
[2024-05-21 22:04:58] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 1 ms to minimize.
Problem TDEAD1248 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1710 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/428 variables, and 7 constraints, problems are : Problem set: 23 solved, 2322 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 23 solved, 2322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 23 solved, 2322 unsolved
Problem TDEAD1731 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD1983 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2025 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2067 is UNSAT
Problem TDEAD2088 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2130 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2235 is UNSAT
Problem TDEAD2256 is UNSAT
Problem TDEAD2277 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 2/7 constraints. Problems are: Problem set: 50 solved, 2295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 50 solved, 2295 unsolved
SMT process timed out in 78739ms, After SMT, problems are : Problem set: 50 solved, 2295 unsolved
Search for dead transitions found 50 dead transitions in 78769ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 138/138 places, 2298/2348 transitions.
Applied a total of 0 rules in 14 ms. Remains 138 /138 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136860 ms. Remains : 138/138 places, 2298/2348 transitions.
Support contains 14 out of 138 places after structural reductions.
[2024-05-21 22:05:34] [INFO ] Flatten gal took : 175 ms
[2024-05-21 22:05:34] [INFO ] Flatten gal took : 131 ms
[2024-05-21 22:05:34] [INFO ] Input system was already deterministic with 2298 transitions.
RANDOM walk for 40000 steps (92 resets) in 2624 ms. (15 steps per ms) remains 3/18 properties
BEST_FIRST walk for 40002 steps (32 resets) in 242 ms. (164 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (44 resets) in 234 ms. (170 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (32 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
[2024-05-21 22:05:35] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 138 cols
[2024-05-21 22:05:35] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 22:05:35] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/15 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 289/304 variables, 15/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 41/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 123/427 variables, 123/183 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 3/186 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/427 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 186 constraints, problems are : Problem set: 1 solved, 1 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/15 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 289/304 variables, 15/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 41/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 123/427 variables, 123/183 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 3/186 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 1/187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/427 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 187 constraints, problems are : Problem set: 1 solved, 1 unsolved in 679 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 909ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2298/2298 transitions.
Graph (complete) has 1301 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 294 ms. Remains 136 /138 variables (removed 2) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-05-21 22:05:37] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 136 cols
[2024-05-21 22:05:37] [INFO ] Computed 5 invariants in 6 ms
[2024-05-21 22:05:37] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-05-21 22:06:02] [INFO ] Deduced a trap composed of 5 places in 304 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20086 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 57287ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 57310ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57611 ms. Remains : 136/138 places, 2298/2298 transitions.
RANDOM walk for 40002 steps (92 resets) in 460 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (32 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 332664 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 332664 steps, saw 88593 distinct states, run finished after 3005 ms. (steps per millisecond=110 ) properties seen :0
[2024-05-21 22:06:37] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 22:06:37] [INFO ] Invariant cache hit.
[2024-05-21 22:06:37] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 187/196 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 227/423 variables, 125/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 41/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/425 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/425 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 182 constraints, problems are : Problem set: 0 solved, 1 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 41/41 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 187/196 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 227/423 variables, 125/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 41/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/425 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/425 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 183 constraints, problems are : Problem set: 0 solved, 1 unsolved in 508 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 691ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 460 ms.
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 257 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 ms. Remains : 136/136 places, 2298/2298 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 209 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
[2024-05-21 22:06:39] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 22:06:39] [INFO ] Invariant cache hit.
[2024-05-21 22:06:39] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-21 22:06:39] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 22:06:39] [INFO ] Invariant cache hit.
[2024-05-21 22:06:39] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 22:06:40] [INFO ] Implicit Places using invariants and state equation in 681 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1013 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 134/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 310 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1534 ms. Remains : 134/136 places, 2298/2298 transitions.
RANDOM walk for 40001 steps (92 resets) in 398 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (32 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 344040 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 344040 steps, saw 91570 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
[2024-05-21 22:06:43] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 134 cols
[2024-05-21 22:06:43] [INFO ] Computed 5 invariants in 12 ms
[2024-05-21 22:06:43] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 187/196 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 225/421 variables, 123/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 41/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/423 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/423 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 180 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 41/41 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 187/196 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 225/421 variables, 123/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 41/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/423 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/423 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 732ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 926 ms.
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 184 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 134/134 places, 2298/2298 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 190 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
[2024-05-21 22:06:45] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 22:06:45] [INFO ] Invariant cache hit.
[2024-05-21 22:06:46] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-21 22:06:46] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 22:06:46] [INFO ] Invariant cache hit.
[2024-05-21 22:06:46] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 22:06:46] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
[2024-05-21 22:06:47] [INFO ] Redundant transitions in 112 ms returned []
Running 2295 sub problems to find dead transitions.
[2024-05-21 22:06:47] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 22:06:47] [INFO ] Invariant cache hit.
[2024-05-21 22:06:47] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-05-21 22:07:14] [INFO ] Deduced a trap composed of 5 places in 300 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 78964ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 78995ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80371 ms. Remains : 134/134 places, 2298/2298 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 3798 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.23 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2298/2298 transitions.
Graph (complete) has 3798 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 135 transition count 2297
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 133 transition count 2296
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 131 transition count 2294
Applied a total of 10 rules in 727 ms. Remains 131 /138 variables (removed 7) and now considering 2294/2298 (removed 4) transitions.
[2024-05-21 22:08:07] [INFO ] Flow matrix only has 285 transitions (discarded 2009 similar events)
// Phase 1: matrix 285 rows 131 cols
[2024-05-21 22:08:07] [INFO ] Computed 4 invariants in 4 ms
[2024-05-21 22:08:07] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-21 22:08:07] [INFO ] Flow matrix only has 285 transitions (discarded 2009 similar events)
[2024-05-21 22:08:07] [INFO ] Invariant cache hit.
[2024-05-21 22:08:07] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 22:08:08] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1411 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/138 places, 2294/2298 transitions.
Applied a total of 0 rules in 220 ms. Remains 129 /129 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2358 ms. Remains : 129/138 places, 2294/2298 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLCardinality-00
Stuttering criterion allowed to conclude after 309 steps with 0 reset in 9 ms.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLCardinality-00 finished in 2605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2298/2298 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2297
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2297
Applied a total of 4 rules in 22 ms. Remains 135 /138 variables (removed 3) and now considering 2297/2298 (removed 1) transitions.
Running 2294 sub problems to find dead transitions.
[2024-05-21 22:08:09] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 135 cols
[2024-05-21 22:08:09] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 22:08:09] [INFO ] State equation strengthened by 41 read => feed constraints.

BK_STOP 1716329296212

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-V50P20N20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BridgeAndVehicles-PT-V50P20N20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399100235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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