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.r520-tall-171662338700521.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Referendum-COL-0015, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662338700521
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.7K Apr 11 16:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 11 16:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 11 16:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 11 16:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 11 16:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Apr 11 16:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Referendum-COL-0015-CTLCardinality-2024-00
FORMULA_NAME Referendum-COL-0015-CTLCardinality-2024-01
FORMULA_NAME Referendum-COL-0015-CTLCardinality-2024-02
FORMULA_NAME Referendum-COL-0015-CTLCardinality-2024-03
FORMULA_NAME Referendum-COL-0015-CTLCardinality-2024-04
FORMULA_NAME Referendum-COL-0015-CTLCardinality-2024-05
FORMULA_NAME Referendum-COL-0015-CTLCardinality-2024-06
FORMULA_NAME Referendum-COL-0015-CTLCardinality-2024-07
FORMULA_NAME Referendum-COL-0015-CTLCardinality-2024-08
FORMULA_NAME Referendum-COL-0015-CTLCardinality-2024-09
FORMULA_NAME Referendum-COL-0015-CTLCardinality-2024-10
FORMULA_NAME Referendum-COL-0015-CTLCardinality-2024-11
FORMULA_NAME Referendum-COL-0015-CTLCardinality-2024-12
FORMULA_NAME Referendum-COL-0015-CTLCardinality-2024-13
FORMULA_NAME Referendum-COL-0015-CTLCardinality-2024-14
FORMULA_NAME Referendum-COL-0015-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717261522136

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-COL-0015
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:05:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:05:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:05:23] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 17:05:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 17:05:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 503 ms
[2024-06-01 17:05:23] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 46 PT places and 31.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
[2024-06-01 17:05:23] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 6 arcs in 4 ms.
[2024-06-01 17:05:23] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 5 formulas.
FORMULA Referendum-COL-0015-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40028 steps (2220 resets) in 774 ms. (51 steps per ms) remains 38/51 properties
BEST_FIRST walk for 4000 steps (84 resets) in 41 ms. (95 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4000 steps (84 resets) in 88 ms. (44 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4000 steps (84 resets) in 54 ms. (72 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 41 ms. (95 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 22 ms. (173 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 35 ms. (111 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 39 ms. (100 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 22 ms. (173 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 22 ms. (173 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 10 ms. (363 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 12 ms. (307 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 39 ms. (100 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (84 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
// Phase 1: matrix 3 rows 4 cols
[2024-06-01 17:05:24] [INFO ] Computed 1 invariants in 5 ms
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 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 AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
After SMT solving in domain Real declared 4/7 variables, and 1 constraints, problems are : Problem set: 37 solved, 0 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
After SMT, in 174ms problems are : Problem set: 37 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 37 atomic propositions for a total of 11 simplifications.
FORMULA Referendum-COL-0015-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:05:25] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-06-01 17:05:25] [INFO ] Flatten gal took : 14 ms
[2024-06-01 17:05:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Referendum-COL-0015-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:05:25] [INFO ] Flatten gal took : 1 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Voters
Arc [0:1*[0]] contains constants of sort Voters
Arc [0:1*[1]] contains constants of sort Voters
Arc [0:1*[2]] contains constants of sort Voters
Arc [0:1*[3]] contains constants of sort Voters
Arc [0:1*[4]] contains constants of sort Voters
Arc [0:1*[5]] contains constants of sort Voters
Arc [0:1*[6]] contains constants of sort Voters
Arc [0:1*[7]] contains constants of sort Voters
Arc [0:1*[8]] contains constants of sort Voters
Arc [0:1*[9]] contains constants of sort Voters
Arc [0:1*[10]] contains constants of sort Voters
Arc [0:1*[11]] contains constants of sort Voters
Arc [0:1*[12]] contains constants of sort Voters
Arc [0:1*[13]] contains constants of sort Voters
Arc [0:1*[14]] contains constants of sort Voters
Transition start : constants on arcs in [[0:1*[0]], [0:1*[1]], [0:1*[2]], [0:1*[3]], [0:1*[4]], [0:1*[5]], [0:1*[6]], [0:1*[7]], [0:1*[8]], [0:1*[9]], [0:1*[10]], [0:1*[11]], [0:1*[12]], [0:1*[13]], [0:1*[14]]] introduces in Voters(15) partition with 1 elements that refines current partition to 1 subsets.
Symmetric sort wr.t. initial detected :Voters
Symmetric sort wr.t. initial and guards detected :Voters
Applying symmetric unfolding of full symmetric sort :Voters domain size was 15
[2024-06-01 17:05:25] [INFO ] Unfolded HLPN to a Petri net with 4 places and 3 transitions 6 arcs in 16 ms.
[2024-06-01 17:05:25] [INFO ] Unfolded 6 HLPN properties in 1 ms.
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 4 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 17:05:25] [INFO ] Invariant cache hit.
[2024-06-01 17:05:25] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 17:05:25] [INFO ] Invariant cache hit.
[2024-06-01 17:05:25] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-06-01 17:05:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 2 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 102ms
Finished structural reductions in LTL mode , in 1 iterations and 262 ms. Remains : 4/4 places, 3/3 transitions.
Support contains 4 out of 4 places after structural reductions.
[2024-06-01 17:05:25] [INFO ] Flatten gal took : 2 ms
[2024-06-01 17:05:25] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:05:25] [INFO ] Input system was already deterministic with 3 transitions.
RANDOM walk for 40028 steps (2220 resets) in 91 ms. (435 steps per ms) remains 21/30 properties
BEST_FIRST walk for 4000 steps (84 resets) in 22 ms. (173 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (84 resets) in 15 ms. (250 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4000 steps (84 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (84 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (84 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (84 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (84 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (84 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (84 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (84 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (84 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (84 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (84 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (84 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (84 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (84 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (84 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (84 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (84 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (84 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
[2024-06-01 17:05:25] [INFO ] Invariant cache hit.
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
After SMT solving in domain Real declared 4/7 variables, and 1 constraints, problems are : Problem set: 20 solved, 0 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 48ms problems are : Problem set: 20 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 20 atomic propositions for a total of 6 simplifications.
[2024-06-01 17:05:25] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:05:25] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:05:25] [INFO ] Input system was already deterministic with 3 transitions.
FORMULA Referendum-COL-0015-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA Referendum-COL-0015-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 4 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 3/4 places, 3/3 transitions.
[2024-06-01 17:05:25] [INFO ] Flatten gal took : 0 ms
[2024-06-01 17:05:25] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:05:25] [INFO ] Input system was already deterministic with 3 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 3 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 2/4 places, 2/3 transitions.
[2024-06-01 17:05:25] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:05:25] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:05:25] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 3 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 3/4 places, 3/3 transitions.
[2024-06-01 17:05:25] [INFO ] Flatten gal took : 0 ms
[2024-06-01 17:05:25] [INFO ] Flatten gal took : 0 ms
[2024-06-01 17:05:25] [INFO ] Input system was already deterministic with 3 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 0 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 3/4 places, 3/3 transitions.
[2024-06-01 17:05:25] [INFO ] Flatten gal took : 0 ms
[2024-06-01 17:05:25] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:05:25] [INFO ] Input system was already deterministic with 3 transitions.
[2024-06-01 17:05:25] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:05:25] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:05:25] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2024-06-01 17:05:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4 places, 3 transitions and 6 arcs took 2 ms.
Total runtime 2422 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Referendum-COL-0015-CTLCardinality-2024-00
Could not compute solution for formula : Referendum-COL-0015-CTLCardinality-2024-01
Could not compute solution for formula : Referendum-COL-0015-CTLCardinality-2024-08
Could not compute solution for formula : Referendum-COL-0015-CTLCardinality-2024-13

BK_STOP 1717261525931

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name Referendum-COL-0015-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/509/ctl_0_
ctl formula name Referendum-COL-0015-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/509/ctl_1_
ctl formula name Referendum-COL-0015-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/509/ctl_2_
ctl formula name Referendum-COL-0015-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/509/ctl_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Referendum-COL-0015, 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 r520-tall-171662338700521"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-COL-0015.tgz
mv Referendum-COL-0015 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;