Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r184-tall-174889264700705.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 SafeBus-COL-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-174889264700705
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.0K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 42K 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 SafeBus-COL-03-CTLCardinality-2025-00
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2025-01
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2025-02
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2025-03
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2025-04
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2025-05
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2025-06
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2025-07
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2025-08
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2025-09
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2025-10
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2025-11
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2025-12
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2025-13
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2025-14
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749150026683

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202505121319
[2025-06-05 19:00:27] [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-06-05 19:00:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 19:00:28] [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-06-05 19:00:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-05 19:00:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 540 ms
[2025-06-05 19:00:28] [INFO ] Detected 1 constant HL places corresponding to 3 PT places.
[2025-06-05 19:00:28] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 60 PT places and 214.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
[2025-06-05 19:00:28] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2025-06-05 19:00:28] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 16 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 40000 steps (8 resets) in 1636 ms. (24 steps per ms) remains 75/95 properties
BEST_FIRST walk for 4003 steps (8 resets) in 93 ms. (42 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (8 resets) in 69 ms. (57 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 99 ms. (40 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 94 ms. (42 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 75/75 properties
// Phase 1: matrix 14 rows 17 cols
[2025-06-05 19:00:30] [INFO ] Computed 7 invariants in 11 ms
[2025-06-05 19:00:30] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 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 AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp92 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 4/4 constraints. Problems are: Problem set: 58 solved, 17 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp94 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 3/7 constraints. Problems are: Problem set: 74 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/7 constraints. Problems are: Problem set: 74 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/31 variables, 17/24 constraints. Problems are: Problem set: 74 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/27 constraints. Problems are: Problem set: 74 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/27 constraints. Problems are: Problem set: 74 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/31 variables, 0/27 constraints. Problems are: Problem set: 74 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 27 constraints, problems are : Problem set: 74 solved, 1 unsolved in 394 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 17/17 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 74 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 74 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 2/2 constraints. Problems are: Problem set: 74 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 74 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/14 variables, 3/5 constraints. Problems are: Problem set: 74 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:30] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 1/6 constraints. Problems are: Problem set: 74 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 74 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/15 variables, 1/7 constraints. Problems are: Problem set: 74 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 74 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/28 variables, 15/22 constraints. Problems are: Problem set: 74 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/28 variables, 2/24 constraints. Problems are: Problem set: 74 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/28 variables, 1/25 constraints. Problems are: Problem set: 74 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/28 variables, 0/25 constraints. Problems are: Problem set: 74 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/31 variables, 2/27 constraints. Problems are: Problem set: 74 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/31 variables, 1/28 constraints. Problems are: Problem set: 74 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/31 variables, 1/29 constraints. Problems are: Problem set: 74 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/31 variables, 0/29 constraints. Problems are: Problem set: 74 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/31 variables, 0/29 constraints. Problems are: Problem set: 74 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 29 constraints, problems are : Problem set: 74 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 17/17 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/75 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 643ms problems are : Problem set: 74 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 17 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17/17 places, 14/14 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 16 transition count 13
Applied a total of 2 rules in 47 ms. Remains 16 /17 variables (removed 1) and now considering 13/14 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 16/17 places, 13/14 transitions.
RANDOM walk for 40001 steps (8 resets) in 266 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Probably explored full state space saw : 134 states, properties seen :0
Probabilistic random walk after 440 steps, saw 134 distinct states, run finished after 16 ms. (steps per millisecond=27 ) properties seen :0
Explored full state space saw : 134 states, properties seen :0
Exhaustive walk after 440 steps, saw 134 distinct states, run finished after 2 ms. (steps per millisecond=220 ) properties seen :0
Successfully simplified 75 atomic propositions for a total of 15 simplifications.
FORMULA SafeBus-COL-03-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-CTLCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 19:00:31] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2025-06-05 19:00:31] [INFO ] Flatten gal took : 28 ms
[2025-06-05 19:00:31] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2025-06-05 19:00:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SafeBus-COL-03-CTLCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-CTLCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-CTLCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-CTLCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 19:00:31] [INFO ] Flatten gal took : 3 ms
FORMULA SafeBus-COL-03-CTLCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Domain [It(3), It(3)] of place AMC breaks symmetries in sort It
[2025-06-05 19:00:31] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions 556 arcs in 14 ms.
[2025-06-05 19:00:31] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 6 places and 6 transitions.
Support contains 47 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2025-06-05 19:00:31] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2025-06-05 19:00:31] [INFO ] Computed 17 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:00:31] [INFO ] Implicit Places using invariants in 611 ms returned []
[2025-06-05 19:00:31] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-05 19:00:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:00:31] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-05 19:00:31] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2025-06-05 19:00:31] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-05 19:00:31] [INFO ] Invariant cache hit.
[2025-06-05 19:00:31] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 10/17 constraints. Problems are: Problem set: 9 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:32] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:32] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:32] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:32] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:32] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:32] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:32] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:32] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:32] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:32] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:33] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 11/28 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/28 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 68/122 variables, 54/82 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 13/95 constraints. Problems are: Problem set: 9 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:33] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:33] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 2/97 constraints. Problems are: Problem set: 9 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:34] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:34] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 2/99 constraints. Problems are: Problem set: 9 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:34] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 1/100 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/100 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/100 constraints. Problems are: Problem set: 9 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 100 constraints, problems are : Problem set: 9 solved, 79 unsolved in 3677 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 7/7 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 10/17 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 16/33 constraints. Problems are: Problem set: 9 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:35] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:35] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/35 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/35 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/122 variables, 54/89 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 13/102 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 79/181 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/181 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/181 constraints. Problems are: Problem set: 9 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 181 constraints, problems are : Problem set: 9 solved, 79 unsolved in 3157 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/88 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6893ms problems are : Problem set: 9 solved, 79 unsolved
Search for dead transitions found 9 dead transitions in 6896ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 54/54 places, 82/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7632 ms. Remains : 54/54 places, 82/91 transitions.
Support contains 47 out of 54 places after structural reductions.
[2025-06-05 19:00:38] [INFO ] Flatten gal took : 17 ms
[2025-06-05 19:00:38] [INFO ] Flatten gal took : 10 ms
[2025-06-05 19:00:38] [INFO ] Input system was already deterministic with 82 transitions.
RANDOM walk for 40000 steps (8 resets) in 1031 ms. (38 steps per ms) remains 19/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
[2025-06-05 19:00:39] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-05 19:00:39] [INFO ] Invariant cache hit.
[2025-06-05 19:00:39] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 14 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 2 (OVERLAPS) 5/42 variables, 5/6 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 13 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 4 (OVERLAPS) 11/53 variables, 10/16 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/54 variables, 1/17 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/17 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 68/122 variables, 54/71 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 13/84 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/84 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/84 constraints. Problems are: Problem set: 18 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 84 constraints, problems are : Problem set: 18 solved, 1 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/23 variables, 4/4 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/50 variables, 10/14 constraints. Problems are: Problem set: 18 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:39] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/15 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/52 variables, 2/17 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/17 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 67/119 variables, 52/69 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 12/81 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 1/82 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 0/82 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/122 variables, 2/84 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 1/85 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 1/86 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/122 variables, 0/86 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/122 variables, 0/86 constraints. Problems are: Problem set: 18 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 86 constraints, problems are : Problem set: 18 solved, 1 unsolved in 806 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/19 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1038ms problems are : Problem set: 18 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 5 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 54/54 places, 82/82 transitions.
RANDOM walk for 40000 steps (8 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Probably explored full state space saw : 4650 states, properties seen :0
Probabilistic random walk after 17538 steps, saw 4650 distinct states, run finished after 55 ms. (steps per millisecond=318 ) properties seen :0
Explored full state space saw : 4650 states, properties seen :0
Exhaustive walk after 17538 steps, saw 4650 distinct states, run finished after 23 ms. (steps per millisecond=762 ) properties seen :0
Successfully simplified 19 atomic propositions for a total of 4 simplifications.
[2025-06-05 19:00:40] [INFO ] Flatten gal took : 11 ms
[2025-06-05 19:00:40] [INFO ] Flatten gal took : 11 ms
[2025-06-05 19:00:40] [INFO ] Input system was already deterministic with 82 transitions.
FORMULA SafeBus-COL-03-CTLCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-05 19:00:40] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-05 19:00:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:00:40] [INFO ] Implicit Places using invariants in 58 ms returned [28, 29, 30]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 59 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 51/54 places, 82/82 transitions.
[2025-06-05 19:00:40] [INFO ] Flatten gal took : 6 ms
[2025-06-05 19:00:40] [INFO ] Flatten gal took : 7 ms
[2025-06-05 19:00:40] [INFO ] Input system was already deterministic with 82 transitions.
[2025-06-05 19:00:40] [INFO ] Flatten gal took : 6 ms
[2025-06-05 19:00:40] [INFO ] Flatten gal took : 6 ms
[2025-06-05 19:00:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality8508702544238129894.gal : 3 ms
[2025-06-05 19:00:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality11970977094791748011.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/CTLCardinality8508702544238129894.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11970977094791748011.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 -...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,4650,0.077053,6728,2,1124,5,11611,6,0,289,11498,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.078191,6728,1,0,6,11611,7,1,481,11498,1
FORMULA SafeBus-COL-03-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-05 19:00:40] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-05 19:00:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:00:40] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-05 19:00:40] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-05 19:00:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:00:41] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-05 19:00:41] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2025-06-05 19:00:41] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-05 19:00:41] [INFO ] Invariant cache hit.
[2025-06-05 19:00:41] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:41] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:41] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:41] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:41] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:41] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:41] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:41] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:41] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:41] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:41] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:41] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/122 variables, 54/82 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 13/95 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:42] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:42] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:43] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:00:43] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 99 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3234 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 68/122 variables, 54/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 13/99 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 79/178 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 178 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2680 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5939ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 5939ms
Finished structural reductions in LTL mode , in 1 iterations and 6085 ms. Remains : 54/54 places, 82/82 transitions.
[2025-06-05 19:00:47] [INFO ] Flatten gal took : 8 ms
[2025-06-05 19:00:47] [INFO ] Flatten gal took : 5 ms
[2025-06-05 19:00:47] [INFO ] Input system was already deterministic with 82 transitions.
[2025-06-05 19:00:47] [INFO ] Flatten gal took : 6 ms
[2025-06-05 19:00:47] [INFO ] Flatten gal took : 5 ms
[2025-06-05 19:00:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality9641070148412423543.gal : 1 ms
[2025-06-05 19:00:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality5335013651672820365.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/CTLCardinality9641070148412423543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5335013651672820365.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,4650,0.075923,7356,2,1426,5,12525,6,0,301,11920,0


Converting to forward existential form...Done !
original formula: E(((EF((S_tout>=1)) + !((((((cable_used_0+cable_used_1)+cable_used_2)>=47)||(((listen_0+listen_1)+listen_2)>=1))||((((FMC_0+FMC_1)+FMC_2)...295
=> equivalent forward existential formula: [(FwdU(Init,((E(TRUE U (S_tout>=1)) + !((((((cable_used_0+cable_used_1)+cable_used_2)>=47)||(((listen_0+listen_1...371
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t25, t26, t27, t37, t38, t39, t64, t65, t66, t70, t71, t72, t73, t74,...289
(forward)formula 0,0,0.225807,14012,1,0,195,48965,179,82,2500,33001,170
FORMULA SafeBus-COL-03-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-05 19:00:47] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-05 19:00:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:00:47] [INFO ] Implicit Places using invariants in 49 ms returned [28, 29, 30]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 49 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 51/54 places, 82/82 transitions.
[2025-06-05 19:00:47] [INFO ] Flatten gal took : 5 ms
[2025-06-05 19:00:47] [INFO ] Flatten gal took : 5 ms
[2025-06-05 19:00:47] [INFO ] Input system was already deterministic with 82 transitions.
[2025-06-05 19:00:47] [INFO ] Flatten gal took : 13 ms
[2025-06-05 19:00:47] [INFO ] Flatten gal took : 6 ms
[2025-06-05 19:00:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality10191567285304007336.gal : 1 ms
[2025-06-05 19:00:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality10814213777166994476.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/CTLCardinality10191567285304007336.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10814213777166994476.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,4650,0.075809,6792,2,1124,5,11611,6,0,289,11498,0


Converting to forward existential form...Done !
original formula: AX(AG(((((loop_em_0+loop_em_1)+loop_em_2)>1) + EF((((((AMC_0+AMC_1)+(AMC_2+AMC_3))+((AMC_4+AMC_5)+(AMC_6+AMC_7)))+AMC_8)>((cable_used_0+c...186
=> equivalent forward existential formula: [((FwdU(EY(Init),TRUE) * !((((loop_em_0+loop_em_1)+loop_em_2)>1))) * !(E(TRUE U (((((AMC_0+AMC_1)+(AMC_2+AMC_3))...249
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t25, t26, t27, t37, t38, t39, t64, t65, t66, t70, t71, t72, t73, t74,...289
(forward)formula 0,1,0.367722,18824,1,0,207,83295,185,89,2441,56929,192
FORMULA SafeBus-COL-03-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 17 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-05 19:00:47] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-05 19:00:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:00:47] [INFO ] Implicit Places using invariants in 66 ms returned [28, 29, 30]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 66 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 51 transition count 79
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 48 transition count 79
Applied a total of 6 rules in 8 ms. Remains 48 /51 variables (removed 3) and now considering 79/82 (removed 3) transitions.
[2025-06-05 19:00:47] [INFO ] Flow matrix only has 65 transitions (discarded 14 similar events)
// Phase 1: matrix 65 rows 48 cols
[2025-06-05 19:00:47] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:00:47] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-05 19:00:47] [INFO ] Flow matrix only has 65 transitions (discarded 14 similar events)
[2025-06-05 19:00:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:00:47] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-05 19:00:47] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 48/54 places, 79/82 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 220 ms. Remains : 48/54 places, 79/82 transitions.
[2025-06-05 19:00:48] [INFO ] Flatten gal took : 4 ms
[2025-06-05 19:00:48] [INFO ] Flatten gal took : 4 ms
[2025-06-05 19:00:48] [INFO ] Input system was already deterministic with 79 transitions.
[2025-06-05 19:00:48] [INFO ] Flatten gal took : 4 ms
[2025-06-05 19:00:48] [INFO ] Flatten gal took : 5 ms
[2025-06-05 19:00:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality2777580478932846054.gal : 1 ms
[2025-06-05 19:00:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality491561142411288866.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/CTLCardinality2777580478932846054.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality491561142411288866.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 -...282
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,3048,0.056958,6360,2,1049,5,9633,6,0,274,9349,0


Converting to forward existential form...Done !
original formula: EF(AG((R_tout<=((listen_0+listen_1)+listen_2))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((R_tout<=((listen_0+listen_1)+listen_2))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t25, t26, t27, t37, t38, t39, t61, t62, t63, t67, t68, t69, t70, t71,...289
(forward)formula 0,0,0.261314,15192,1,0,197,59867,180,84,2320,35068,181
FORMULA SafeBus-COL-03-CTLCardinality-2025-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 19:00:48] [INFO ] Flatten gal took : 5 ms
[2025-06-05 19:00:48] [INFO ] Flatten gal took : 6 ms
Total runtime 20398 ms.

BK_STOP 1749150048363

--------------------
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="SafeBus-COL-03"
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 SafeBus-COL-03, 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 r184-tall-174889264700705"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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