Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r224-tall-171649612300202.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is LamportFastMutEx-COL-2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-171649612300202
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 11K Apr 13 07:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 13 07:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 07:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 13 07:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 13 07:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 13 07:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 13 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 13 07:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 38K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716561283205

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLFireability COL
Running Version 202405141337
[2024-05-24 14:34:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 14:34:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 14:34:44] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-24 14:34:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 14:34:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 525 ms
[2024-05-24 14:34:44] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 69 PT places and 117.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
[2024-05-24 14:34:45] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 3 ms.
[2024-05-24 14:34:45] [INFO ] Skeletonized 3 HLPN properties in 2 ms. Removed 13 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 2 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 564 steps (0 resets) in 19 ms. (28 steps per ms) remains 0/2 properties
[2024-05-24 14:34:45] [INFO ] Flatten gal took : 12 ms
[2024-05-24 14:34:45] [INFO ] Flatten gal took : 2 ms
Domain [pid(3), pid(3)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-24 14:34:45] [INFO ] Unfolded HLPN to a Petri net with 69 places and 96 transitions 402 arcs in 19 ms.
[2024-05-24 14:34:45] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 34 transitions.
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 4 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-24 14:34:45] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2024-05-24 14:34:45] [INFO ] Computed 10 invariants in 5 ms
[2024-05-24 14:34:45] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-24 14:34:45] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2024-05-24 14:34:45] [INFO ] Invariant cache hit.
[2024-05-24 14:34:45] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-24 14:34:45] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-24 14:34:45] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2024-05-24 14:34:45] [INFO ] Invariant cache hit.
[2024-05-24 14:34:45] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-24 14:34:45] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 6 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-24 14:34:45] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
[2024-05-24 14:34:45] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-24 14:34:45] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-24 14:34:45] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-24 14:34:45] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-24 14:34:45] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-24 14:34:45] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-24 14:34:45] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-24 14:34:45] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-24 14:34:45] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-24 14:34:46] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
[2024-05-24 14:34:46] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-24 14:34:46] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
[2024-05-24 14:34:46] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-24 14:34:46] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-24 14:34:46] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-24 14:34:46] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-24 14:34:46] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 19/29 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-05-24 14:34:46] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-24 14:34:46] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 2/31 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/31 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/100 variables, 44/75 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 16/91 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/91 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/91 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 91 constraints, problems are : Problem set: 12 solved, 48 unsolved in 1424 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 12 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 13/17 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/17 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 6/23 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/31 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-05-24 14:34:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 1/32 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/32 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 56/100 variables, 44/76 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 16/92 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 48/140 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-05-24 14:34:47] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 1/141 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-05-24 14:34:47] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/100 variables, 1/142 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/100 variables, 0/142 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/100 variables, 0/142 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 142 constraints, problems are : Problem set: 12 solved, 48 unsolved in 1196 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 48/60 constraints, Known Traps: 24/24 constraints]
After SMT, in 2665ms problems are : Problem set: 12 solved, 48 unsolved
Search for dead transitions found 12 dead transitions in 2679ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 44/44 places, 50/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2930 ms. Remains : 44/44 places, 50/62 transitions.
Support contains 44 out of 44 places after structural reductions.
[2024-05-24 14:34:48] [INFO ] Flatten gal took : 10 ms
[2024-05-24 14:34:48] [INFO ] Flatten gal took : 11 ms
[2024-05-24 14:34:48] [INFO ] Input system was already deterministic with 50 transitions.
Reduction of identical properties reduced properties to check from 40 to 35
RANDOM walk for 40000 steps (8 resets) in 1414 ms. (28 steps per ms) remains 3/35 properties
BEST_FIRST walk for 40004 steps (8 resets) in 603 ms. (66 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 523 ms. (76 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 476 ms. (83 steps per ms) remains 3/3 properties
[2024-05-24 14:34:49] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 44 cols
[2024-05-24 14:34:49] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 14:34:49] [INFO ] State equation strengthened by 14 read => feed constraints.
Problem AtomicPropp18 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 20/41 variables, 6/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-24 14:34:49] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
Problem AtomicPropp2 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/89 variables, 41/51 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 14/65 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-24 14:34:49] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:34:49] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 2/67 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/67 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/92 variables, 3/70 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/71 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/71 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/92 variables, 0/71 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 71 constraints, problems are : Problem set: 2 solved, 1 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 31/41 variables, 7/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 3/12 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-24 14:34:49] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-24 14:34:49] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-05-24 14:34:49] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
Problem AtomicPropp32 is UNSAT
After SMT solving in domain Int declared 41/92 variables, and 15 constraints, problems are : Problem set: 3 solved, 0 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 9/10 constraints, State Equation: 0/44 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 242ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 14:34:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-24 14:34:49] [INFO ] Flatten gal took : 14 ms
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 14:34:49] [INFO ] Flatten gal took : 8 ms
[2024-05-24 14:34:49] [INFO ] Input system was already deterministic with 50 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 48
Applied a total of 4 rules in 11 ms. Remains 42 /44 variables (removed 2) and now considering 48/50 (removed 2) transitions.
[2024-05-24 14:34:49] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
// Phase 1: matrix 46 rows 42 cols
[2024-05-24 14:34:49] [INFO ] Computed 10 invariants in 3 ms
[2024-05-24 14:34:49] [INFO ] Implicit Places using invariants in 43 ms returned [28, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 40/44 places, 48/50 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 40 transition count 46
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 38 transition count 46
Applied a total of 4 rules in 6 ms. Remains 38 /40 variables (removed 2) and now considering 46/48 (removed 2) transitions.
[2024-05-24 14:34:49] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
// Phase 1: matrix 44 rows 38 cols
[2024-05-24 14:34:49] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 14:34:49] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 14:34:49] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2024-05-24 14:34:49] [INFO ] Invariant cache hit.
[2024-05-24 14:34:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 14:34:49] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 38/44 places, 46/50 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 140 ms. Remains : 38/44 places, 46/50 transitions.
[2024-05-24 14:34:49] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:49] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:49] [INFO ] Input system was already deterministic with 46 transitions.
RANDOM walk for 90 steps (0 resets) in 5 ms. (15 steps per ms) remains 0/1 properties
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-24 14:34:49] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:49] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15332277091373050692.gal : 1 ms
[2024-05-24 14:34:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6495216173366722256.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15332277091373050692.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6495216173366722256.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 14:34:49] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 44 cols
[2024-05-24 14:34:49] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 14:34:49] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 14:34:49] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:34:49] [INFO ] Invariant cache hit.
[2024-05-24 14:34:49] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 14:34:49] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-24 14:34:49] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:34:49] [INFO ] Invariant cache hit.
[2024-05-24 14:34:49] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:49] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 3 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:50] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 48/92 variables, 44/81 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:51] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 96 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1602 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 48/92 variables, 44/82 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 48/144 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:51] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:52] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:34:52] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/92 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 147 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1313 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 31/31 constraints]
After SMT, in 2929ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2930ms
Finished structural reductions in LTL mode , in 1 iterations and 2990 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 14:34:52] [INFO ] Flatten gal took : 7 ms
[2024-05-24 14:34:52] [INFO ] Flatten gal took : 5 ms
[2024-05-24 14:34:52] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-24 14:34:52] [INFO ] Flatten gal took : 4 ms
[2024-05-24 14:34:52] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:52] [INFO ] Time to serialize gal into /tmp/CTLFireability16228805548010303926.gal : 1 ms
[2024-05-24 14:34:52] [INFO ] Time to serialize properties into /tmp/CTLFireability11651917274643107763.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/CTLFireability16228805548010303926.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11651917274643107763.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 -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,380,0.023897,4008,2,569,5,2560,6,0,228,2590,0


