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-171620397400039.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-COL-V20P10N50, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397400039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.9K Apr 13 02:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 13 02:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 13 02:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 13 02:35 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 4.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 13 03:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 13 03:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 13 03:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 41K 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-COL-V20P10N50-ReachabilityFireability-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716275438081

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V20P10N50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 07:10:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 07:10:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 07:10:39] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-21 07:10:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 07:10:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 784 ms
[2024-05-21 07:10:40] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 108 PT places and 90298.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 07:10:40] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-05-21 07:10:40] [INFO ] Skeletonized 14 HLPN properties in 1 ms.
Remains 3 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
RANDOM walk for 3733 steps (1 resets) in 60 ms. (61 steps per ms) remains 0/2 properties
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-21 07:10:40] [INFO ] Flatten gal took : 14 ms
[2024-05-21 07:10:40] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Arc [13:1*[(MOD (ADD $cpt 1) 51)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-21 07:10:40] [INFO ] Unfolded HLPN to a Petri net with 108 places and 2228 transitions 17190 arcs in 79 ms.
[2024-05-21 07:10:40] [INFO ] Unfolded 14 HLPN properties in 3 ms.
RANDOM walk for 40001 steps (229 resets) in 3280 ms. (12 steps per ms) remains 3/14 properties
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (108 resets) in 551 ms. (72 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (66 resets) in 184 ms. (216 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (64 resets) in 7294 ms. (5 steps per ms) remains 3/3 properties
[2024-05-21 07:10:44] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-05-21 07:10:44] [INFO ] Computed 7 invariants in 21 ms
[2024-05-21 07:10:44] [INFO ] State equation strengthened by 102 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-09 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 5/108 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 290/398 variables, 108/115 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 102/217 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/217 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/398 variables, 0/217 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 217 constraints, problems are : Problem set: 1 solved, 2 unsolved in 813 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 60/87 variables, 5/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 290/377 variables, 87/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 102/195 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/195 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 21/398 variables, 21/216 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 1/217 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 2/219 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/219 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/398 variables, 0/219 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 219 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1086 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 4394ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 704 ms.
Support contains 27 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Graph (complete) has 882 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 384 ms. Remains 106 /108 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
Running 2225 sub problems to find dead transitions.
[2024-05-21 07:10:49] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-05-21 07:10:49] [INFO ] Computed 5 invariants in 20 ms
[2024-05-21 07:10:49] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 07:11:18] [INFO ] Deduced a trap composed of 5 places in 612 ms of which 44 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 20072 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2225/2225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 07:11:47] [INFO ] Deduced a trap composed of 55 places in 234 ms of which 3 ms to minimize.
Problem TDEAD1188 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1341 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/396 variables, and 7 constraints, problems are : Problem set: 4 solved, 2221 unsolved in 20065 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2225 constraints, Known Traps: 2/2 constraints]
After SMT, in 60201ms problems are : Problem set: 4 solved, 2221 unsolved
Search for dead transitions found 4 dead transitions in 60233ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 106/108 places, 2224/2228 transitions.
Applied a total of 0 rules in 250 ms. Remains 106 /106 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60894 ms. Remains : 106/108 places, 2224/2228 transitions.
RANDOM walk for 40000 steps (228 resets) in 922 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (108 resets) in 517 ms. (77 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (65 resets) in 245 ms. (162 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 216537 steps, run timeout after 3008 ms. (steps per millisecond=71 ) properties seen :0 out of 2
Probabilistic random walk after 216537 steps, saw 57343 distinct states, run finished after 3012 ms. (steps per millisecond=71 ) properties seen :0
[2024-05-21 07:11:53] [INFO ] Flow matrix only has 290 transitions (discarded 1934 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-05-21 07:11:53] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 07:11:53] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 55/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 269/351 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 51/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/395 variables, 23/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 51/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/396 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/396 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 597 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 106/106 constraints, ReadFeed: 102/102 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/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 55/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 269/351 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 51/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/395 variables, 23/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 51/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/395 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/396 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/396 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1102 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 106/106 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1730ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2062 ms.
Support contains 27 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2224/2224 transitions.
Applied a total of 0 rules in 198 ms. Remains 106 /106 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 106/106 places, 2224/2224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2224/2224 transitions.
Applied a total of 0 rules in 271 ms. Remains 106 /106 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
[2024-05-21 07:11:58] [INFO ] Flow matrix only has 290 transitions (discarded 1934 similar events)
[2024-05-21 07:11:58] [INFO ] Invariant cache hit.
[2024-05-21 07:11:58] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-21 07:11:58] [INFO ] Flow matrix only has 290 transitions (discarded 1934 similar events)
[2024-05-21 07:11:58] [INFO ] Invariant cache hit.
[2024-05-21 07:11:58] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 07:11:59] [INFO ] Implicit Places using invariants and state equation in 793 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1196 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/106 places, 2224/2224 transitions.
Applied a total of 0 rules in 215 ms. Remains 104 /104 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1686 ms. Remains : 104/106 places, 2224/2224 transitions.
RANDOM walk for 40000 steps (228 resets) in 766 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (108 resets) in 507 ms. (78 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (67 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 228661 steps, run timeout after 3006 ms. (steps per millisecond=76 ) properties seen :0 out of 2
Probabilistic random walk after 228661 steps, saw 60738 distinct states, run finished after 3006 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-21 07:12:03] [INFO ] Flow matrix only has 290 transitions (discarded 1934 similar events)
// Phase 1: matrix 290 rows 104 cols
[2024-05-21 07:12:03] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 07:12:03] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 55/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 269/351 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 51/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 42/393 variables, 21/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 51/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/393 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/394 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/394 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 752 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 104/104 constraints, ReadFeed: 102/102 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/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 55/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 269/351 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 51/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 42/393 variables, 21/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 51/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/393 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/394 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/394 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1127 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 104/104 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1951ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 527 ms.
Support contains 27 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2224/2224 transitions.
Applied a total of 0 rules in 196 ms. Remains 104 /104 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 104/104 places, 2224/2224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2224/2224 transitions.
Applied a total of 0 rules in 191 ms. Remains 104 /104 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
[2024-05-21 07:12:05] [INFO ] Flow matrix only has 290 transitions (discarded 1934 similar events)
[2024-05-21 07:12:05] [INFO ] Invariant cache hit.
[2024-05-21 07:12:06] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-21 07:12:06] [INFO ] Flow matrix only has 290 transitions (discarded 1934 similar events)
[2024-05-21 07:12:06] [INFO ] Invariant cache hit.
[2024-05-21 07:12:06] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 07:12:07] [INFO ] Implicit Places using invariants and state equation in 1088 ms returned []
Implicit Place search using SMT with State Equation took 1436 ms to find 0 implicit places.
[2024-05-21 07:12:07] [INFO ] Redundant transitions in 100 ms returned []
Running 2221 sub problems to find dead transitions.
[2024-05-21 07:12:07] [INFO ] Flow matrix only has 290 transitions (discarded 1934 similar events)
[2024-05-21 07:12:07] [INFO ] Invariant cache hit.
[2024-05-21 07:12:07] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2221 unsolved
[2024-05-21 07:12:32] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 1 ms to minimize.
[2024-05-21 07:12:48] [INFO ] Deduced a trap composed of 55 places in 222 ms of which 1 ms to minimize.
Problem TDEAD1388 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1898 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/394 variables, and 7 constraints, problems are : Problem set: 11 solved, 2210 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2221/2221 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 11 solved, 2210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 11 solved, 2210 unsolved
Problem TDEAD1949 is UNSAT
Problem TDEAD2000 is UNSAT
Problem TDEAD2051 is UNSAT
Problem TDEAD2102 is UNSAT
Problem TDEAD2153 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/7 constraints. Problems are: Problem set: 16 solved, 2205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 16 solved, 2205 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 3 (OVERLAPS) 290/394 variables, 104/111 constraints. Problems are: Problem set: 18 solved, 2203 unsolved
SMT process timed out in 78384ms, After SMT, problems are : Problem set: 18 solved, 2203 unsolved
Search for dead transitions found 18 dead transitions in 78413ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/104 places, 2206/2224 transitions.
Applied a total of 0 rules in 239 ms. Remains 104 /104 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
[2024-05-21 07:13:26] [INFO ] Redundant transitions in 55 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 80463 ms. Remains : 104/104 places, 2206/2224 transitions.
RANDOM walk for 40001 steps (228 resets) in 662 ms. (60 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (108 resets) in 493 ms. (80 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (67 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 259610 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 2
Probabilistic random walk after 259610 steps, saw 68240 distinct states, run finished after 3011 ms. (steps per millisecond=86 ) properties seen :0
[2024-05-21 07:13:29] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
// Phase 1: matrix 287 rows 104 cols
[2024-05-21 07:13:29] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 07:13:29] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 55/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 267/349 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 50/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 41/390 variables, 21/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 51/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/391 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/391 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1080 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 104/104 constraints, ReadFeed: 101/101 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/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 55/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 267/349 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 50/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 41/390 variables, 21/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 51/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/391 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/391 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/391 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 950 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 104/104 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2085ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 754 ms.
Support contains 27 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2206/2206 transitions.
Applied a total of 0 rules in 226 ms. Remains 104 /104 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 104/104 places, 2206/2206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2206/2206 transitions.
Applied a total of 0 rules in 227 ms. Remains 104 /104 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
[2024-05-21 07:13:33] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-05-21 07:13:33] [INFO ] Invariant cache hit.
[2024-05-21 07:13:33] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-21 07:13:33] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-05-21 07:13:33] [INFO ] Invariant cache hit.
[2024-05-21 07:13:33] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 07:13:34] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 1016 ms to find 0 implicit places.
[2024-05-21 07:13:34] [INFO ] Redundant transitions in 100 ms returned []
Running 2203 sub problems to find dead transitions.
[2024-05-21 07:13:34] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-05-21 07:13:34] [INFO ] Invariant cache hit.
[2024-05-21 07:13:34] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2203 unsolved
[2024-05-21 07:13:57] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 1 ms to minimize.
[2024-05-21 07:13:58] [INFO ] Deduced a trap composed of 54 places in 190 ms of which 0 ms to minimize.
Problem TDEAD166 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1135 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/391 variables, and 7 constraints, problems are : Problem set: 20 solved, 2183 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2203/2203 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 20 solved, 2183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 20 solved, 2183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/7 constraints. Problems are: Problem set: 20 solved, 2183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 20 solved, 2183 unsolved
SMT process timed out in 77340ms, After SMT, problems are : Problem set: 20 solved, 2183 unsolved
Search for dead transitions found 20 dead transitions in 77362ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/104 places, 2186/2206 transitions.
Applied a total of 0 rules in 148 ms. Remains 104 /104 variables (removed 0) and now considering 2186/2186 (removed 0) transitions.
[2024-05-21 07:14:51] [INFO ] Redundant transitions in 36 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 78913 ms. Remains : 104/104 places, 2186/2206 transitions.
RANDOM walk for 40000 steps (228 resets) in 468 ms. (85 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (108 resets) in 239 ms. (166 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (66 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 241118 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 2
Probabilistic random walk after 241118 steps, saw 63710 distinct states, run finished after 3002 ms. (steps per millisecond=80 ) properties seen :0
[2024-05-21 07:14:54] [INFO ] Flow matrix only has 286 transitions (discarded 1900 similar events)
// Phase 1: matrix 286 rows 104 cols
[2024-05-21 07:14:54] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 07:14:55] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 55/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 266/348 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 50/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 41/389 variables, 21/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 50/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-06 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 11 (OVERLAPS) 1/390 variables, 1/209 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 0/209 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/390 variables, 0/209 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 209 constraints, problems are : Problem set: 1 solved, 1 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 104/104 constraints, ReadFeed: 100/100 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/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/45 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 290/335 variables, 46/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 2/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 100/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 1/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/337 variables, 1/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 2/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 53/390 variables, 53/209 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 1/210 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/390 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 210 constraints, problems are : Problem set: 1 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 104/104 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 948ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2186/2186 transitions.
Applied a total of 0 rules in 205 ms. Remains 104 /104 variables (removed 0) and now considering 2186/2186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 104/104 places, 2186/2186 transitions.
RANDOM walk for 40002 steps (228 resets) in 459 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (65 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 342181 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 342181 steps, saw 88162 distinct states, run finished after 3002 ms. (steps per millisecond=113 ) properties seen :0
[2024-05-21 07:14:59] [INFO ] Flow matrix only has 286 transitions (discarded 1900 similar events)
[2024-05-21 07:14:59] [INFO ] Invariant cache hit.
[2024-05-21 07:14:59] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/45 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 290/335 variables, 46/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 100/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/337 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 53/390 variables, 53/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/390 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 104/104 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/45 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 290/335 variables, 46/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 100/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/337 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 53/390 variables, 53/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/390 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 104/104 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 569ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2186/2186 transitions.
Applied a total of 0 rules in 170 ms. Remains 104 /104 variables (removed 0) and now considering 2186/2186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 104/104 places, 2186/2186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2186/2186 transitions.
Applied a total of 0 rules in 272 ms. Remains 104 /104 variables (removed 0) and now considering 2186/2186 (removed 0) transitions.
[2024-05-21 07:15:00] [INFO ] Flow matrix only has 286 transitions (discarded 1900 similar events)
[2024-05-21 07:15:00] [INFO ] Invariant cache hit.
[2024-05-21 07:15:00] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-21 07:15:00] [INFO ] Flow matrix only has 286 transitions (discarded 1900 similar events)
[2024-05-21 07:15:00] [INFO ] Invariant cache hit.
[2024-05-21 07:15:00] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-21 07:15:02] [INFO ] Implicit Places using invariants and state equation in 1786 ms returned []
Implicit Place search using SMT with State Equation took 2066 ms to find 0 implicit places.
[2024-05-21 07:15:02] [INFO ] Redundant transitions in 54 ms returned []
Running 2183 sub problems to find dead transitions.
[2024-05-21 07:15:02] [INFO ] Flow matrix only has 286 transitions (discarded 1900 similar events)
[2024-05-21 07:15:02] [INFO ] Invariant cache hit.
[2024-05-21 07:15:02] [INFO ] State equation strengthened by 100 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-COL-V20P10N50

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 15
TRANSITIONS: 11
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 4
COLOR VARS: 4
ARCS: 56
LOADING TIME: 0.212

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 108
TRANSITIONS: 2228
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 17190
UNFOLDING TIME: 2.876

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.102
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 3.417
OK.
----------------------------------------------------------------------
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: 719
MODEL NAME: /home/mcc/execution/model
108 places, 2228 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-COL-V20P10N50-ReachabilityFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-00 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-01 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-02 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-04 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-05 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-11 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-2024-13 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716277660863

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
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-COL-V20P10N50"
export BK_EXAMINATION="ReachabilityFireability"
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-COL-V20P10N50, examination is ReachabilityFireability"
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-171620397400039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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