About the Execution of LTSMin+red for BridgeAndVehicles-COL-V80P50N20
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16143.792 | 231581.00 | 464600.00 | 138.90 | FFTT?F?TFFFFTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620398900150.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 ltsminxred
Input is BridgeAndVehicles-COL-V80P50N20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620398900150
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 5.8K Apr 13 00:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 13 00:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 00:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 13 00:54 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.3K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 13 02:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 13 02:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 13 01:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 13 01:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:30 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 45K 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-V80P50N20-ReachabilityCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717219434495
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V80P50N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:23:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:23:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:23:55] [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-06-01 05:23:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:23:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 601 ms
[2024-06-01 05:23:56] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 198 PT places and 551698.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 05:23:56] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-06-01 05:23:56] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 16 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.3 ms
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
RANDOM walk for 40000 steps (8 resets) in 2601 ms. (15 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 142 ms. (279 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 126 ms. (314 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 177 ms. (224 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 83 ms. (476 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 90 ms. (439 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 121 ms. (327 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 258 ms. (154 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 491 ms. (81 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 587 ms. (68 steps per ms) remains 11/11 properties
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 05:23:58] [INFO ] Computed 4 invariants in 3 ms
Problem BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-01 is UNSAT
Problem BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-02 is UNSAT
Problem BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-05 is UNSAT
Problem BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-07 is UNSAT
Problem BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-10 is UNSAT
Problem BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-11 is UNSAT
Problem BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-12 is UNSAT
Problem BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-13 is UNSAT
Problem BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-15 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 4/4 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 16 constraints, problems are : Problem set: 9 solved, 2 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 3/3 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 1/4 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 2/18 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/22 variables, 0/18 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 18 constraints, problems are : Problem set: 9 solved, 2 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 2/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 383ms problems are : Problem set: 9 solved, 2 unsolved
Finished Parikh walk after 203 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=203 )
Parikh walk visited 2 properties in 45 ms.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 05:23:58] [INFO ] Flatten gal took : 11 ms
[2024-06-01 05:23:58] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 0 steps (0 resets) in 6 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 )
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-01 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-02 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-05 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-07 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-08 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-09 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-10 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-11 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-12 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-13 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-15 FALSE TECHNIQUES CPN_APPROX
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-06-01 05:23:59] [INFO ] Unfolded HLPN to a Petri net with 198 places and 3728 transitions 28830 arcs in 145 ms.
[2024-06-01 05:23:59] [INFO ] Unfolded 16 HLPN properties in 0 ms.
RANDOM walk for 40000 steps (56 resets) in 2115 ms. (18 steps per ms) remains 2/5 properties
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (18 resets) in 196 ms. (203 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (19 resets) in 265 ms. (150 steps per ms) remains 2/2 properties
[2024-06-01 05:23:59] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 198 cols
[2024-06-01 05:23:59] [INFO ] Computed 7 invariants in 15 ms
[2024-06-01 05:23:59] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 410/425 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 42/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 183/608 variables, 183/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/608 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/608 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/608 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 247 constraints, problems are : Problem set: 0 solved, 2 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 198/198 constraints, ReadFeed: 42/42 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 410/425 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 42/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 183/608 variables, 183/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/608 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/608 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/608 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/608 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 249 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1330 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 198/198 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1921ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1424 ms.
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Graph (complete) has 1962 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.24 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 195 transition count 3727
Applied a total of 3 rules in 807 ms. Remains 195 /198 variables (removed 3) and now considering 3727/3728 (removed 1) transitions.
Running 3724 sub problems to find dead transitions.
[2024-06-01 05:24:04] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2024-06-01 05:24:04] [INFO ] Computed 5 invariants in 9 ms
[2024-06-01 05:24:04] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
[2024-06-01 05:25:09] [INFO ] Deduced a trap composed of 5 places in 600 ms of which 34 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 195/604 variables, and 6 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 20149 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/195 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3724/3724 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 195/604 variables, and 6 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 20084 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/195 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3724 constraints, Known Traps: 1/1 constraints]
After SMT, in 87001ms problems are : Problem set: 0 solved, 3724 unsolved
Search for dead transitions found 0 dead transitions in 87060ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87900 ms. Remains : 195/198 places, 3727/3728 transitions.
RANDOM walk for 40000 steps (64 resets) in 1627 ms. (24 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (24 resets) in 348 ms. (114 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (24 resets) in 382 ms. (104 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 115197 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 2
Probabilistic random walk after 115197 steps, saw 33991 distinct states, run finished after 3004 ms. (steps per millisecond=38 ) properties seen :0
[2024-06-01 05:25:34] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-06-01 05:25:34] [INFO ] Invariant cache hit.
[2024-06-01 05:25:34] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 247/255 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 347/602 variables, 185/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 42/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/604 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/604 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/604 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 242 constraints, problems are : Problem set: 0 solved, 2 unsolved in 721 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 195/195 constraints, ReadFeed: 42/42 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 247/255 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 347/602 variables, 185/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 42/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/604 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/604 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/604 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 604/604 variables, and 244 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2632 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 195/195 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3471ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2632 ms.
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 860 ms. Remains 195 /195 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 860 ms. Remains : 195/195 places, 3727/3727 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 645 ms. Remains 195 /195 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2024-06-01 05:25:42] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-06-01 05:25:42] [INFO ] Invariant cache hit.
[2024-06-01 05:25:43] [INFO ] Implicit Places using invariants in 807 ms returned []
[2024-06-01 05:25:43] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-06-01 05:25:43] [INFO ] Invariant cache hit.
[2024-06-01 05:25:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 05:25:45] [INFO ] Implicit Places using invariants and state equation in 2488 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3322 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 193/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 537 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4505 ms. Remains : 193/195 places, 3727/3727 transitions.
RANDOM walk for 40000 steps (64 resets) in 934 ms. (42 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (24 resets) in 221 ms. (180 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (24 resets) in 211 ms. (188 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 192560 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 2
Probabilistic random walk after 192560 steps, saw 54763 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2024-06-01 05:25:49] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2024-06-01 05:25:49] [INFO ] Computed 5 invariants in 9 ms
[2024-06-01 05:25:49] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:25:50] [INFO ] Deduced a trap composed of 4 places in 392 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 247/255 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 345/600 variables, 183/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/600 variables, 42/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/602 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/602 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/602 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 241 constraints, problems are : Problem set: 0 solved, 2 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 193/193 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 247/255 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 345/600 variables, 183/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/600 variables, 42/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/602 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/602 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/602 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 602/602 variables, and 243 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1784 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 193/193 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2627ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 276 ms.
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 619 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 619 ms. Remains : 193/193 places, 3727/3727 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 476 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2024-06-01 05:25:53] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-06-01 05:25:53] [INFO ] Invariant cache hit.
[2024-06-01 05:25:54] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-06-01 05:25:54] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-06-01 05:25:54] [INFO ] Invariant cache hit.
[2024-06-01 05:25:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 05:25:55] [INFO ] Implicit Places using invariants and state equation in 1176 ms returned []
Implicit Place search using SMT with State Equation took 1692 ms to find 0 implicit places.
[2024-06-01 05:25:55] [INFO ] Redundant transitions in 269 ms returned []
Running 3724 sub problems to find dead transitions.
[2024-06-01 05:25:55] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-06-01 05:25:55] [INFO ] Invariant cache hit.
[2024-06-01 05:25:55] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 193/602 variables, and 5 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 30100 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/193 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3724/3724 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
[2024-06-01 05:27:23] [INFO ] Deduced a trap composed of 5 places in 535 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/602 variables, and 6 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 30096 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/193 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3724 constraints, Known Traps: 1/1 constraints]
After SMT, in 107921ms problems are : Problem set: 0 solved, 3724 unsolved
Search for dead transitions found 0 dead transitions in 107963ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110416 ms. Remains : 193/193 places, 3727/3727 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 3318 transitions
Reduce isomorphic transitions removed 3318 transitions.
Iterating post reduction 0 with 3318 rules applied. Total rules applied 3318 place count 193 transition count 409
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 3322 place count 191 transition count 407
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3324 place count 191 transition count 405
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3326 place count 189 transition count 405
Applied a total of 3326 rules in 34 ms. Remains 189 /193 variables (removed 4) and now considering 405/3727 (removed 3322) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 405 rows 189 cols
[2024-06-01 05:27:43] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:27:43] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:27:44] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 05:27:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:27:44] [INFO ] After 453ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 05:27:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 05:27:44] [INFO ] After 90ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 05:27:45] [INFO ] After 241ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 05:27:45] [INFO ] After 876ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1357 ms.
[2024-06-01 05:27:45] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-06-01 05:27:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 193 places, 3727 transitions and 28504 arcs took 24 ms.
[2024-06-01 05:27:45] [INFO ] Flatten gal took : 336 ms
Total runtime 229798 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-04
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-06
BK_STOP 1717219666076
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/609/inv_0_
rfs formula name BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/609/inv_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V80P50N20"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-COL-V80P50N20, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620398900150"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P50N20.tgz
mv BridgeAndVehicles-COL-V80P50N20 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;