Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r464-smll-171620118100217.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is AirplaneLD-COL-1000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118100217
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 9.1K Apr 12 04:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 12 04:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 04:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 04:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 06:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 12 06:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 05:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 05:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 181K 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 AirplaneLD-COL-1000-CTLCardinality-2024-00
FORMULA_NAME AirplaneLD-COL-1000-CTLCardinality-2024-01
FORMULA_NAME AirplaneLD-COL-1000-CTLCardinality-2024-02
FORMULA_NAME AirplaneLD-COL-1000-CTLCardinality-2024-03
FORMULA_NAME AirplaneLD-COL-1000-CTLCardinality-2024-04
FORMULA_NAME AirplaneLD-COL-1000-CTLCardinality-2024-05
FORMULA_NAME AirplaneLD-COL-1000-CTLCardinality-2024-06
FORMULA_NAME AirplaneLD-COL-1000-CTLCardinality-2024-07
FORMULA_NAME AirplaneLD-COL-1000-CTLCardinality-2024-08
FORMULA_NAME AirplaneLD-COL-1000-CTLCardinality-2024-09
FORMULA_NAME AirplaneLD-COL-1000-CTLCardinality-2024-10
FORMULA_NAME AirplaneLD-COL-1000-CTLCardinality-2024-11
FORMULA_NAME AirplaneLD-COL-1000-CTLCardinality-2024-12
FORMULA_NAME AirplaneLD-COL-1000-CTLCardinality-2024-13
FORMULA_NAME AirplaneLD-COL-1000-CTLCardinality-2024-14
FORMULA_NAME AirplaneLD-COL-1000-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717249115696

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-COL-1000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:38:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:38:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:38:38] [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 13:38:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:38:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1295 ms
[2024-06-01 13:38:39] [INFO ] Detected 3 constant HL places corresponding to 3002 PT places.
[2024-06-01 13:38:39] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 7019 PT places and 12012.0 transition bindings in 41 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 35 ms.
[2024-06-01 13:38:39] [INFO ] Built PT skeleton of HLPN with 20 places and 15 transitions 56 arcs in 6 ms.
[2024-06-01 13:38:39] [INFO ] Skeletonized 16 HLPN properties in 6 ms.
Computed a total of 20 stabilizing places and 15 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 15
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA AirplaneLD-COL-1000-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 15 properties that can be checked using skeleton over-approximation.
Initial state reduction rules removed 1 formulas.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA AirplaneLD-COL-1000-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 17 stabilizing places and 14 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 14
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40000 steps (5038 resets) in 3380 ms. (11 steps per ms) remains 65/85 properties
BEST_FIRST walk for 4003 steps (115 resets) in 45 ms. (87 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (137 resets) in 102 ms. (38 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (158 resets) in 59 ms. (66 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (129 resets) in 48 ms. (81 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (133 resets) in 46 ms. (85 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (136 resets) in 42 ms. (93 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (133 resets) in 38 ms. (102 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (153 resets) in 39 ms. (100 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (155 resets) in 27 ms. (142 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (140 resets) in 36 ms. (108 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (154 resets) in 46 ms. (85 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (140 resets) in 31 ms. (125 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (141 resets) in 20 ms. (190 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (136 resets) in 32 ms. (121 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (157 resets) in 114 ms. (34 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (134 resets) in 20 ms. (190 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (153 resets) in 22 ms. (174 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (132 resets) in 58 ms. (67 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (124 resets) in 23 ms. (166 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (140 resets) in 21 ms. (181 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (140 resets) in 21 ms. (181 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (119 resets) in 25 ms. (153 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (133 resets) in 19 ms. (200 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (141 resets) in 20 ms. (190 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (130 resets) in 25 ms. (153 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (113 resets) in 18 ms. (210 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (139 resets) in 22 ms. (174 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (137 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (154 resets) in 21 ms. (181 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (157 resets) in 18 ms. (210 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (138 resets) in 21 ms. (181 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (158 resets) in 20 ms. (190 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (135 resets) in 27 ms. (143 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (138 resets) in 23 ms. (166 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (121 resets) in 22 ms. (174 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (156 resets) in 21 ms. (181 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (130 resets) in 21 ms. (181 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (130 resets) in 19 ms. (200 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (136 resets) in 21 ms. (181 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (139 resets) in 22 ms. (174 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (157 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (133 resets) in 28 ms. (138 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (130 resets) in 40 ms. (97 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (138 resets) in 36 ms. (108 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (135 resets) in 31 ms. (125 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (138 resets) in 23 ms. (166 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (136 resets) in 22 ms. (173 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (137 resets) in 31 ms. (125 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (138 resets) in 26 ms. (148 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (157 resets) in 23 ms. (166 steps per ms) remains 65/65 properties
// Phase 1: matrix 14 rows 17 cols
[2024-06-01 13:38:41] [INFO ] Computed 3 invariants in 13 ms
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp82 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 41 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 1/3 constraints. Problems are: Problem set: 29 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 29 solved, 36 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp83 is UNSAT
After SMT solving in domain Real declared 31/31 variables, and 20 constraints, problems are : Problem set: 65 solved, 0 unsolved in 760 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 868ms problems are : Problem set: 65 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 65 atomic propositions for a total of 14 simplifications.
FORMULA AirplaneLD-COL-1000-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:38:42] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-06-01 13:38:42] [INFO ] Flatten gal took : 35 ms
[2024-06-01 13:38:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AirplaneLD-COL-1000-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-1000-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-1000-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-1000-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-1000-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:38:42] [INFO ] Flatten gal took : 8 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Altitude
Symmetric sort wr.t. initial detected :Altitude
Transition t3_2 : guard parameter $A(Altitude:2000) in guard (OR (GEQ $A 999) (EQ $A 1999))introduces in Altitude(2000) partition with 2 elements
Transition t3_1 : guard parameter $A(Altitude:2000) in guard (AND (LT $A 999) (NEQ $A 1999))introduces in Altitude(2000) partition with 2 elements
Sort wr.t. initial and guards Altitude has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Altitude domain size was 2000 reducing to 2 values.
For transition t3_2:(OR (GEQ $A 999) (EQ $A 1999)) -> (EQ $A 1)
For transition t3_1:(AND (LT $A 999) (NEQ $A 1999)) -> (EQ $A 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Speed
Symmetric sort wr.t. initial detected :Speed
Transition t5_2 : guard parameter $S(Speed:1000) in guard (OR (LEQ $S 499) (EQ $S 999))introduces in Speed(1000) partition with 2 elements
Transition t5_1 : guard parameter $S(Speed:1000) in guard (AND (GT $S 499) (NEQ $S 999))introduces in Speed(1000) partition with 2 elements
Transition t4_2 : guard parameter $S(Speed:1000) in guard (OR (LEQ $S 499) (EQ $S 999))introduces in Speed(1000) partition with 2 elements
Transition t4_1 : guard parameter $S(Speed:1000) in guard (AND (GT $S 499) (NEQ $S 999))introduces in Speed(1000) partition with 2 elements
Sort wr.t. initial and guards Speed has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Speed domain size was 1000 reducing to 2 values.
For transition t5_2:(OR (LEQ $S 499) (EQ $S 999)) -> (EQ $S 1)
For transition t5_1:(AND (GT $S 499) (NEQ $S 999)) -> (EQ $S 0)
For transition t4_2:(OR (LEQ $S 499) (EQ $S 999)) -> (EQ $S 1)
For transition t4_1:(AND (GT $S 499) (NEQ $S 999)) -> (EQ $S 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Signal
Arc [19:1*[1]] contains constants of sort Signal
Transition t5_2 : constants on arcs in [[19:1*[1]]] introduces in Signal(2) partition with 1 elements that refines current partition to 2 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :Weight
Symmetric sort wr.t. initial detected :Weight
Transition t2_2 : guard parameter $W(Weight:2) in guard (EQ $W 1)introduces in Weight(2) partition with 2 elements
[2024-06-01 13:38:42] [INFO ] Unfolded HLPN to a Petri net with 29 places and 20 transitions 56 arcs in 133 ms.
[2024-06-01 13:38:42] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Reduce places removed 6 places and 0 transitions.
Support contains 23 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Applied a total of 0 rules in 9 ms. Remains 23 /23 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 23 cols
[2024-06-01 13:38:43] [INFO ] Computed 3 invariants in 8 ms
[2024-06-01 13:38:43] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-01 13:38:43] [INFO ] Invariant cache hit.
[2024-06-01 13:38:43] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-06-01 13:38:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 3/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1/19 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 20/39 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 4/43 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 26 constraints, problems are : Problem set: 0 solved, 10 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 3/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1/19 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 20/39 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 4/43 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 36 constraints, problems are : Problem set: 0 solved, 10 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 742ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 746ms
Finished structural reductions in LTL mode , in 1 iterations and 980 ms. Remains : 23/23 places, 20/20 transitions.
Support contains 23 out of 23 places after structural reductions.
[2024-06-01 13:38:43] [INFO ] Flatten gal took : 9 ms
[2024-06-01 13:38:43] [INFO ] Flatten gal took : 8 ms
[2024-06-01 13:38:44] [INFO ] Input system was already deterministic with 20 transitions.
RANDOM walk for 40000 steps (5031 resets) in 1377 ms. (29 steps per ms) remains 26/34 properties
BEST_FIRST walk for 4004 steps (92 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (91 resets) in 42 ms. (93 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (85 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (96 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (97 resets) in 37 ms. (105 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (92 resets) in 42 ms. (93 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (96 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (88 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (96 resets) in 27 ms. (143 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (87 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (92 resets) in 40 ms. (97 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (97 resets) in 33 ms. (117 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (86 resets) in 37 ms. (105 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (104 resets) in 39 ms. (100 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (93 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (104 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (88 resets) in 41 ms. (95 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (94 resets) in 41 ms. (95 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (96 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (92 resets) in 45 ms. (87 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (97 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (93 resets) in 31 ms. (125 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (96 resets) in 45 ms. (87 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (96 resets) in 41 ms. (95 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (93 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (87 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
[2024-06-01 13:38:44] [INFO ] Invariant cache hit.
Problem AtomicPropp16 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 25 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/21 variables, 2/3 constraints. Problems are: Problem set: 13 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 13 solved, 13 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
After SMT solving in domain Real declared 41/43 variables, and 24 constraints, problems are : Problem set: 26 solved, 0 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/23 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 219ms problems are : Problem set: 26 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 26 atomic propositions for a total of 8 simplifications.
[2024-06-01 13:38:45] [INFO ] Flatten gal took : 4 ms
[2024-06-01 13:38:45] [INFO ] Flatten gal took : 4 ms
[2024-06-01 13:38:45] [INFO ] Input system was already deterministic with 20 transitions.
Support contains 13 out of 23 places (down from 17) after GAL structural reductions.
FORMULA AirplaneLD-COL-1000-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 23 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 20
Applied a total of 1 rules in 7 ms. Remains 22 /23 variables (removed 1) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 22/23 places, 20/20 transitions.
[2024-06-01 13:38:45] [INFO ] Flatten gal took : 4 ms
[2024-06-01 13:38:45] [INFO ] Flatten gal took : 4 ms
[2024-06-01 13:38:45] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Graph (complete) has 41 edges and 23 vertex of which 20 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 19 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 19 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 19 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 18 transition count 17
Applied a total of 6 rules in 20 ms. Remains 18 /23 variables (removed 5) and now considering 17/20 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 18/23 places, 17/20 transitions.
[2024-06-01 13:38:45] [INFO ] Flatten gal took : 3 ms
[2024-06-01 13:38:45] [INFO ] Flatten gal took : 2 ms
[2024-06-01 13:38:45] [INFO ] Input system was already deterministic with 17 transitions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 19 transition count 18
Applied a total of 6 rules in 2 ms. Remains 19 /23 variables (removed 4) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 19/23 places, 18/20 transitions.
[2024-06-01 13:38:45] [INFO ] Flatten gal took : 2 ms
[2024-06-01 13:38:45] [INFO ] Flatten gal took : 2 ms
[2024-06-01 13:38:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 19 transition count 18
Applied a total of 6 rules in 1 ms. Remains 19 /23 variables (removed 4) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 19/23 places, 18/20 transitions.
[2024-06-01 13:38:45] [INFO ] Flatten gal took : 2 ms
[2024-06-01 13:38:45] [INFO ] Flatten gal took : 3 ms
[2024-06-01 13:38:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 19 transition count 18
Applied a total of 6 rules in 1 ms. Remains 19 /23 variables (removed 4) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 19/23 places, 18/20 transitions.
[2024-06-01 13:38:45] [INFO ] Flatten gal took : 2 ms
[2024-06-01 13:38:45] [INFO ] Flatten gal took : 2 ms
[2024-06-01 13:38:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Graph (complete) has 41 edges and 23 vertex of which 8 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 7 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 6 transition count 5
Applied a total of 6 rules in 5 ms. Remains 6 /23 variables (removed 17) and now considering 5/20 (removed 15) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 6/23 places, 5/20 transitions.
[2024-06-01 13:38:45] [INFO ] Flatten gal took : 1 ms
[2024-06-01 13:38:45] [INFO ] Flatten gal took : 1 ms
[2024-06-01 13:38:45] [INFO ] Input system was already deterministic with 5 transitions.
RANDOM walk for 11 steps (1 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
FORMULA AirplaneLD-COL-1000-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 19 transition count 18
Applied a total of 6 rules in 1 ms. Remains 19 /23 variables (removed 4) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 19/23 places, 18/20 transitions.
[2024-06-01 13:38:45] [INFO ] Flatten gal took : 2 ms
[2024-06-01 13:38:45] [INFO ] Flatten gal took : 3 ms
[2024-06-01 13:38:45] [INFO ] Input system was already deterministic with 18 transitions.
[2024-06-01 13:38:45] [INFO ] Flatten gal took : 3 ms
[2024-06-01 13:38:45] [INFO ] Flatten gal took : 3 ms
[2024-06-01 13:38:45] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-01 13:38:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 23 places, 20 transitions and 56 arcs took 2 ms.
Total runtime 7220 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : AirplaneLD-COL-1000-CTLCardinality-2024-00
Could not compute solution for formula : AirplaneLD-COL-1000-CTLCardinality-2024-02
Could not compute solution for formula : AirplaneLD-COL-1000-CTLCardinality-2024-04
Could not compute solution for formula : AirplaneLD-COL-1000-CTLCardinality-2024-05
Could not compute solution for formula : AirplaneLD-COL-1000-CTLCardinality-2024-06
Could not compute solution for formula : AirplaneLD-COL-1000-CTLCardinality-2024-13

BK_STOP 1717249125766

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name AirplaneLD-COL-1000-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/512/ctl_0_
ctl formula name AirplaneLD-COL-1000-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/512/ctl_1_
ctl formula name AirplaneLD-COL-1000-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/512/ctl_2_
ctl formula name AirplaneLD-COL-1000-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/512/ctl_3_
ctl formula name AirplaneLD-COL-1000-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/512/ctl_4_
ctl formula name AirplaneLD-COL-1000-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/512/ctl_5_
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="AirplaneLD-COL-1000"
export BK_EXAMINATION="CTLCardinality"
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 AirplaneLD-COL-1000, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620118100217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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