Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853728500057.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is AirplaneLD-COL-2000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853728500057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 328K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2025-00
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2025-01
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2025-02
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2025-03
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2025-04
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2025-05
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2025-06
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2025-07
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2025-08
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2025-09
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2025-10
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2025-11
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2025-12
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2025-13
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2025-14
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748538793703

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-COL-2000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202505121319
[2025-05-29 17:13:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 17:13:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:13:15] [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.
[2025-05-29 17:13:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-05-29 17:13:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 676 ms
[2025-05-29 17:13:15] [INFO ] Detected 3 constant HL places corresponding to 6002 PT places.
[2025-05-29 17:13:15] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 14019 PT places and 24012.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
[2025-05-29 17:13:15] [INFO ] Built PT skeleton of HLPN with 20 places and 15 transitions 56 arcs in 5 ms.
[2025-05-29 17:13:15] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA AirplaneLD-COL-2000-CTLCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 1 formulas.
FORMULA AirplaneLD-COL-2000-CTLCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 14 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA AirplaneLD-COL-2000-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-2025-09 FALSE 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 (5063 resets) in 1447 ms. (27 steps per ms) remains 39/51 properties
BEST_FIRST walk for 4003 steps (139 resets) in 51 ms. (76 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (153 resets) in 57 ms. (69 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (131 resets) in 37 ms. (105 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (159 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (132 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (141 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (135 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (138 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (159 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (132 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (134 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (134 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (131 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (140 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (127 resets) in 32 ms. (121 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (153 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (127 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (130 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (134 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (121 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (133 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (120 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (141 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (132 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (133 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (135 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (113 resets) in 13 ms. (286 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (131 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (126 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (157 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (137 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (130 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (112 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (133 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (136 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (152 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (109 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (135 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (172 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
// Phase 1: matrix 14 rows 17 cols
[2025-05-29 17:13:16] [INFO ] Computed 3 invariants in 13 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 2/2 constraints. Problems are: Problem set: 22 solved, 17 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp37 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 15 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp42 is UNSAT
After SMT solving in domain Real declared 31/31 variables, and 20 constraints, problems are : Problem set: 39 solved, 0 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 465ms problems are : Problem set: 39 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 39 atomic propositions for a total of 11 simplifications.
FORMULA AirplaneLD-COL-2000-CTLCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 17:13:17] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2025-05-29 17:13:17] [INFO ] Flatten gal took : 20 ms
FORMULA AirplaneLD-COL-2000-CTLCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 17:13:17] [INFO ] Flatten gal took : 3 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:4000) in guard (OR (GEQ $A 1999) (EQ $A 3999))introduces in Altitude(4000) partition with 2 elements
Transition t3_1 : guard parameter $A(Altitude:4000) in guard (AND (LT $A 1999) (NEQ $A 3999))introduces in Altitude(4000) 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 4000 reducing to 2 values.
For transition t3_2:(OR (GEQ $A 1999) (EQ $A 3999)) -> (EQ $A 1)
For transition t3_1:(AND (LT $A 1999) (NEQ $A 3999)) -> (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:2000) in guard (OR (LEQ $S 999) (EQ $S 1999))introduces in Speed(2000) partition with 2 elements
Transition t5_1 : guard parameter $S(Speed:2000) in guard (AND (GT $S 999) (NEQ $S 1999))introduces in Speed(2000) partition with 2 elements
Transition t4_2 : guard parameter $S(Speed:2000) in guard (OR (LEQ $S 999) (EQ $S 1999))introduces in Speed(2000) partition with 2 elements
Transition t4_1 : guard parameter $S(Speed:2000) in guard (AND (GT $S 999) (NEQ $S 1999))introduces in Speed(2000) 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 2000 reducing to 2 values.
For transition t5_2:(OR (LEQ $S 999) (EQ $S 1999)) -> (EQ $S 1)
For transition t5_1:(AND (GT $S 999) (NEQ $S 1999)) -> (EQ $S 0)
For transition t4_2:(OR (LEQ $S 999) (EQ $S 1999)) -> (EQ $S 1)
For transition t4_1:(AND (GT $S 999) (NEQ $S 1999)) -> (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
[2025-05-29 17:13:17] [INFO ] Unfolded HLPN to a Petri net with 29 places and 20 transitions 56 arcs in 71 ms.
[2025-05-29 17:13:17] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Reduce places removed 6 places and 0 transitions.
Support contains 19 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 4 ms. Remains 23 /23 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 23 cols
[2025-05-29 17:13:17] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:13:17] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-05-29 17:13:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:13:17] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2025-05-29 17:13:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 256 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 239 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, Known Traps Along Path: 0/0 constraints]
After SMT, in 500ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 500ms
Finished structural reductions in LTL mode , in 1 iterations and 597 ms. Remains : 23/23 places, 20/20 transitions.
Support contains 19 out of 23 places after structural reductions.
[2025-05-29 17:13:17] [INFO ] Flatten gal took : 7 ms
[2025-05-29 17:13:17] [INFO ] Flatten gal took : 4 ms
[2025-05-29 17:13:17] [INFO ] Input system was already deterministic with 20 transitions.
RANDOM walk for 40000 steps (5043 resets) in 441 ms. (90 steps per ms) remains 14/19 properties
BEST_FIRST walk for 40004 steps (938 resets) in 131 ms. (303 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (965 resets) in 60 ms. (655 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (988 resets) in 122 ms. (325 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (876 resets) in 120 ms. (330 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (883 resets) in 110 ms. (360 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (981 resets) in 54 ms. (727 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (967 resets) in 37 ms. (1052 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (964 resets) in 60 ms. (655 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (932 resets) in 109 ms. (363 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (939 resets) in 59 ms. (666 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (967 resets) in 37 ms. (1052 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (898 resets) in 97 ms. (408 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (965 resets) in 55 ms. (714 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1054 resets) in 34 ms. (1142 steps per ms) remains 14/14 properties
[2025-05-29 17:13:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 2 (OVERLAPS) 4/19 variables, 2/3 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 5 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
After SMT solving in domain Real declared 37/43 variables, and 22 constraints, problems are : Problem set: 14 solved, 0 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/23 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 98ms problems are : Problem set: 14 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 14 atomic propositions for a total of 3 simplifications.
[2025-05-29 17:13:18] [INFO ] Flatten gal took : 3 ms
[2025-05-29 17:13:18] [INFO ] Flatten gal took : 3 ms
[2025-05-29 17:13:18] [INFO ] Input system was already deterministic with 20 transitions.
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 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.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 20 /23 variables (removed 3) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 20 cols
[2025-05-29 17:13:18] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:13:18] [INFO ] Implicit Places using invariants in 28 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 19/23 places, 20/20 transitions.
Graph (complete) has 17 edges and 19 vertex of which 18 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 4 ms. Remains 18 /19 variables (removed 1) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 18 cols
[2025-05-29 17:13:18] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:13:18] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-05-29 17:13:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:13:18] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 18/23 places, 19/20 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 95 ms. Remains : 18/23 places, 19/20 transitions.
[2025-05-29 17:13:18] [INFO ] Flatten gal took : 3 ms
[2025-05-29 17:13:18] [INFO ] Flatten gal took : 2 ms
[2025-05-29 17:13:18] [INFO ] Input system was already deterministic with 19 transitions.
[2025-05-29 17:13:18] [INFO ] Flatten gal took : 2 ms
[2025-05-29 17:13:18] [INFO ] Flatten gal took : 1 ms
[2025-05-29 17:13:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality2770154669275987960.gal : 1 ms
[2025-05-29 17:13:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality8728996213942677729.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2770154669275987960.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8728996213942677729.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,403,0.016642,3656,2,57,5,226,6,0,88,144,0


Converting to forward existential form...Done !
original formula: EG(AF(AG(AF(((Speed_Right_Wheel_0+Speed_Right_Wheel_1)<=P2)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(E(TRUE U !(!(EG(!(((Speed_Right_Wheel_0+Speed_Right_Wheel_1)<=P2)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t11, t13, t15, t17, Intersection with reachable at each step enabled. (destroyed/re...188
(forward)formula 0,0,0.034772,4552,1,0,114,5807,71,64,506,7001,124
FORMULA AirplaneLD-COL-2000-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

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 11 ms. Remains 19 /23 variables (removed 4) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2025-05-29 17:13:18] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:13:18] [INFO ] Implicit Places using invariants in 35 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/23 places, 18/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 18/23 places, 18/20 transitions.
[2025-05-29 17:13:18] [INFO ] Flatten gal took : 2 ms
[2025-05-29 17:13:18] [INFO ] Flatten gal took : 2 ms
[2025-05-29 17:13:18] [INFO ] Input system was already deterministic with 18 transitions.
[2025-05-29 17:13:18] [INFO ] Flatten gal took : 1 ms
[2025-05-29 17:13:18] [INFO ] Flatten gal took : 2 ms
[2025-05-29 17:13:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality148944977830117615.gal : 0 ms
[2025-05-29 17:13:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality15638917848536400253.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality148944977830117615.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15638917848536400253.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,323,0.003288,3784,2,44,5,168,6,0,87,102,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.003506,3784,1,0,6,168,7,1,125,102,1
FORMULA AirplaneLD-COL-2000-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

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.
[2025-05-29 17:13:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:13:19] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-29 17:13:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:13:19] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-29 17:13:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 18/33 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 4/37 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 20 constraints, problems are : Problem set: 0 solved, 9 unsolved in 131 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 18/33 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 4/37 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 29 constraints, problems are : Problem set: 0 solved, 9 unsolved in 148 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 282ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 282ms
Starting structural reductions in LTL mode, iteration 1 : 19/23 places, 18/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 343 ms. Remains : 19/23 places, 18/20 transitions.
[2025-05-29 17:13:19] [INFO ] Flatten gal took : 2 ms
[2025-05-29 17:13:19] [INFO ] Flatten gal took : 1 ms
[2025-05-29 17:13:19] [INFO ] Input system was already deterministic with 18 transitions.
[2025-05-29 17:13:19] [INFO ] Flatten gal took : 2 ms
[2025-05-29 17:13:19] [INFO ] Flatten gal took : 2 ms
[2025-05-29 17:13:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality10935686750542955489.gal : 0 ms
[2025-05-29 17:13:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality15493015195288849531.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10935686750542955489.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15493015195288849531.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,323,0.003765,3916,2,53,5,192,6,0,91,135,0


Converting to forward existential form...Done !
original formula: AF(EX(((P1<=(Speed_Left_Wheel_0+Speed_Left_Wheel_1)) * (AX((stp1>P5)) + ((TheAltitude_0+TheAltitude_1)>P3)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(((P1<=(Speed_Left_Wheel_0+Speed_Left_Wheel_1)) * (!(EX(!((stp1>P5)))) + ((TheAltitude_0+TheAltit...179
Reverse transition relation is NOT exact ! Due to transitions t9, t11, t13, t15, t17, Intersection with reachable at each step enabled. (destroyed/reverse...183
(forward)formula 0,1,0.011746,4428,1,0,77,2437,60,35,507,2791,70
FORMULA AirplaneLD-COL-2000-CTLCardinality-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-29 17:13:19] [INFO ] Flatten gal took : 1 ms
[2025-05-29 17:13:19] [INFO ] Flatten gal took : 1 ms
Total runtime 4449 ms.

BK_STOP 1748538799456

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AirplaneLD-COL-2000"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is AirplaneLD-COL-2000, 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 r002-tall-174853728500057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-COL-2000.tgz
mv AirplaneLD-COL-2000 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.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 ;