Converting to forward existential form...Done !
original formula: !(E(!((((((P_b_4>=1)&&(P_setbi_11_2>=1))||((P_b_3>=1)&&(P_setbi_11_1>=1)))||(((P_b_5>=1)&&(P_setbi_11_2>=1))||((P_b_2>=1)&&(P_setbi_11_1>...2142
=> equivalent forward existential formula: ([(EY(FwdU(((FwdU(Init,!((((((P_b_4>=1)&&(P_setbi_11_2>=1))||((P_b_3>=1)&&(P_setbi_11_1>=1)))||(((P_b_5>=1)&&(P_...4311
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t12, t13, t16, t17, t18, t19, t32, t33, t34, t35, t36, t37, t42, t43,...284
(forward)formula 0,1,0.192571,11124,1,0,270,37641,156,115,1668,35456,297
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 14:34:52] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:34:52] [INFO ] Invariant cache hit.
[2024-05-24 14:34:53] [INFO ] Implicit Places using invariants in 37 ms returned [30, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/44 places, 50/50 transitions.
Applied a total of 0 rules in 0 ms. Remains 42 /42 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40 ms. Remains : 42/44 places, 50/50 transitions.
[2024-05-24 14:34:53] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:53] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:53] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-24 14:34:53] [INFO ] Flatten gal took : 2 ms
[2024-05-24 14:34:53] [INFO ] Flatten gal took : 2 ms
[2024-05-24 14:34:53] [INFO ] Time to serialize gal into /tmp/CTLFireability15425938380645664960.gal : 1 ms
[2024-05-24 14:34:53] [INFO ] Time to serialize properties into /tmp/CTLFireability4762440596442239794.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/CTLFireability15425938380645664960.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4762440596442239794.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E((!(EF(EX((((y_0>=1)&&(P_ify0_4_1>=1))||((y_0>=1)&&(P_ify0_4_2>=1)))))) * ((((y_1>=1)&&(P_ify0_4_1>=1))||((y_1>=1)&&(P_ify0_4_2>=1)))||(...830
=> equivalent forward existential formula: ([(EY(EY(FwdU(Init,(!(E(TRUE U EX((((y_0>=1)&&(P_ify0_4_1>=1))||((y_0>=1)&&(P_ify0_4_2>=1)))))) * ((((y_1>=1)&&(...1133
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t12, t13, t16, t17, t18, t19, t32, t33, t34, t35, t36, t37, t42, t43,...284
(forward)formula 0,1,0.133253,9600,1,0,165,30887,129,70,1470,26275,157
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 14:34:53] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:34:53] [INFO ] Invariant cache hit.
[2024-05-24 14:34:53] [INFO ] Implicit Places using invariants in 33 ms returned [30, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/44 places, 50/50 transitions.
Applied a total of 0 rules in 0 ms. Remains 42 /42 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 42/44 places, 50/50 transitions.
[2024-05-24 14:34:53] [INFO ] Flatten gal took : 2 ms
[2024-05-24 14:34:53] [INFO ] Flatten gal took : 2 ms
[2024-05-24 14:34:53] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-24 14:34:53] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:53] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:53] [INFO ] Time to serialize gal into /tmp/CTLFireability13210031731515746982.gal : 1 ms
[2024-05-24 14:34:53] [INFO ] Time to serialize properties into /tmp/CTLFireability15303340516667940321.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/CTLFireability13210031731515746982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15303340516667940321.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 -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,380,0.017592,4056,2,594,5,2612,6,0,220,2614,0


Converting to forward existential form...Done !
original formula: (EG(EX((((EF((((y_0>=1)&&(P_awaity_1>=1))||((y_0>=1)&&(P_awaity_2>=1)))) + ((P_b_3>=1)&&(P_setbi_5_1>=1))) + (((P_b_5>=1)&&(P_setbi_5_2>=...1196
=> equivalent forward existential formula: [FwdG(FwdU((Init * EG(EX((((E(TRUE U (((y_0>=1)&&(P_awaity_1>=1))||((y_0>=1)&&(P_awaity_2>=1)))) + ((P_b_3>=1)&&...1264
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t12, t13, t16, t17, t18, t19, t32, t33, t34, t35, t36, t37, t42, t43,...284
Using saturation style SCC detection
(forward)formula 0,0,0.20729,13824,1,0,271,53778,157,134,1539,49509,309
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 14:34:53] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:34:53] [INFO ] Invariant cache hit.
[2024-05-24 14:34:53] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 14:34:53] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:34:53] [INFO ] Invariant cache hit.
[2024-05-24 14:34:53] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 14:34:53] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-24 14:34:53] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:34:53] [INFO ] Invariant cache hit.
[2024-05-24 14:34:53] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:53] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-24 14:34:53] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-24 14:34:53] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-24 14:34:53] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-24 14:34:53] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-24 14:34:53] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-24 14:34:53] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:34:53] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-24 14:34:53] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-24 14:34:53] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:34:53] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-24 14:34:53] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-24 14:34:53] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-24 14:34:53] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-24 14:34:54] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-24 14:34:54] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-24 14:34:54] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-05-24 14:34:54] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:34:54] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-24 14:34:54] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:54] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:34:54] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-05-24 14:34:54] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-24 14:34:54] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:34:54] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-24 14:34:54] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:54] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 48/92 variables, 44/81 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:54] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 96 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1598 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 48/92 variables, 44/82 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 48/144 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:55] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:55] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-24 14:34:55] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/92 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 147 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1237 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 31/31 constraints]
After SMT, in 2844ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2845ms
Finished structural reductions in LTL mode , in 1 iterations and 2924 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 14:34:56] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:56] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:56] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-24 14:34:56] [INFO ] Flatten gal took : 2 ms
[2024-05-24 14:34:56] [INFO ] Flatten gal took : 2 ms
[2024-05-24 14:34:56] [INFO ] Time to serialize gal into /tmp/CTLFireability15303839604020642509.gal : 1 ms
[2024-05-24 14:34:56] [INFO ] Time to serialize properties into /tmp/CTLFireability13829971218473545885.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/CTLFireability15303839604020642509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13829971218473545885.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 -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,380,0.017562,4080,2,569,5,2560,6,0,228,2590,0


Converting to forward existential form...Done !
original formula: EX((((E(((((((y_1>=1)&&(P_CS_21_2>=1))||((y_0>=1)&&(P_CS_21_1>=1)))||(((y_0>=1)&&(P_CS_21_2>=1))||((y_2>=1)&&(P_CS_21_1>=1))))||(((y_2>=1...1069
=> equivalent forward existential formula: ((([(((FwdU(EY(Init),((((((y_1>=1)&&(P_CS_21_2>=1))||((y_0>=1)&&(P_CS_21_1>=1)))||(((y_0>=1)&&(P_CS_21_2>=1))||(...1641
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t12, t13, t16, t17, t18, t19, t32, t33, t34, t35, t36, t37, t42, t43,...284
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 12/45/38
(forward)formula 0,0,0.123615,9612,1,0,185,29250,134,89,1590,26111,170
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 0 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 14:34:56] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:34:56] [INFO ] Invariant cache hit.
[2024-05-24 14:34:56] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 14:34:56] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:34:56] [INFO ] Invariant cache hit.
[2024-05-24 14:34:56] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 14:34:56] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-24 14:34:56] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:34:56] [INFO ] Invariant cache hit.
[2024-05-24 14:34:56] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:56] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-24 14:34:56] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-24 14:34:56] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-24 14:34:56] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-24 14:34:56] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-24 14:34:56] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-24 14:34:56] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:34:56] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-24 14:34:56] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-24 14:34:56] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-24 14:34:57] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-24 14:34:57] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-24 14:34:57] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-05-24 14:34:57] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-05-24 14:34:57] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-24 14:34:57] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-24 14:34:57] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-24 14:34:57] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-24 14:34:57] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-24 14:34:57] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:57] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-24 14:34:57] [INFO ] Deduced a trap composed of 9 places in 14 ms of which 1 ms to minimize.
[2024-05-24 14:34:57] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-24 14:34:57] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-24 14:34:57] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-24 14:34:57] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:57] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 48/92 variables, 44/81 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:57] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 96 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1544 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 48/92 variables, 44/82 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 48/144 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:58] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:58] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:34:58] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/92 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 147 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1306 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 31/31 constraints]
After SMT, in 2869ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2871ms
Finished structural reductions in LTL mode , in 1 iterations and 2948 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 14:34:59] [INFO ] Flatten gal took : 6 ms
[2024-05-24 14:34:59] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:34:59] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-24 14:34:59] [INFO ] Flatten gal took : 2 ms
[2024-05-24 14:34:59] [INFO ] Flatten gal took : 2 ms
[2024-05-24 14:34:59] [INFO ] Time to serialize gal into /tmp/CTLFireability11081126078056310800.gal : 0 ms
[2024-05-24 14:34:59] [INFO ] Time to serialize properties into /tmp/CTLFireability2887321425912782588.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/CTLFireability11081126078056310800.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2887321425912782588.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (!(A((((((x_1>=1)&&(P_setx_3_2>=1))||((x_1>=1)&&(P_setx_3_1>=1)))||(((x_2>=1)&&(P_setx_3_1>=1))||((x_2>=1)&&(P_setx_3_2>=1))))||(((x_0>=1...1288
=> equivalent forward existential formula: ((([(EY((FwdU(Init,!(!((EX(((((y_2>=1)&&(P_ifyi_15_1>=1))||((y_0>=1)&&(P_ifyi_15_1>=1)))||(((y_1>=1)&&(P_ifyi_15...3305
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t12, t13, t16, t17, t18, t19, t32, t33, t34, t35, t36, t37, t42, t43,...284
Hit Full ! (commute/partial/dont) 36/5/14
(forward)formula 0,1,0.11907,8828,1,0,206,24930,145,100,1638,23599,183
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 14:34:59] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:34:59] [INFO ] Invariant cache hit.
[2024-05-24 14:34:59] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 14:34:59] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:34:59] [INFO ] Invariant cache hit.
[2024-05-24 14:34:59] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 14:34:59] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-24 14:34:59] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:34:59] [INFO ] Invariant cache hit.
[2024-05-24 14:34:59] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:34:59] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-24 14:34:59] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:34:59] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-24 14:34:59] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-24 14:34:59] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-24 14:34:59] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-24 14:35:00] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-24 14:35:00] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-24 14:35:00] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:35:00] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-24 14:35:00] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-24 14:35:00] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:35:00] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-24 14:35:00] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-24 14:35:00] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-24 14:35:00] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-24 14:35:00] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-24 14:35:00] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-24 14:35:00] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-24 14:35:00] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:00] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-24 14:35:00] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-24 14:35:00] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-24 14:35:00] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-24 14:35:00] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-24 14:35:00] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:00] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 48/92 variables, 44/81 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:00] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 96 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1619 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 48/92 variables, 44/82 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 48/144 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:01] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:02] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:35:02] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/92 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 147 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1289 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 31/31 constraints]
After SMT, in 2921ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2922ms
Finished structural reductions in LTL mode , in 1 iterations and 3000 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 14:35:02] [INFO ] Flatten gal took : 8 ms
[2024-05-24 14:35:02] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:35:02] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-24 14:35:02] [INFO ] Flatten gal took : 2 ms
[2024-05-24 14:35:02] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:35:02] [INFO ] Time to serialize gal into /tmp/CTLFireability8142215672746039271.gal : 1 ms
[2024-05-24 14:35:02] [INFO ] Time to serialize properties into /tmp/CTLFireability5783546895671146785.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/CTLFireability8142215672746039271.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5783546895671146785.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EF(EX(((EG((((((y_0>=1)&&(P_ify0_4_1>=1))||((y_0>=1)&&(P_ify0_4_2>=1)))||(((x_0>=1)&&(P_ifxi_10_2>=1))||((x_2>=1)&&(P_ifxi_10_1>=1))))||...1061
=> equivalent forward existential formula: [(FwdU(FwdU((Init * !(E(TRUE U EX(((EG((((((y_0>=1)&&(P_ify0_4_1>=1))||((y_0>=1)&&(P_ify0_4_2>=1)))||(((x_0>=1)&...1119
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t12, t13, t16, t17, t18, t19, t32, t33, t34, t35, t36, t37, t42, t43,...284
(forward)formula 0,1,0.178633,11700,1,0,242,44134,144,103,1597,37510,259
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 14:35:02] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:35:02] [INFO ] Invariant cache hit.
[2024-05-24 14:35:02] [INFO ] Implicit Places using invariants in 39 ms returned [30, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/44 places, 50/50 transitions.
Applied a total of 0 rules in 0 ms. Remains 42 /42 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 42/44 places, 50/50 transitions.
[2024-05-24 14:35:02] [INFO ] Flatten gal took : 2 ms
[2024-05-24 14:35:02] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:35:02] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-24 14:35:02] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:35:02] [INFO ] Flatten gal took : 2 ms
[2024-05-24 14:35:02] [INFO ] Time to serialize gal into /tmp/CTLFireability13463423008750684880.gal : 0 ms
[2024-05-24 14:35:02] [INFO ] Time to serialize properties into /tmp/CTLFireability14185943728467386083.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/CTLFireability13463423008750684880.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14185943728467386083.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 -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,380,0.021949,4320,2,594,5,2612,6,0,220,2614,0


Converting to forward existential form...Done !
original formula: EF(EX((AX((((y_0<1)||(P_ify0_4_1<1))&&((y_0<1)||(P_ify0_4_2<1)))) * AG((((y_2>=1)&&(P_ifyi_15_2>=1))||((y_1>=1)&&(P_ifyi_15_1>=1)))))))
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * !(EX(!((((y_0<1)||(P_ify0_4_1<1))&&((y_0<1)||(P_ify0_4_2<1))))))) * !(E(TRUE U !((((y_2...223
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t12, t13, t16, t17, t18, t19, t32, t33, t34, t35, t36, t37, t42, t43,...284
(forward)formula 0,0,0.080076,7224,1,0,129,16526,120,52,1434,14249,111
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 14:35:02] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:35:02] [INFO ] Invariant cache hit.
[2024-05-24 14:35:03] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 14:35:03] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:35:03] [INFO ] Invariant cache hit.
[2024-05-24 14:35:03] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 14:35:03] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-24 14:35:03] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:35:03] [INFO ] Invariant cache hit.
[2024-05-24 14:35:03] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 0 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-24 14:35:03] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:04] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 48/92 variables, 44/81 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:04] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 96 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1523 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 48/92 variables, 44/82 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 48/144 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:04] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:05] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:35:05] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/92 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 147 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1275 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 31/31 constraints]
After SMT, in 2806ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2807ms
Finished structural reductions in LTL mode , in 1 iterations and 2891 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 14:35:05] [INFO ] Flatten gal took : 5 ms
[2024-05-24 14:35:05] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:35:05] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-24 14:35:05] [INFO ] Flatten gal took : 7 ms
[2024-05-24 14:35:05] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:35:05] [INFO ] Time to serialize gal into /tmp/CTLFireability17432497982473598964.gal : 1 ms
[2024-05-24 14:35:05] [INFO ] Time to serialize properties into /tmp/CTLFireability16426712043976532724.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/CTLFireability17432497982473598964.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16426712043976532724.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 -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,380,0.024239,4076,2,569,5,2560,6,0,228,2590,0


Converting to forward existential form...Done !
original formula: EX(((((P_await_13_1>=1)&&(P_done_4>=1))&&(P_done_5>=1))||(((P_await_13_2>=1)&&(P_done_7>=1))&&(P_done_8>=1))))
=> equivalent forward existential formula: [(EY(Init) * ((((P_await_13_1>=1)&&(P_done_4>=1))&&(P_done_5>=1))||(((P_await_13_2>=1)&&(P_done_7>=1))&&(P_done_...173
(forward)formula 0,0,0.025869,4340,1,0,8,2560,8,1,343,2590,2
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 14:35:05] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:35:05] [INFO ] Invariant cache hit.
[2024-05-24 14:35:05] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 14:35:05] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:35:05] [INFO ] Invariant cache hit.
[2024-05-24 14:35:05] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 14:35:05] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-24 14:35:05] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:35:05] [INFO ] Invariant cache hit.
[2024-05-24 14:35:05] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 3 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-24 14:35:06] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:07] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 48/92 variables, 44/81 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:07] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 96 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1669 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 48/92 variables, 44/82 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 48/144 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:08] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:08] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-24 14:35:08] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/92 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 147 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1301 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 31/31 constraints]
After SMT, in 2982ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2983ms
Finished structural reductions in LTL mode , in 1 iterations and 3055 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 14:35:08] [INFO ] Flatten gal took : 6 ms
[2024-05-24 14:35:08] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:35:08] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-24 14:35:08] [INFO ] Flatten gal took : 2 ms
[2024-05-24 14:35:08] [INFO ] Flatten gal took : 2 ms
[2024-05-24 14:35:09] [INFO ] Time to serialize gal into /tmp/CTLFireability11800548316979559798.gal : 0 ms
[2024-05-24 14:35:09] [INFO ] Time to serialize properties into /tmp/CTLFireability12107007863721134735.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/CTLFireability11800548316979559798.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12107007863721134735.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 -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,380,0.024594,4080,2,569,5,2560,6,0,228,2590,0


