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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 9.6K Apr 12 09:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 09:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 09:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 09:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 09:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 09:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 09:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 09:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 54K 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 PermAdmissibility-COL-01-CTLCardinality-2024-00
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-01
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-02
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-03
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-04
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-05
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-06
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-07
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-08
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-09
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-10
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-11
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-12
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-13
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-14
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716673514329

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202405141337
[2024-05-25 21:45:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 21:45:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 21:45:17] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 21:45:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 21:45:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1573 ms
[2024-05-25 21:45:18] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 39 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 55 ms.
[2024-05-25 21:45:18] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 6 ms.
[2024-05-25 21:45:18] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
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.
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40000 steps (2352 resets) in 3945 ms. (10 steps per ms) remains 90/128 properties
BEST_FIRST walk for 4000 steps (232 resets) in 183 ms. (21 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 196 ms. (20 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 135 ms. (29 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 192 ms. (20 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 204 ms. (19 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 227 ms. (17 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 190 ms. (20 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 176 ms. (22 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 172 ms. (23 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 94 ms. (42 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 49 ms. (80 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 51 ms. (76 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 49 ms. (80 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 66 ms. (59 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 50 ms. (78 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 82 ms. (48 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 47 ms. (83 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 69 ms. (57 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 62 ms. (63 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 87 ms. (45 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 87 ms. (45 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 47 ms. (83 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 47 ms. (83 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 62 ms. (63 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 47 ms. (83 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 45 ms. (86 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 45 ms. (86 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 45 ms. (86 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 46 ms. (85 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 48 ms. (81 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 71 ms. (55 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 44 ms. (88 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 44 ms. (88 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 45 ms. (86 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 45 ms. (86 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 46 ms. (85 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 47 ms. (83 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 63 ms. (62 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 67 ms. (58 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 72 ms. (54 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 73 ms. (54 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 72 ms. (54 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 72 ms. (54 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 117 ms. (33 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 81 ms. (48 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 77 ms. (51 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 82 ms. (48 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 80 ms. (49 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 79 ms. (50 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 101 ms. (39 steps per ms) remains 90/90 properties
// Phase 1: matrix 16 rows 40 cols
[2024-05-25 21:45:21] [INFO ] Computed 24 invariants in 9 ms
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp75 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 AtomicPropp83 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp93 is UNSAT
Problem AtomicPropp94 is UNSAT
Problem AtomicPropp95 is UNSAT
Problem AtomicPropp98 is UNSAT
Problem AtomicPropp99 is UNSAT
Problem AtomicPropp100 is UNSAT
Problem AtomicPropp104 is UNSAT
Problem AtomicPropp105 is UNSAT
Problem AtomicPropp106 is UNSAT
Problem AtomicPropp107 is UNSAT
Problem AtomicPropp108 is UNSAT
Problem AtomicPropp109 is UNSAT
Problem AtomicPropp111 is UNSAT
Problem AtomicPropp112 is UNSAT
Problem AtomicPropp113 is UNSAT
Problem AtomicPropp115 is UNSAT
Problem AtomicPropp119 is UNSAT
Problem AtomicPropp120 is UNSAT
Problem AtomicPropp121 is UNSAT
Problem AtomicPropp122 is UNSAT
Problem AtomicPropp123 is UNSAT
Problem AtomicPropp124 is UNSAT
Problem AtomicPropp125 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 24/24 constraints. Problems are: Problem set: 89 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/24 constraints. Problems are: Problem set: 89 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 16/56 variables, 40/64 constraints. Problems are: Problem set: 89 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/64 constraints. Problems are: Problem set: 89 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/56 variables, 0/64 constraints. Problems are: Problem set: 89 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 64 constraints, problems are : Problem set: 89 solved, 1 unsolved in 575 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 89 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 89 solved, 1 unsolved
Problem AtomicPropp29 is UNSAT
After SMT solving in domain Int declared 31/56 variables, and 15 constraints, problems are : Problem set: 90 solved, 0 unsolved in 99 ms.
Refiners :[Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/40 constraints, PredecessorRefiner: 0/90 constraints, Known Traps: 0/0 constraints]
After SMT, in 789ms problems are : Problem set: 90 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 90 atomic propositions for a total of 16 simplifications.
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 21:45:22] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-25 21:45:22] [INFO ] Flatten gal took : 41 ms
[2024-05-25 21:45:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 21:45:22] [INFO ] Flatten gal took : 13 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2024-05-25 21:45:22] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 23 ms.
[2024-05-25 21:45:22] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Support contains 38 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Applied a total of 0 rules in 12 ms. Remains 40 /40 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-05-25 21:45:22] [INFO ] Invariant cache hit.
[2024-05-25 21:45:22] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-25 21:45:22] [INFO ] Invariant cache hit.
[2024-05-25 21:45:23] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2024-05-25 21:45:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/36 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 4/40 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 16/56 variables, 40/64 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 64 constraints, problems are : Problem set: 0 solved, 15 unsolved in 660 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/36 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 4/40 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 16/56 variables, 40/64 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 15/79 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 79 constraints, problems are : Problem set: 0 solved, 15 unsolved in 482 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 1156ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 1160ms
Finished structural reductions in LTL mode , in 1 iterations and 1403 ms. Remains : 40/40 places, 16/16 transitions.
Support contains 38 out of 40 places after structural reductions.
[2024-05-25 21:45:24] [INFO ] Flatten gal took : 10 ms
[2024-05-25 21:45:24] [INFO ] Flatten gal took : 11 ms
[2024-05-25 21:45:24] [INFO ] Input system was already deterministic with 16 transitions.
RANDOM walk for 40000 steps (2352 resets) in 927 ms. (43 steps per ms) remains 61/89 properties
BEST_FIRST walk for 4000 steps (232 resets) in 93 ms. (42 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 85 ms. (46 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 97 ms. (40 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 96 ms. (41 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 101 ms. (39 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 87 ms. (45 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 84 ms. (47 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 47 ms. (83 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 46 ms. (85 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 62 ms. (63 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 65 ms. (60 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 64 ms. (61 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 46 ms. (85 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 46 ms. (85 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 59 ms. (66 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 48 ms. (81 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 48 ms. (81 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 61 ms. (64 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 58 ms. (67 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 46 ms. (85 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 75 ms. (52 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 46 ms. (85 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 49 ms. (80 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 57 ms. (68 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 58 ms. (67 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 47 ms. (83 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 47 ms. (83 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 63 ms. (62 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 45 ms. (86 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 88 ms. (44 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 70 ms. (56 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 109 ms. (36 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 74 ms. (53 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 72 ms. (54 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 86 ms. (45 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 60 ms. (65 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 47 ms. (83 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 81 ms. (48 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 61 ms. (64 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 48 ms. (81 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 43 ms. (90 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 42 ms. (93 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 48 ms. (81 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 51 ms. (76 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 49 ms. (80 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 55 ms. (71 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 55 ms. (71 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 56 ms. (70 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 54 ms. (72 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 53 ms. (74 steps per ms) remains 61/61 properties
[2024-05-25 21:45:25] [INFO ] Invariant cache hit.
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 13/13 constraints. Problems are: Problem set: 4 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 57 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 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 AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp86 is UNSAT
At refinement iteration 2 (OVERLAPS) 3/40 variables, 11/24 constraints. Problems are: Problem set: 60 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/24 constraints. Problems are: Problem set: 60 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/56 variables, 40/64 constraints. Problems are: Problem set: 60 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/64 constraints. Problems are: Problem set: 60 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/56 variables, 0/64 constraints. Problems are: Problem set: 60 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 64 constraints, problems are : Problem set: 60 solved, 1 unsolved in 570 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 60 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 60 solved, 1 unsolved
Problem AtomicPropp20 is UNSAT
After SMT solving in domain Int declared 31/56 variables, and 15 constraints, problems are : Problem set: 61 solved, 0 unsolved in 50 ms.
Refiners :[Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/40 constraints, PredecessorRefiner: 0/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 654ms problems are : Problem set: 61 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 61 atomic propositions for a total of 9 simplifications.
[2024-05-25 21:45:26] [INFO ] Flatten gal took : 9 ms
[2024-05-25 21:45:26] [INFO ] Flatten gal took : 8 ms
[2024-05-25 21:45:26] [INFO ] Input system was already deterministic with 16 transitions.
Support contains 22 out of 40 places (down from 24) after GAL structural reductions.
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Graph (complete) has 105 edges and 40 vertex of which 29 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 29 ms. Remains 27 /40 variables (removed 13) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 27 cols
[2024-05-25 21:45:26] [INFO ] Computed 13 invariants in 7 ms
[2024-05-25 21:45:26] [INFO ] Implicit Places using invariants in 107 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 18, 22, 24]
[2024-05-25 21:45:26] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 16, 22]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 110 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 20/40 places, 14/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 19 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 18 transition count 12
Applied a total of 4 rules in 22 ms. Remains 18 /20 variables (removed 2) and now considering 12/14 (removed 2) transitions.
// Phase 1: matrix 12 rows 18 cols
[2024-05-25 21:45:26] [INFO ] Computed 6 invariants in 7 ms
[2024-05-25 21:45:26] [INFO ] Implicit Places using invariants in 65 ms returned [4, 5, 9, 10, 15]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 69 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 13/40 places, 12/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 13 transition count 7
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 6 transition count 5
Applied a total of 14 rules in 5 ms. Remains 6 /13 variables (removed 7) and now considering 5/12 (removed 7) transitions.
// Phase 1: matrix 5 rows 6 cols
[2024-05-25 21:45:26] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 21:45:26] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-25 21:45:26] [INFO ] Invariant cache hit.
[2024-05-25 21:45:26] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 6/40 places, 5/16 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 291 ms. Remains : 6/40 places, 5/16 transitions.
[2024-05-25 21:45:26] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:45:26] [INFO ] Flatten gal took : 1 ms
[2024-05-25 21:45:26] [INFO ] Input system was already deterministic with 5 transitions.
[2024-05-25 21:45:27] [INFO ] Flatten gal took : 1 ms
[2024-05-25 21:45:27] [INFO ] Flatten gal took : 1 ms
[2024-05-25 21:45:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality553041257330953650.gal : 2 ms
[2024-05-25 21:45:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality2839188766474510508.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality553041257330953650.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2839188766474510508.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...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,6,0.018946,3136,2,12,5,52,6,0,28,32,0


Converting to forward existential form...Done !
original formula: AF(((out4>c6)&&(c13<99)))
=> equivalent forward existential formula: [FwdG(Init,!(((out4>c6)&&(c13<99))))] = FALSE
dead was empty
(forward)formula 0,1,0.020762,3484,1,0,11,116,13,2,118,92,10
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 30 transition count 16
Applied a total of 10 rules in 1 ms. Remains 30 /40 variables (removed 10) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2024-05-25 21:45:27] [INFO ] Computed 14 invariants in 2 ms
[2024-05-25 21:45:27] [INFO ] Implicit Places using invariants in 93 ms returned [4, 5, 6, 7, 12, 14, 15, 16, 22, 23, 25, 26]
[2024-05-25 21:45:27] [INFO ] Actually due to overlaps returned [4, 5, 12, 14, 16, 22, 23]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 108 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 23/40 places, 16/16 transitions.
[2024-05-25 21:45:27] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:45:27] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:45:27] [INFO ] Input system was already deterministic with 16 transitions.
[2024-05-25 21:45:27] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:45:27] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:45:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality10564414666084397049.gal : 2 ms
[2024-05-25 21:45:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality5376432420470196544.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10564414666084397049.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5376432420470196544.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,17,0.00779,3436,2,81,5,247,6,0,109,165,0


Converting to forward existential form...Done !
original formula: (AG((in2<=aux5)) + AF(EG((AX(FALSE) * EX(TRUE)))))
=> equivalent forward existential formula: [FwdG((Init * !(!(E(TRUE U !((in2<=aux5)))))),!(EG((!(EX(!(FALSE))) * EX(TRUE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,0.021066,3752,1,0,42,1138,58,25,707,1093,63
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 31 transition count 16
Applied a total of 9 rules in 2 ms. Remains 31 /40 variables (removed 9) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2024-05-25 21:45:27] [INFO ] Computed 15 invariants in 1 ms
[2024-05-25 21:45:27] [INFO ] Implicit Places using invariants in 102 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 18, 22, 23, 25, 26]
[2024-05-25 21:45:27] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 16, 22, 23]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 108 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/40 places, 16/16 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 23/40 places, 16/16 transitions.
[2024-05-25 21:45:27] [INFO ] Flatten gal took : 6 ms
[2024-05-25 21:45:27] [INFO ] Flatten gal took : 4 ms
[2024-05-25 21:45:27] [INFO ] Input system was already deterministic with 16 transitions.
[2024-05-25 21:45:27] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:45:27] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:45:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality1129890250280426285.gal : 1 ms
[2024-05-25 21:45:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality8828902945902451889.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1129890250280426285.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8828902945902451889.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,17,0.006617,3420,2,80,5,235,6,0,107,127,0


Converting to forward existential form...Done !
original formula: A(EF(EX(AF((c9<=out8)))) U !(AF(!(EX(TRUE)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(!(EG(!(!(EX(TRUE)))))))))) * !(E(!(!(!(EG(!(!(EX(TRUE))))))) U (!(E(TRUE U EX(!(EG(!((c9<=out...207
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.015976,4000,1,0,23,1015,25,5,552,726,25
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 31 transition count 16
Applied a total of 9 rules in 2 ms. Remains 31 /40 variables (removed 9) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2024-05-25 21:45:27] [INFO ] Computed 15 invariants in 2 ms
[2024-05-25 21:45:27] [INFO ] Implicit Places using invariants in 116 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 18, 22, 23, 25, 26]
[2024-05-25 21:45:27] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 16, 22, 23]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 119 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 23/40 places, 16/16 transitions.
[2024-05-25 21:45:27] [INFO ] Flatten gal took : 2 ms
[2024-05-25 21:45:27] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:45:27] [INFO ] Input system was already deterministic with 16 transitions.
[2024-05-25 21:45:27] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:45:27] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:45:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality12378285670353826303.gal : 2 ms
[2024-05-25 21:45:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality5524178678989580409.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12378285670353826303.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5524178678989580409.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,17,0.006827,3424,2,80,5,230,6,0,107,129,0


Converting to forward existential form...Done !
original formula: (EG((c7<=out1)) + AX(FALSE))
=> equivalent forward existential formula: [(EY((Init * !(EG((c7<=out1))))) * !(FALSE))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,0.024481,3740,1,0,73,1448,51,57,631,1526,139
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 16
Applied a total of 8 rules in 2 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 32 cols
[2024-05-25 21:45:27] [INFO ] Computed 16 invariants in 1 ms
[2024-05-25 21:45:27] [INFO ] Implicit Places using invariants in 94 ms returned [4, 5, 6, 7, 13, 14, 15, 16, 18, 22, 23, 26]
[2024-05-25 21:45:27] [INFO ] Actually due to overlaps returned [4, 5, 13, 14, 16, 22, 23]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 98 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 25/40 places, 16/16 transitions.
[2024-05-25 21:45:27] [INFO ] Flatten gal took : 2 ms
[2024-05-25 21:45:27] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:45:27] [INFO ] Input system was already deterministic with 16 transitions.
[2024-05-25 21:45:27] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:45:27] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:45:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality12121784977778358378.gal : 2 ms
[2024-05-25 21:45:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality7576838787345719025.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12121784977778358378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7576838787345719025.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,17,0.008067,3432,2,89,5,256,6,0,111,133,0


Converting to forward existential form...Done !
original formula: EF(EX(((EG((c20>in3)) * (aux15<=29)) * ((c20<=out7)&&((out6<=31)||(aux15<=c9))))))
=> equivalent forward existential formula: [FwdG(((EY(FwdU(Init,TRUE)) * ((c20<=out7)&&((out6<=31)||(aux15<=c9)))) * (aux15<=29)),(c20>in3))] != FALSE
dead was empty
(forward)formula 0,0,0.017945,3748,1,0,25,1068,14,4,568,657,24
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 33 transition count 16
Applied a total of 7 rules in 1 ms. Remains 33 /40 variables (removed 7) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 33 cols
[2024-05-25 21:45:27] [INFO ] Computed 17 invariants in 1 ms
[2024-05-25 21:45:27] [INFO ] Implicit Places using invariants in 88 ms returned [4, 5, 6, 7, 12, 14, 16, 18, 22, 23, 25, 26]
[2024-05-25 21:45:27] [INFO ] Actually due to overlaps returned [4, 5, 12, 14, 16, 22, 23]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 91 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 26/40 places, 16/16 transitions.
[2024-05-25 21:45:27] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:45:27] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:45:27] [INFO ] Input system was already deterministic with 16 transitions.
[2024-05-25 21:45:27] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:45:27] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:45:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality3620009319614998165.gal : 1 ms
[2024-05-25 21:45:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality15106324964147002924.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3620009319614998165.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15106324964147002924.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,17,0.008325,3436,2,91,5,247,6,0,112,130,0


Converting to forward existential form...Done !
original formula: (E((EX(TRUE) + (c20<=aux6)) U ((out4<3)&&(out4>c19))) + EG((((in2<=out1)&&(out7<49))&&((aux6<78)&&(c13<=22)))))
=> equivalent forward existential formula: ([(FwdU(Init,(EX(TRUE) + (c20<=aux6))) * ((out4<3)&&(out4>c19)))] != FALSE + [FwdG(Init,(((in2<=out1)&&(out7<49)...193
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.018046,3752,1,0,9,822,12,3,592,371,6
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 16
Applied a total of 8 rules in 3 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 32 cols
[2024-05-25 21:45:27] [INFO ] Computed 16 invariants in 4 ms
[2024-05-25 21:45:27] [INFO ] Implicit Places using invariants in 85 ms returned [4, 6, 12, 13, 14, 15, 16, 18, 22, 23, 25, 26]
[2024-05-25 21:45:27] [INFO ] Actually due to overlaps returned [4, 12, 13, 14, 16, 22, 23]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 89 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 25/40 places, 16/16 transitions.
[2024-05-25 21:45:28] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:45:28] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:45:28] [INFO ] Input system was already deterministic with 16 transitions.
[2024-05-25 21:45:28] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:45:28] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:45:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality13187193924250799999.gal : 2 ms
[2024-05-25 21:45:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality3471862310215508693.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13187193924250799999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3471862310215508693.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,17,0.00856,3432,2,99,5,256,6,0,112,129,0


Converting to forward existential form...Done !
original formula: A(AX(AX(((out8<=out1)&&(c5<=aux12)))) U EG(((c16<=c5) + AX((aux10<=out8)))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG(((c16<=c5) + !(EX(!((aux10<=out8)))))))))) * !(E(!(EG(((c16<=c5) + !(EX(!((aux10<=out8))))))...271
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.026733,3920,1,0,26,1158,23,6,603,862,26
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Graph (complete) has 105 edges and 40 vertex of which 32 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 7 ms. Remains 30 /40 variables (removed 10) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2024-05-25 21:45:28] [INFO ] Computed 14 invariants in 3 ms
[2024-05-25 21:45:28] [INFO ] Implicit Places using invariants in 89 ms returned [4, 5, 6, 13, 15, 16, 18, 22, 23, 25, 26]
[2024-05-25 21:45:28] [INFO ] Actually due to overlaps returned [4, 5, 13, 15, 16, 22, 23]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 93 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 23/40 places, 16/16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 22 transition count 15
Applied a total of 2 rules in 5 ms. Remains 22 /23 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 22 cols
[2024-05-25 21:45:28] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 21:45:28] [INFO ] Implicit Places using invariants in 52 ms returned [4, 12, 17, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 55 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 18/40 places, 15/16 transitions.
Graph (complete) has 23 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 17 transition count 12
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 15 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 14 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 7 place count 14 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 11 place count 12 transition count 9
Applied a total of 11 rules in 7 ms. Remains 12 /18 variables (removed 6) and now considering 9/15 (removed 6) transitions.
// Phase 1: matrix 9 rows 12 cols
[2024-05-25 21:45:28] [INFO ] Computed 3 invariants in 0 ms
[2024-05-25 21:45:28] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-25 21:45:28] [INFO ] Invariant cache hit.
[2024-05-25 21:45:28] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 12/40 places, 9/16 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 234 ms. Remains : 12/40 places, 9/16 transitions.
[2024-05-25 21:45:28] [INFO ] Flatten gal took : 1 ms
[2024-05-25 21:45:28] [INFO ] Flatten gal took : 1 ms
[2024-05-25 21:45:28] [INFO ] Input system was already deterministic with 9 transitions.
[2024-05-25 21:45:28] [INFO ] Flatten gal took : 2 ms
[2024-05-25 21:45:28] [INFO ] Flatten gal took : 2 ms
[2024-05-25 21:45:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality2810820036226162153.gal : 1 ms
[2024-05-25 21:45:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality5546612707584518304.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2810820036226162153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5546612707584518304.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(((aux12<=aux8) + EG(AG((in1<=c19)))))
=> equivalent forward existential formula: [FwdG(Init,((aux12<=aux8) + EG(!(E(TRUE U !((in1<=c19)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
(forward)formula 0,1,0.009504,3668,1,0,47,555,45,47,361,776,81
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-25 21:45:28] [INFO ] Flatten gal took : 4 ms
[2024-05-25 21:45:28] [INFO ] Flatten gal took : 4 ms
Total runtime 11469 ms.

BK_STOP 1716673528398

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PermAdmissibility-COL-01, 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 r268-smll-171654406900105"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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