About the Execution of ITS-Tools for LamportFastMutEx-COL-2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 378.443 | 11413.00 | 27821.00 | 43.20 | FTTFFFTTFFFTTFTT | normal |
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.r224-tall-171649612300201.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 itstools
Input is LamportFastMutEx-COL-2, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-171649612300201
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 11K Apr 13 07:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 13 07:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 07:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 13 07:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 13 07:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 13 07:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 13 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 13 07:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 38K 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 LamportFastMutEx-COL-2-CTLCardinality-2024-00
FORMULA_NAME LamportFastMutEx-COL-2-CTLCardinality-2024-01
FORMULA_NAME LamportFastMutEx-COL-2-CTLCardinality-2024-02
FORMULA_NAME LamportFastMutEx-COL-2-CTLCardinality-2024-03
FORMULA_NAME LamportFastMutEx-COL-2-CTLCardinality-2024-04
FORMULA_NAME LamportFastMutEx-COL-2-CTLCardinality-2024-05
FORMULA_NAME LamportFastMutEx-COL-2-CTLCardinality-2024-06
FORMULA_NAME LamportFastMutEx-COL-2-CTLCardinality-2024-07
FORMULA_NAME LamportFastMutEx-COL-2-CTLCardinality-2024-08
FORMULA_NAME LamportFastMutEx-COL-2-CTLCardinality-2024-09
FORMULA_NAME LamportFastMutEx-COL-2-CTLCardinality-2024-10
FORMULA_NAME LamportFastMutEx-COL-2-CTLCardinality-2024-11
FORMULA_NAME LamportFastMutEx-COL-2-CTLCardinality-2024-12
FORMULA_NAME LamportFastMutEx-COL-2-CTLCardinality-2024-13
FORMULA_NAME LamportFastMutEx-COL-2-CTLCardinality-2024-14
FORMULA_NAME LamportFastMutEx-COL-2-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716561261207
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202405141337
[2024-05-24 14:34:22] [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]
[2024-05-24 14:34:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 14:34:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-24 14:34:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 14:34:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 575 ms
[2024-05-24 14:34:23] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 69 PT places and 117.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
[2024-05-24 14:34:23] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2024-05-24 14:34:23] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 3 formulas.
FORMULA LamportFastMutEx-COL-2-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40001 steps (8 resets) in 1816 ms. (22 steps per ms) remains 61/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
// Phase 1: matrix 17 rows 15 cols
[2024-05-24 14:34:24] [INFO ] Computed 2 invariants in 6 ms
[2024-05-24 14:34:24] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
After SMT solving in domain Real declared 15/32 variables, and 2 constraints, problems are : Problem set: 61 solved, 0 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/15 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 192ms problems are : Problem set: 61 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 61 atomic propositions for a total of 13 simplifications.
FORMULA LamportFastMutEx-COL-2-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 14:34:24] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-05-24 14:34:24] [INFO ] Flatten gal took : 28 ms
FORMULA LamportFastMutEx-COL-2-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 14:34:24] [INFO ] Flatten gal took : 2 ms
Domain [pid(3), pid(3)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-24 14:34:24] [INFO ] Unfolded HLPN to a Petri net with 69 places and 96 transitions 402 arcs in 17 ms.
[2024-05-24 14:34:24] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 34 transitions.
Support contains 34 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 6 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-24 14:34:24] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2024-05-24 14:34:24] [INFO ] Computed 10 invariants in 5 ms
[2024-05-24 14:34:24] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-24 14:34:24] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2024-05-24 14:34:24] [INFO ] Invariant cache hit.
[2024-05-24 14:34:24] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-24 14:34:24] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-24 14:34:24] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2024-05-24 14:34:24] [INFO ] Invariant cache hit.
[2024-05-24 14:34:24] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-24 14:34:25] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 4 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-24 14:34:25] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-24 14:34:25] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:34:25] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-24 14:34:25] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-24 14:34:25] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-24 14:34:25] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-24 14:34:25] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-24 14:34:25] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:34:25] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:34:25] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-24 14:34:25] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
[2024-05-24 14:34:25] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-24 14:34:25] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
[2024-05-24 14:34:25] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-24 14:34:25] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-24 14:34:25] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-24 14:34:25] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-24 14:34:25] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 19/29 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-05-24 14:34:25] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:34:25] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 2/31 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/31 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/100 variables, 44/75 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 16/91 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/91 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/91 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 91 constraints, problems are : Problem set: 12 solved, 48 unsolved in 1497 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 12 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 13/17 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/17 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 6/23 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/31 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-05-24 14:34:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 1/32 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/32 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 56/100 variables, 44/76 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 16/92 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 48/140 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-05-24 14:34:26] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 1/141 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-05-24 14:34:27] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/100 variables, 1/142 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/100 variables, 0/142 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/100 variables, 0/142 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 142 constraints, problems are : Problem set: 12 solved, 48 unsolved in 1205 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 48/60 constraints, Known Traps: 24/24 constraints]
After SMT, in 2727ms problems are : Problem set: 12 solved, 48 unsolved
Search for dead transitions found 12 dead transitions in 2729ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 44/44 places, 50/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2927 ms. Remains : 44/44 places, 50/62 transitions.
Support contains 34 out of 44 places after structural reductions.
[2024-05-24 14:34:27] [INFO ] Flatten gal took : 7 ms
[2024-05-24 14:34:27] [INFO ] Flatten gal took : 7 ms
[2024-05-24 14:34:27] [INFO ] Input system was already deterministic with 50 transitions.
RANDOM walk for 40000 steps (8 resets) in 2113 ms. (18 steps per ms) remains 32/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 32/32 properties
[2024-05-24 14:34:28] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 44 cols
[2024-05-24 14:34:28] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 14:34:28] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
After SMT solving in domain Real declared 34/92 variables, and 6 constraints, problems are : Problem set: 32 solved, 0 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 6/10 constraints, State Equation: 0/44 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 139ms problems are : Problem set: 32 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 32 atomic propositions for a total of 7 simplifications.
[2024-05-24 14:34:28] [INFO ] Flatten gal took : 4 ms
[2024-05-24 14:34:28] [INFO ] Flatten gal took : 4 ms
[2024-05-24 14:34:28] [INFO ] Input system was already deterministic with 50 transitions.
Support contains 24 out of 44 places (down from 30) after GAL structural reductions.
FORMULA LamportFastMutEx-COL-2-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 14:34:28] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:34:28] [INFO ] Invariant cache hit.
[2024-05-24 14:34:28] [INFO ] Implicit Places using invariants in 36 ms returned [30, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 42/44 places, 50/50 transitions.
[2024-05-24 14:34:28] [INFO ] Flatten gal took : 4 ms
[2024-05-24 14:34:28] [INFO ] Flatten gal took : 4 ms
[2024-05-24 14:34:28] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-24 14:34:28] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:28] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality6893454171816171960.gal : 2 ms
[2024-05-24 14:34:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality14524729369205260066.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6893454171816171960.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14524729369205260066.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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,380,0.034645,4248,2,594,5,2612,6,0,220,2614,0
Converting to forward existential form...Done !
original formula: (EX(TRUE) * AX((((P_setbi_5_1+P_setbi_5_2)<=(P_fordo_12_1+P_fordo_12_2)) + EF(((P_setbi_11_1+P_setbi_11_2)<=(P_ifyi_15_1+P_ifyi_15_2)))))...156
=> equivalent forward existential formula: ([(Init * !(EX(TRUE)))] = FALSE * [((EY(Init) * !(((P_setbi_5_1+P_setbi_5_2)<=(P_fordo_12_1+P_fordo_12_2)))) * !...234
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t12, t13, t16, t17, t18, t19, t32, t33, t34, t35, t36, t37, t42, t43,...284
(forward)formula 0,1,0.095007,7140,1,0,129,16510,119,51,1437,15319,110
FORMULA LamportFastMutEx-COL-2-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 48
Applied a total of 4 rules in 10 ms. Remains 42 /44 variables (removed 2) and now considering 48/50 (removed 2) transitions.
[2024-05-24 14:34:28] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
// Phase 1: matrix 46 rows 42 cols
[2024-05-24 14:34:28] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 14:34:28] [INFO ] Implicit Places using invariants in 34 ms returned [28, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 40/44 places, 48/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 47 ms. Remains : 40/44 places, 48/50 transitions.
[2024-05-24 14:34:28] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:28] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:28] [INFO ] Input system was already deterministic with 48 transitions.
[2024-05-24 14:34:28] [INFO ] Flatten gal took : 4 ms
[2024-05-24 14:34:28] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality3228890270319876544.gal : 1 ms
[2024-05-24 14:34:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality7051295440337085538.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3228890270319876544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7051295440337085538.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,348,0.016492,4040,2,545,5,2523,6,0,210,2402,0
Converting to forward existential form...Done !
original formula: (EF((!(E(((P_ifyi_15_1+P_ifyi_15_2)<=(P_ify0_4_1+P_ify0_4_2)) U ((P_setx_3_1+P_setx_3_2)>(P_setbi_24_1+P_setbi_24_2)))) * ((P_setbi_11_1+...319
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((P_setbi_11_1+P_setbi_11_2)>(P_setx_3_1+P_setx_3_2))) * !(E(((P_ifyi_15_1+P_ifyi_15_2)<=(...395
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t12, t13, t16, t17, t18, t19, t28, t29, t30, t31, t32, t33, t38, t39,...284
(forward)formula 0,1,0.111918,9056,1,0,168,29142,115,71,1384,27515,142
FORMULA LamportFastMutEx-COL-2-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 14:34:29] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 44 cols
[2024-05-24 14:34:29] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 14:34:29] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-24 14:34:29] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:34:29] [INFO ] Invariant cache hit.
[2024-05-24 14:34:29] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 14:34:29] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-24 14:34:29] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:34:29] [INFO ] Invariant cache hit.
[2024-05-24 14:34:29] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 5 ms to minimize.
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 0 ms to minimize.
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-24 14:34:29] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:34:30] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-24 14:34:30] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:30] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 48/92 variables, 44/81 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:30] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 96 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1535 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 48/92 variables, 44/82 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 48/144 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:31] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:31] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-24 14:34:31] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/92 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 147 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1312 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 31/31 constraints]
After SMT, in 2861ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2862ms
Finished structural reductions in LTL mode , in 1 iterations and 2984 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 14:34:32] [INFO ] Flatten gal took : 6 ms
[2024-05-24 14:34:32] [INFO ] Flatten gal took : 6 ms
[2024-05-24 14:34:32] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-24 14:34:32] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:32] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality8986515220583058844.gal : 1 ms
[2024-05-24 14:34:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality9040433414646674257.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8986515220583058844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9040433414646674257.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,380,0.018158,4080,2,569,5,2560,6,0,228,2590,0
Converting to forward existential form...Done !
original formula: AG(EX(EG(((P_ify0_4_1+P_ify0_4_2)>(P_await_13_1+P_await_13_2)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(EG(((P_ify0_4_1+P_ify0_4_2)>(P_await_13_1+P_await_13_2))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t12, t13, t16, t17, t18, t19, t32, t33, t34, t35, t36, t37, t42, t43,...284
(forward)formula 0,0,0.077596,6984,1,0,152,17130,120,62,1503,14328,137
FORMULA LamportFastMutEx-COL-2-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 48
Applied a total of 4 rules in 12 ms. Remains 42 /44 variables (removed 2) and now considering 48/50 (removed 2) transitions.
[2024-05-24 14:34:32] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
// Phase 1: matrix 46 rows 42 cols
[2024-05-24 14:34:32] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 14:34:32] [INFO ] Implicit Places using invariants in 42 ms returned [28, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 40/44 places, 48/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 59 ms. Remains : 40/44 places, 48/50 transitions.
[2024-05-24 14:34:32] [INFO ] Flatten gal took : 2 ms
[2024-05-24 14:34:32] [INFO ] Flatten gal took : 2 ms
[2024-05-24 14:34:32] [INFO ] Input system was already deterministic with 48 transitions.
[2024-05-24 14:34:32] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:32] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality5476841335615169706.gal : 1 ms
[2024-05-24 14:34:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality7692159061369321785.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5476841335615169706.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7692159061369321785.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,348,0.024834,4044,2,545,5,2523,6,0,210,2402,0
Converting to forward existential form...Done !
original formula: EF(EG((((P_sety_9_1+P_sety_9_2)<=(P_setbi_5_1+P_setbi_5_2))&&(((P_ifyi_15_1+P_ifyi_15_2)>=16)||((P_ifyi_15_1+P_ifyi_15_2)<=(P_setbi_24_1+...173
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((P_sety_9_1+P_sety_9_2)<=(P_setbi_5_1+P_setbi_5_2))&&(((P_ifyi_15_1+P_ifyi_15_2)>=16)||(...223
Hit Full ! (commute/partial/dont) 20/11/28
(forward)formula 0,1,0.081909,6948,1,0,11,15980,19,1,1132,12659,11
FORMULA LamportFastMutEx-COL-2-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 14:34:32] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 44 cols
[2024-05-24 14:34:32] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 14:34:32] [INFO ] Implicit Places using invariants in 63 ms returned [30, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 42/44 places, 50/50 transitions.
[2024-05-24 14:34:32] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:32] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:32] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-24 14:34:32] [INFO ] Flatten gal took : 2 ms
[2024-05-24 14:34:32] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality18414022184413505608.gal : 1 ms
[2024-05-24 14:34:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality4522789885096059197.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18414022184413505608.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4522789885096059197.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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,380,0.020879,4052,2,594,5,2612,6,0,220,2614,0
Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.021514,4052,1,0,6,2612,7,1,319,2614,1
FORMULA LamportFastMutEx-COL-2-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 48
Applied a total of 4 rules in 6 ms. Remains 42 /44 variables (removed 2) and now considering 48/50 (removed 2) transitions.
[2024-05-24 14:34:32] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
// Phase 1: matrix 46 rows 42 cols
[2024-05-24 14:34:32] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 14:34:32] [INFO ] Implicit Places using invariants in 45 ms returned [28, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 40/44 places, 48/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 55 ms. Remains : 40/44 places, 48/50 transitions.
[2024-05-24 14:34:32] [INFO ] Flatten gal took : 5 ms
[2024-05-24 14:34:32] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:32] [INFO ] Input system was already deterministic with 48 transitions.
[2024-05-24 14:34:32] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:32] [INFO ] Flatten gal took : 2 ms
[2024-05-24 14:34:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality14449267835140318723.gal : 3 ms
[2024-05-24 14:34:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality5761799078920816327.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14449267835140318723.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5761799078920816327.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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,348,0.016281,4044,2,545,5,2523,6,0,210,2402,0
Converting to forward existential form...Done !
original formula: EF(EG(((P_setbi_11_1+P_setbi_11_2)<=(P_ifyi_15_1+P_ifyi_15_2))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((P_setbi_11_1+P_setbi_11_2)<=(P_ifyi_15_1+P_ifyi_15_2)))] != FALSE
Hit Full ! (commute/partial/dont) 36/0/12
(forward)formula 0,1,0.055498,6156,1,0,11,11897,19,1,1110,8175,11
FORMULA LamportFastMutEx-COL-2-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2024-05-24 14:34:32] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:32] [INFO ] Flatten gal took : 3 ms
Total runtime 10217 ms.
BK_STOP 1716561272620
--------------------
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
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="LamportFastMutEx-COL-2"
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-5568"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-COL-2, 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 r224-tall-171649612300201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-2.tgz
mv LamportFastMutEx-COL-2 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 '
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 ;