Converting to forward existential form...Done !
original formula: EX(((AX(((((((y_2<1)||(P_ifyi_15_1<1))&&((y_0<1)||(P_ifyi_15_1<1)))&&(((y_1<1)||(P_ifyi_15_2<1))&&((y_0<1)||(P_ifyi_15_2<1))))&&((P_fordo...1102
=> equivalent forward existential formula: (([(EY(Init) * !(EX(!(((((((y_2<1)||(P_ifyi_15_1<1))&&((y_0<1)||(P_ifyi_15_1<1)))&&(((y_1<1)||(P_ifyi_15_2<1))&&...1225
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t12, t13, t16, t17, t18, t19, t32, t33, t34, t35, t36, t37, t42, t43,...284
(forward)formula 0,1,0.120641,8832,1,0,148,27133,121,61,1547,22743,128
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 14:35:09] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:35:09] [INFO ] Invariant cache hit.
[2024-05-24 14:35:09] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-24 14:35:09] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:35:09] [INFO ] Invariant cache hit.
[2024-05-24 14:35:09] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 14:35:09] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-24 14:35:09] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 14:35:09] [INFO ] Invariant cache hit.
[2024-05-24 14:35:09] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:09] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-24 14:35:09] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-24 14:35:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-24 14:35:09] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-24 14:35:09] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-24 14:35:09] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-24 14:35:09] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-24 14:35:09] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-24 14:35:09] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-24 14:35:09] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:35:09] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-24 14:35:09] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:35:09] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-24 14:35:09] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-05-24 14:35:09] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:35:09] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:35:09] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-24 14:35:09] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-24 14:35:09] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 3 ms to minimize.
[2024-05-24 14:35:09] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:09] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:35:09] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-05-24 14:35:10] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-24 14:35:10] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-24 14:35:10] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:35:10] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:10] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 48/92 variables, 44/81 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:10] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 96 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1586 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 48/92 variables, 44/82 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 48/144 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:11] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 14:35:11] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-24 14:35:11] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/92 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 147 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1312 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 31/31 constraints]
After SMT, in 2909ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2910ms
Finished structural reductions in LTL mode , in 1 iterations and 2977 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 14:35:12] [INFO ] Flatten gal took : 4 ms
[2024-05-24 14:35:12] [INFO ] Flatten gal took : 4 ms
[2024-05-24 14:35:12] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-24 14:35:12] [INFO ] Flatten gal took : 2 ms
[2024-05-24 14:35:12] [INFO ] Flatten gal took : 3 ms
[2024-05-24 14:35:12] [INFO ] Time to serialize gal into /tmp/CTLFireability10189013704992427275.gal : 0 ms
[2024-05-24 14:35:12] [INFO ] Time to serialize properties into /tmp/CTLFireability13803775672888626930.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/CTLFireability10189013704992427275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13803775672888626930.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 -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,380,0.023728,4080,2,569,5,2560,6,0,228,2590,0


Converting to forward existential form...Done !
original formula: (EF(((EF((((((y_2<1)||(P_sety_9_2<1))&&((y_0<1)||(P_sety_9_1<1)))&&(((y_2<1)||(P_sety_9_1<1))&&((y_1<1)||(P_sety_9_1<1))))&&(((y_1<1)||(P...2089
=> equivalent forward existential formula: (([FwdG((FwdU(Init,TRUE) * (E(TRUE U (((((y_2<1)||(P_sety_9_2<1))&&((y_0<1)||(P_sety_9_1<1)))&&(((y_2<1)||(P_set...4057
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t12, t13, t16, t17, t18, t19, t32, t33, t34, t35, t36, t37, t42, t43,...284
Hit Full ! (commute/partial/dont) 32/7/18
(forward)formula 0,1,0.165744,10944,1,0,207,37854,143,90,1639,37517,225
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-24 14:35:12] [INFO ] Flatten gal took : 7 ms
[2024-05-24 14:35:12] [INFO ] Flatten gal took : 7 ms
Total runtime 28029 ms.

BK_STOP 1716561312374

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-COL-2, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r224-tall-171649612300202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-2.tgz
mv LamportFastMutEx-COL-2 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;