About the Execution of LTSMin+red for PolyORBNT-COL-S10J30
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3060.964 | 73285.00 | 106002.00 | 47.90 | TTFFFTFTFTTTTFTF | 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.r516-tajo-171654447100414.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 PolyORBNT-COL-S10J30, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447100414
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.9K Apr 12 11:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 11:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 11:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 11:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 13:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 13:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K May 18 16:43 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 PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717259092175
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J30
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:24:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:24:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:24:53] [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 16:24:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 16:24:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 600 ms
[2024-06-01 16:24:54] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 16:24:54] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2024-06-01 16:24:54] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40018 steps (2277 resets) in 1515 ms. (26 steps per ms) remains 13/16 properties
BEST_FIRST walk for 40002 steps (779 resets) in 297 ms. (134 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40001 steps (766 resets) in 168 ms. (236 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (952 resets) in 175 ms. (227 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (706 resets) in 384 ms. (103 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (793 resets) in 203 ms. (196 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (806 resets) in 747 ms. (53 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (977 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (798 resets) in 157 ms. (253 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (768 resets) in 153 ms. (259 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (782 resets) in 162 ms. (245 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (786 resets) in 107 ms. (370 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (784 resets) in 146 ms. (272 steps per ms) remains 12/12 properties
// Phase 1: matrix 38 rows 48 cols
[2024-06-01 16:24:55] [INFO ] Computed 13 invariants in 5 ms
[2024-06-01 16:24:55] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-03 is UNSAT
Problem PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-06 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 5/10 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-02 is UNSAT
Problem PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-10 is UNSAT
Problem PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-11 is UNSAT
Problem PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-12 is UNSAT
Problem PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-13 is UNSAT
Problem PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-14 is UNSAT
At refinement iteration 3 (OVERLAPS) 1/48 variables, 1/11 constraints. Problems are: Problem set: 8 solved, 4 unsolved
Problem PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-00 is UNSAT
Problem PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-07 is UNSAT
Problem PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-08 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 2/13 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 11 solved, 1 unsolved
Problem PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-04 is UNSAT
After SMT solving in domain Real declared 86/86 variables, and 61 constraints, problems are : Problem set: 12 solved, 0 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 317ms problems are : Problem set: 12 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 16:24:56] [INFO ] Flatten gal took : 16 ms
[2024-06-01 16:24:56] [INFO ] Flatten gal took : 5 ms
RANDOM walk for 0 steps (0 resets) in 4 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 PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-00 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-02 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-03 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-04 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-06 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-07 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-08 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-10 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-11 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-12 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-13 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-14 TRUE TECHNIQUES CPN_APPROX
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 16:24:56] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 217 ms.
[2024-06-01 16:24:56] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Deduced a syphon composed of 30 places in 21 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
RANDOM walk for 40000 steps (2235 resets) in 1443 ms. (27 steps per ms) remains 2/4 properties
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (420 resets) in 283 ms. (140 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (411 resets) in 400 ms. (99 steps per ms) remains 2/2 properties
[2024-06-01 16:24:57] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2024-06-01 16:24:57] [INFO ] Computed 92 invariants in 73 ms
[2024-06-01 16:24:57] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 214/656 variables, 74/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/656 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/656 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/658 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/663 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1931/2594 variables, 663/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2594 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2594 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/2595 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2595 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2595 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2595/2595 variables, and 757 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1430 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 664/664 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 214/656 variables, 74/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/656 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/656 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/658 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/663 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1931/2594 variables, 663/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2594 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2594 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/2595 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2595 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2595 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2595/2595 variables, and 757 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2350 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 664/664 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4093ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 41 ms.
Support contains 442 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 654 transition count 1937
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 16 place count 651 transition count 1937
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 651 transition count 1935
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 649 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 648 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 648 transition count 1934
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 646 transition count 1932
Applied a total of 26 rules in 356 ms. Remains 646 /664 variables (removed 18) and now considering 1932/1940 (removed 8) transitions.
Running 1921 sub problems to find dead transitions.
[2024-06-01 16:25:01] [INFO ] Flow matrix only has 1923 transitions (discarded 9 similar events)
// Phase 1: matrix 1923 rows 646 cols
[2024-06-01 16:25:01] [INFO ] Computed 82 invariants in 77 ms
[2024-06-01 16:25:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/635 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1921 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/635 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1921 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 2.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 (/ 2.0 3.0))
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 (/ 1.0 3.0))
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 (/ 1.0 3.0))
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 (/ 2.0 3.0))
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 4.0)
(s199 4.0)
(s200 4.0)
(s201 4.0)
(s202 4.0)
(s203 4.0)
(s204 4.0)
(s205 4.0)
(s206 4.0)
(s207 4.0)
(s208 9.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 1.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 1.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 1.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 1.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s574 1.0)
(s575 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 635/2569 variables, and 71 constraints, problems are : Problem set: 0 solved, 1921 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/646 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1921/921 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1921 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/635 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1921 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/635 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1921 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 635/2569 variables, and 71 constraints, problems are : Problem set: 0 solved, 1921 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/646 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/921 constraints, Known Traps: 0/0 constraints]
After SMT, in 57336ms problems are : Problem set: 0 solved, 1921 unsolved
Search for dead transitions found 0 dead transitions in 57371ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57756 ms. Remains : 646/664 places, 1932/1940 transitions.
RANDOM walk for 40000 steps (2374 resets) in 995 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (420 resets) in 277 ms. (143 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (422 resets) in 438 ms. (91 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 202958 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 2
Probabilistic random walk after 202958 steps, saw 60808 distinct states, run finished after 3004 ms. (steps per millisecond=67 ) properties seen :0
[2024-06-01 16:26:02] [INFO ] Flow matrix only has 1923 transitions (discarded 9 similar events)
[2024-06-01 16:26:02] [INFO ] Invariant cache hit.
[2024-06-01 16:26:02] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 198/640 variables, 65/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/642 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/645 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1923/2568 variables, 645/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2568 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2568 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/2569 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2569 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2569 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2569/2569 variables, and 729 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1077 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 646/646 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 198/640 variables, 65/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/642 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/645 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1923/2568 variables, 645/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2568 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2568 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/2569 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2569 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2569 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2569/2569 variables, and 729 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1277 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 646/646 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2454ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 39 ms.
Support contains 386 out of 646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 646/646 places, 1932/1932 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 646 transition count 1899
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 613 transition count 1899
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 66 place count 613 transition count 1866
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 132 place count 580 transition count 1866
Applied a total of 132 rules in 135 ms. Remains 580 /646 variables (removed 66) and now considering 1866/1932 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 580/646 places, 1866/1932 transitions.
RANDOM walk for 2318 steps (171 resets) in 67 ms. (34 steps per ms) remains 0/1 properties
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 71940 ms.
ITS solved all properties within timeout
BK_STOP 1717259165460
--------------------
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
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="PolyORBNT-COL-S10J30"
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 PolyORBNT-COL-S10J30, 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 r516-tajo-171654447100414"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J30.tgz
mv PolyORBNT-COL-S10J30 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 ;