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.r233-tall-171649622600144.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-5, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-171649622600144
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 7.6K Apr 13 07:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 13 07:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 07:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 13 07:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 5.7K Apr 13 07:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 44K Apr 13 07:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 13 07:51 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 41K 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

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1716538948202

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=LamportFastMutEx-COL-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
Liveness COL
Running Version 202405141337
[2024-05-24 08:22:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-24 08:22:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 08:22:29] [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 08:22:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 08:22:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 562 ms
[2024-05-24 08:22:30] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 174 PT places and 396.0 transition bindings in 15 ms.
[2024-05-24 08:22:30] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2024-05-24 08:22:30] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2024-05-24 08:22:30] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions 1380 arcs in 22 ms.
[2024-05-24 08:22:30] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2024-05-24 08:22:30] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions 1380 arcs in 6 ms.
[2024-05-24 08:22:30] [INFO ] Unfolded 17 HLPN properties in 1 ms.
[2024-05-24 08:22:30] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 0 ms.
[2024-05-24 08:22:30] [INFO ] Skeletonized 17 HLPN properties in 1 ms.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Domain [pid(6), pid(6)] 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 08:22:30] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions 1380 arcs in 15 ms.
[2024-05-24 08:22:30] [INFO ] Unfolded 17 HLPN properties in 1 ms.
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 58 transitions.
Built sparse matrix representations for Structural reductions in 1 ms.18692KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 137/137 places, 260/260 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Applied a total of 0 rules in 20 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 30 ms. Remains : 137/137 places, 260/260 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 137/137 places, 260/260 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Applied a total of 0 rules in 12 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-24 08:22:30] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2024-05-24 08:22:30] [INFO ] Computed 37 invariants in 21 ms
[2024-05-24 08:22:30] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-24 08:22:30] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2024-05-24 08:22:30] [INFO ] Invariant cache hit.
[2024-05-24 08:22:30] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-24 08:22:30] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-24 08:22:30] [INFO ] Redundant transitions in 10 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-24 08:22:30] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2024-05-24 08:22:30] [INFO ] Invariant cache hit.
[2024-05-24 08:22:30] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-24 08:22:31] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 13 ms to minimize.
[2024-05-24 08:22:31] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-24 08:22:31] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-24 08:22:31] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-24 08:22:32] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-24 08:22:32] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-24 08:22:32] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2024-05-24 08:22:32] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:22:32] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-24 08:22:32] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-24 08:22:32] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 3 ms to minimize.
[2024-05-24 08:22:32] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 2 ms to minimize.
[2024-05-24 08:22:32] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-24 08:22:32] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-24 08:22:32] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-24 08:22:32] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-24 08:22:32] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-24 08:22:32] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-24 08:22:32] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-24 08:22:32] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD118 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 20/57 constraints. Problems are: Problem set: 8 solved, 247 unsolved
[2024-05-24 08:22:33] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-24 08:22:33] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-24 08:22:33] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-24 08:22:33] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-24 08:22:33] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-24 08:22:33] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-24 08:22:33] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-24 08:22:33] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-24 08:22:33] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-24 08:22:33] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-24 08:22:33] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-24 08:22:33] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-05-24 08:22:33] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-24 08:22:33] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-24 08:22:33] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 5 ms to minimize.
[2024-05-24 08:22:33] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-24 08:22:33] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-24 08:22:33] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-24 08:22:34] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-24 08:22:34] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 20/77 constraints. Problems are: Problem set: 29 solved, 226 unsolved
[2024-05-24 08:22:34] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-24 08:22:34] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-24 08:22:34] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-24 08:22:34] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-24 08:22:34] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-24 08:22:34] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-24 08:22:34] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-05-24 08:22:34] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-24 08:22:34] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-24 08:22:34] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-24 08:22:34] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
[2024-05-24 08:22:34] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-24 08:22:35] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-24 08:22:35] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-24 08:22:35] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-24 08:22:35] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2024-05-24 08:22:35] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 4 ms to minimize.
[2024-05-24 08:22:35] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-24 08:22:35] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-24 08:22:35] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 20/97 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 08:22:36] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-24 08:22:36] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-24 08:22:36] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-24 08:22:36] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-24 08:22:36] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-24 08:22:36] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-24 08:22:37] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-05-24 08:22:37] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-24 08:22:37] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-24 08:22:37] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-24 08:22:37] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-24 08:22:37] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2024-05-24 08:22:37] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-24 08:22:37] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-24 08:22:37] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-24 08:22:37] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-24 08:22:37] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-24 08:22:37] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:22:37] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-24 08:22:37] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 20/117 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 08:22:38] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-24 08:22:38] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-24 08:22:38] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-24 08:22:38] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:22:38] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-24 08:22:38] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-24 08:22:38] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-24 08:22:38] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-24 08:22:38] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-24 08:22:38] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-24 08:22:38] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-24 08:22:38] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-24 08:22:38] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:22:38] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-24 08:22:39] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-24 08:22:39] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-24 08:22:39] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-24 08:22:39] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-24 08:22:39] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:22:39] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 20/137 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 08:22:39] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:22:39] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2024-05-24 08:22:39] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-24 08:22:39] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-24 08:22:39] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-24 08:22:39] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-24 08:22:40] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-24 08:22:40] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-24 08:22:40] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:22:40] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-24 08:22:40] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-24 08:22:40] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-24 08:22:40] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-24 08:22:40] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-24 08:22:40] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-24 08:22:40] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 16/153 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/153 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 200/337 variables, 137/290 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 55/345 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/345 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 08:22:46] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-24 08:22:46] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/337 variables, 2/347 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 0/347 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 13 (OVERLAPS) 0/337 variables, 0/347 constraints. Problems are: Problem set: 30 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 347 constraints, problems are : Problem set: 30 solved, 225 unsolved in 20896 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 118/118 constraints]
Escalating to Integer solving :Problem set: 30 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 7/7 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 62/69 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/69 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 5/137 variables, 30/99 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 56/155 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 08:22:52] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-24 08:22:53] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-24 08:22:53] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-24 08:22:53] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-24 08:22:53] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-24 08:22:53] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-24 08:22:53] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-24 08:22:53] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-24 08:22:53] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-24 08:22:53] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-24 08:22:53] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-24 08:22:53] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-24 08:22:53] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-24 08:22:53] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-24 08:22:54] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:22:54] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 16/171 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 08:22:54] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-24 08:22:54] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-24 08:22:54] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 3/174 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 08:22:55] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-24 08:22:55] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-24 08:22:55] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-24 08:22:55] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-24 08:22:56] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-24 08:22:56] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
[2024-05-24 08:22:56] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-24 08:22:56] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-24 08:22:56] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-24 08:22:56] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 10/184 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 08:22:56] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-24 08:22:56] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-24 08:22:56] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-24 08:22:56] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-24 08:22:56] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-24 08:22:57] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-24 08:22:57] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-24 08:22:57] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-24 08:22:57] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-24 08:22:57] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-24 08:22:57] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-24 08:22:57] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-24 08:22:57] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-24 08:22:57] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-24 08:22:57] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:22:57] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-24 08:22:57] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-24 08:22:58] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:22:58] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-24 08:22:58] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 20/204 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/204 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 200/337 variables, 137/341 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 55/396 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 225/621 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 08:23:03] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-24 08:23:03] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-24 08:23:04] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-24 08:23:04] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-24 08:23:04] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-24 08:23:04] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-24 08:23:04] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-24 08:23:04] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-24 08:23:04] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/337 variables, 9/630 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 08:23:09] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:23:09] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-24 08:23:09] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-24 08:23:09] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-24 08:23:09] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2024-05-24 08:23:09] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-24 08:23:10] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-24 08:23:10] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-24 08:23:10] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-24 08:23:10] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-24 08:23:10] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-24 08:23:10] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-24 08:23:10] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-24 08:23:10] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:23:10] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-24 08:23:10] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-24 08:23:10] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:23:11] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-24 08:23:11] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/337 variables, 19/649 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 08:23:16] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-24 08:23:16] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-24 08:23:16] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-24 08:23:16] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:23:16] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-24 08:23:16] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-24 08:23:17] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:23:17] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/337 variables, 8/657 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 657 constraints, problems are : Problem set: 30 solved, 225 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 225/255 constraints, Known Traps: 203/203 constraints]
After SMT, in 51120ms problems are : Problem set: 30 solved, 225 unsolved
Search for dead transitions found 30 dead transitions in 51140ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 137/137 places, 230/260 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Applied a total of 0 rules in 9 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2024-05-24 08:23:21] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 51521 ms. Remains : 137/137 places, 230/260 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1727 ms (no deadlock found). (steps per millisecond=723 )
Random directed walk for 1250005 steps, including 0 resets, run took 1422 ms (no deadlock found). (steps per millisecond=879 )
[2024-05-24 08:23:24] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
// Phase 1: matrix 180 rows 137 cols
[2024-05-24 08:23:24] [INFO ] Computed 37 invariants in 6 ms
[2024-05-24 08:23:24] [INFO ] [Real]Absence check using 37 positive place invariants in 8 ms returned sat
[2024-05-24 08:23:25] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-24 08:23:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:23:25] [INFO ] [Nat]Absence check using 37 positive place invariants in 8 ms returned sat
[2024-05-24 08:23:25] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-24 08:23:25] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-24 08:23:25] [INFO ] [Nat]Added 50 Read/Feed constraints in 9 ms returned sat
[2024-05-24 08:23:25] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-24 08:23:25] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-24 08:23:25] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-24 08:23:25] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-24 08:23:25] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-24 08:23:25] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-24 08:23:25] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-24 08:23:25] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-24 08:23:25] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-24 08:23:25] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-24 08:23:25] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-24 08:23:25] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-24 08:23:25] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-24 08:23:25] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-24 08:23:25] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-24 08:23:25] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-24 08:23:26] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-24 08:23:26] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-24 08:23:26] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-24 08:23:26] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-24 08:23:26] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-24 08:23:26] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-24 08:23:26] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-24 08:23:26] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-24 08:23:26] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-24 08:23:26] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-24 08:23:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 26 trap constraints in 1218 ms
[2024-05-24 08:23:26] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions 1380 arcs in 6 ms.
[2024-05-24 08:23:26] [INFO ] Unfolded 17 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 58 transitions.
RANDOM walk for 265 steps (0 resets) in 41 ms. (6 steps per ms) remains 0/16 properties
[2024-05-24 08:23:26] [INFO ] Flatten gal took : 50 ms
[2024-05-24 08:23:26] [INFO ] Flatten gal took : 42 ms
[2024-05-24 08:23:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16112526880535655474.gal : 40 ms
[2024-05-24 08:23:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15919980575172306936.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/ReachabilityCardinality16112526880535655474.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15919980575172306936.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)
Able to resolve query QuasiLiveness after proving 17 properties.
Net is quasi-live, checking if it is reversible to establish liveness.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 58 transitions.
[2024-05-24 08:23:26] [INFO ] Flatten gal took : 40 ms
[2024-05-24 08:23:26] [INFO ] Flatten gal took : 27 ms
[2024-05-24 08:23:26] [INFO ] Time to serialize gal into /tmp/CTLFireability10793045399632173033.gal : 4 ms
[2024-05-24 08:23:26] [INFO ] Time to serialize properties into /tmp/CTLFireability3447450875408296935.ctl : 9 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/CTLFireability10793045399632173033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3447450875408296935.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.
Detected timeout of ITS tools.
[2024-05-24 08:23:29] [INFO ] Flatten gal took : 19 ms
[2024-05-24 08:23:29] [INFO ] Applying decomposition
[2024-05-24 08:23:29] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14579125187502574160.txt' '-o' '/tmp/graph14579125187502574160.bin' '-w' '/tmp/graph14579125187502574160.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14579125187502574160.bin' '-l' '-1' '-v' '-w' '/tmp/graph14579125187502574160.weights' '-q' '0' '-e' '0.001'
[2024-05-24 08:23:30] [INFO ] Decomposing Gal with order
[2024-05-24 08:23:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 08:23:30] [INFO ] Removed a total of 358 redundant transitions.
[2024-05-24 08:23:30] [INFO ] Flatten gal took : 46 ms
[2024-05-24 08:23:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 17 ms.
[2024-05-24 08:23:30] [INFO ] Time to serialize gal into /tmp/CTLFireability3105349999141230628.gal : 13 ms
[2024-05-24 08:23:30] [INFO ] Time to serialize properties into /tmp/CTLFireability15137968113768795235.ctl : 3 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/CTLFireability3105349999141230628.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15137968113768795235.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 08:23:33] [INFO ] Flatten gal took : 13 ms
[2024-05-24 08:23:33] [INFO ] Flatten gal took : 12 ms
[2024-05-24 08:23:33] [INFO ] Time to serialize gal into /tmp/CTLFireability17925018655441371479.gal : 2 ms
[2024-05-24 08:23:33] [INFO ] Time to serialize properties into /tmp/CTLFireability14034553196849239723.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/CTLFireability17925018655441371479.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14034553196849239723.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.
Detected timeout of ITS tools.
[2024-05-24 08:24:03] [INFO ] Flatten gal took : 15 ms
[2024-05-24 08:24:03] [INFO ] Applying decomposition
[2024-05-24 08:24:03] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph873005935117838866.txt' '-o' '/tmp/graph873005935117838866.bin' '-w' '/tmp/graph873005935117838866.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph873005935117838866.bin' '-l' '-1' '-v' '-w' '/tmp/graph873005935117838866.weights' '-q' '0' '-e' '0.001'
[2024-05-24 08:24:03] [INFO ] Decomposing Gal with order
[2024-05-24 08:24:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 08:24:03] [INFO ] Removed a total of 358 redundant transitions.
[2024-05-24 08:24:03] [INFO ] Flatten gal took : 28 ms
[2024-05-24 08:24:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 17 ms.
[2024-05-24 08:24:03] [INFO ] Time to serialize gal into /tmp/CTLFireability8205925633071682754.gal : 8 ms
[2024-05-24 08:24:03] [INFO ] Time to serialize properties into /tmp/CTLFireability7667652952750883723.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/CTLFireability8205925633071682754.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7667652952750883723.ctl'

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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 08:24:33] [INFO ] Flatten gal took : 13 ms
[2024-05-24 08:24:33] [INFO ] Flatten gal took : 9 ms
[2024-05-24 08:24:33] [INFO ] Time to serialize gal into /tmp/CTLFireability10894574423038046338.gal : 2 ms
[2024-05-24 08:24:33] [INFO ] Time to serialize properties into /tmp/CTLFireability13274325627490300401.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/CTLFireability10894574423038046338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13274325627490300401.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,5.30682e+08,110.278,2290888,2,318835,5,5.79156e+06,6,0,810,8.41566e+06,0


Converting to forward existential form...Done !
original formula: AG(EF((((((((((P_start_1_1==1)&&(P_start_1_2==1))&&((P_start_1_3==1)&&(P_start_1_4==1)))&&(((P_start_1_5==1)&&(x_0==1))&&((x_1==0)&&(x_2=...2492
Detected timeout of ITS tools.
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((((P_start_1_1==1)&&(P_start_1_2==1))&&((P_start_1_3==1)&&(P_start_1_4==1))...1603
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)
[2024-05-24 08:29:33] [INFO ] Flatten gal took : 11 ms
[2024-05-24 08:29:33] [INFO ] Applying decomposition
[2024-05-24 08:29:33] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2298930280587045662.txt' '-o' '/tmp/graph2298930280587045662.bin' '-w' '/tmp/graph2298930280587045662.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2298930280587045662.bin' '-l' '-1' '-v' '-w' '/tmp/graph2298930280587045662.weights' '-q' '0' '-e' '0.001'
[2024-05-24 08:29:33] [INFO ] Decomposing Gal with order
[2024-05-24 08:29:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 08:29:33] [INFO ] Removed a total of 358 redundant transitions.
[2024-05-24 08:29:33] [INFO ] Flatten gal took : 17 ms
[2024-05-24 08:29:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 6 ms.
[2024-05-24 08:29:33] [INFO ] Time to serialize gal into /tmp/CTLFireability4035314505603382724.gal : 3 ms
[2024-05-24 08:29:33] [INFO ] Time to serialize properties into /tmp/CTLFireability14461332130622944395.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/CTLFireability4035314505603382724.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14461332130622944395.ctl'

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 -...263
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,5.30682e+08,25.9709,615440,5634,48,1.06274e+06,384,606,1.86162e+06,59,1276,0


Converting to forward existential form...Done !
original formula: AG(EF((((((((((i0.i0.u0.P_start_1_1==1)&&(i1.u1.P_start_1_2==1))&&((i6.u45.P_start_1_3==1)&&(i2.i0.u3.P_start_1_4==1)))&&(((i3.u4.P_start...3508
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((((i0.i0.u0.P_start_1_1==1)&&(i1.u1.P_start_1_2==1))&&((i6.u45.P_start_1_3=...3568
Reverse transition relation is NOT exact ! Due to transitions T_setbi_2P_bi1i3, T_setx_3x0i1, T_setx_3x0i2, T_setx_3x0i3, T_setx_3x0i4, T_setx_3x0i5, T_set...2236
(forward)formula 0,0,29.8507,615440,1,0,1.06274e+06,452,3596,1.86162e+06,280,1943,947353
ITS tools runner thread asked to quit. Dying gracefully.
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 58 transitions.
[2024-05-24 08:30:03] [INFO ] Flatten gal took : 12 ms
[2024-05-24 08:30:03] [INFO ] Flatten gal took : 11 ms
[2024-05-24 08:30:03] [INFO ] Time to serialize gal into /tmp/CTLFireability12681106826549893216.gal : 2 ms
[2024-05-24 08:30:03] [INFO ] Time to serialize properties into /tmp/CTLFireability13857801611777633218.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/CTLFireability12681106826549893216.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13857801611777633218.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 17 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 08:30:06] [INFO ] Flatten gal took : 12 ms
[2024-05-24 08:30:06] [INFO ] Applying decomposition
[2024-05-24 08:30:06] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15267514716452173405.txt' '-o' '/tmp/graph15267514716452173405.bin' '-w' '/tmp/graph15267514716452173405.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15267514716452173405.bin' '-l' '-1' '-v' '-w' '/tmp/graph15267514716452173405.weights' '-q' '0' '-e' '0.001'
[2024-05-24 08:30:06] [INFO ] Decomposing Gal with order
[2024-05-24 08:30:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 08:30:07] [INFO ] Removed a total of 363 redundant transitions.
[2024-05-24 08:30:07] [INFO ] Flatten gal took : 23 ms
[2024-05-24 08:30:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 6 ms.
[2024-05-24 08:30:07] [INFO ] Time to serialize gal into /tmp/CTLFireability2616931850806799380.gal : 3 ms
[2024-05-24 08:30:07] [INFO ] Time to serialize properties into /tmp/CTLFireability501130917129062087.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/CTLFireability2616931850806799380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability501130917129062087.ctl'

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 -...261
No direction supplied, using forward translation only.
Parsed 17 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 08:30:10] [INFO ] Flatten gal took : 10 ms
[2024-05-24 08:30:10] [INFO ] Flatten gal took : 11 ms
[2024-05-24 08:30:10] [INFO ] Time to serialize gal into /tmp/CTLFireability11894686139841506050.gal : 1 ms
[2024-05-24 08:30:10] [INFO ] Time to serialize properties into /tmp/CTLFireability11653785760954462466.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/CTLFireability11894686139841506050.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11653785760954462466.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 17 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 08:30:40] [INFO ] Flatten gal took : 12 ms
[2024-05-24 08:30:40] [INFO ] Applying decomposition
[2024-05-24 08:30:40] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2677826773568011147.txt' '-o' '/tmp/graph2677826773568011147.bin' '-w' '/tmp/graph2677826773568011147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2677826773568011147.bin' '-l' '-1' '-v' '-w' '/tmp/graph2677826773568011147.weights' '-q' '0' '-e' '0.001'
[2024-05-24 08:30:40] [INFO ] Decomposing Gal with order
[2024-05-24 08:30:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 08:30:40] [INFO ] Removed a total of 358 redundant transitions.
[2024-05-24 08:30:40] [INFO ] Flatten gal took : 19 ms
[2024-05-24 08:30:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 10 ms.
[2024-05-24 08:30:40] [INFO ] Time to serialize gal into /tmp/CTLFireability18057381791836425019.gal : 4 ms
[2024-05-24 08:30:40] [INFO ] Time to serialize properties into /tmp/CTLFireability1629379797666073433.ctl : 3 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/CTLFireability18057381791836425019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1629379797666073433.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 17 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,5.30682e+08,20.9536,511852,3766,47,846021,392,617,1.76206e+06,56,1449,0


Converting to forward existential form...Done !
original formula: AG(EF(((((((i2.i0.u3.P_start_1_4>=1)&&(i2.i0.u3.P_b_8>=1))||((i2.i0.u3.P_start_1_4>=1)&&(i2.i0.u3.P_b_9>=1)))||(((i4.i0.u2.P_start_1_3>=1...522
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((i2.i0.u3.P_start_1_4>=1)&&(i2.i0.u3.P_b_8>=1))||((i2.i0.u3.P_start_1_4>=1)&...582
Reverse transition relation is NOT exact ! Due to transitions T_setbi_2P_bi1i1, T_setx_3x0i1, T_setx_3x0i2, T_setx_3x0i3, T_setx_3x0i4, T_setx_3x0i5, T_set...2296
Detected timeout of ITS tools.
[2024-05-24 08:31:10] [INFO ] Flatten gal took : 9 ms
[2024-05-24 08:31:10] [INFO ] Flatten gal took : 9 ms
[2024-05-24 08:31:10] [INFO ] Time to serialize gal into /tmp/CTLFireability11426838705626855833.gal : 2 ms
[2024-05-24 08:31:10] [INFO ] Time to serialize properties into /tmp/CTLFireability14853446636749113752.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/CTLFireability11426838705626855833.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14853446636749113752.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 17 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,5.30682e+08,110.254,2292336,2,318835,5,5.79156e+06,6,0,810,8.41566e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-24 08:36:10] [INFO ] Flatten gal took : 9 ms
[2024-05-24 08:36:10] [INFO ] Applying decomposition
[2024-05-24 08:36:10] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12384194758594486369.txt' '-o' '/tmp/graph12384194758594486369.bin' '-w' '/tmp/graph12384194758594486369.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12384194758594486369.bin' '-l' '-1' '-v' '-w' '/tmp/graph12384194758594486369.weights' '-q' '0' '-e' '0.001'
[2024-05-24 08:36:10] [INFO ] Decomposing Gal with order
[2024-05-24 08:36:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 08:36:10] [INFO ] Removed a total of 358 redundant transitions.
[2024-05-24 08:36:10] [INFO ] Flatten gal took : 18 ms
[2024-05-24 08:36:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 4 ms.
[2024-05-24 08:36:10] [INFO ] Time to serialize gal into /tmp/CTLFireability10268214185764456958.gal : 2 ms
[2024-05-24 08:36:10] [INFO ] Time to serialize properties into /tmp/CTLFireability6913072255381077858.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/CTLFireability10268214185764456958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6913072255381077858.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 17 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,5.30682e+08,25.7704,510924,5764,45,781295,428,646,2.20224e+06,59,1643,0


Converting to forward existential form...Done !
original formula: AG(EF(((((((i0.u3.P_start_1_4>=1)&&(i0.u3.P_b_8>=1))||((i0.u3.P_start_1_4>=1)&&(i0.u3.P_b_9>=1)))||(((i5.i0.u2.P_start_1_3>=1)&&(i5.i0.u2...522
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((i0.u3.P_start_1_4>=1)&&(i0.u3.P_b_8>=1))||((i0.u3.P_start_1_4>=1)&&(i0.u3.P...582
Reverse transition relation is NOT exact ! Due to transitions T_setbi_2P_bi1i1, T_setx_3x0i1, T_setx_3x0i2, T_setx_3x0i3, T_setx_3x0i4, T_setx_3x0i5, T_set...2261
(forward)formula 0,1,54.8786,629004,1,0,925435,535,2964,3.43927e+06,236,2499,1808560
Formula is TRUE !

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

original formula: AG(EF((((((((u13.x_0>=1)&&(i0.u9.P_setx_3_4>=1))||((u13.x_0>=1)&&(i1.i0.u8.P_setx_3_5>=1)))||(((i0.u9.x_4>=1)&&(i4.i0.u6.P_setx_3_2>=1))|...1401
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((u13.x_0>=1)&&(i0.u9.P_setx_3_4>=1))||((u13.x_0>=1)&&(i1.i0.u8.P_setx_3_5>=...1461
(forward)formula 1,1,71.2902,828324,1,0,1.27123e+06,538,3079,4.03871e+06,236,2513,2442032
Formula is TRUE !

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

original formula: AG(EF((((((((i1.i0.u14.y_5>=1)&&(i1.i0.u8.P_ify0_4_5>=1))||((i6.u12.y_4>=1)&&(i1.i0.u8.P_ify0_4_5>=1)))||(((i6.u12.y_4>=1)&&(i0.u9.P_ify0...1167
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((i1.i0.u14.y_5>=1)&&(i1.i0.u8.P_ify0_4_5>=1))||((i6.u12.y_4>=1)&&(i1.i0.u8....1227
(forward)formula 2,1,105.314,1295020,1,0,2.04979e+06,543,3183,5.69228e+06,236,2538,3823675
Formula is TRUE !

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

original formula: AG(EF(((((((i0.u3.P_b_9>=1)&&(i0.u9.P_setbi_5_4>=1))||((i4.i0.u1.P_b_5>=1)&&(i4.i0.u6.P_setbi_5_2>=1)))||(((i1.i0.u4.P_b_10>=1)&&(i1.i0.u...520
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((i0.u3.P_b_9>=1)&&(i0.u9.P_setbi_5_4>=1))||((i4.i0.u1.P_b_5>=1)&&(i4.i0.u6.P...580
(forward)formula 3,1,136.422,1655380,1,0,2.67832e+06,543,3248,6.6824e+06,236,2538,4889020
Formula is TRUE !

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

original formula: AG(EF((((((i6.u46.y_0>=1)&&(i3.u42.P_awaity_1>=1))||((i6.u46.y_0>=1)&&(i4.i0.u40.P_awaity_2>=1)))||(((i6.u46.y_0>=1)&&(i5.i0.u41.P_awaity...256
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((i6.u46.y_0>=1)&&(i3.u42.P_awaity_1>=1))||((i6.u46.y_0>=1)&&(i4.i0.u40.P_awai...316
(forward)formula 4,1,205.374,2227992,1,0,3.64222e+06,564,1633,9.06265e+06,137,2628,2327027
Formula is TRUE !

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

original formula: AG(EF((((((i6.u46.y_0>=1)&&(i1.i0.u8.P_ify0_4_5>=1))||((i6.u46.y_0>=1)&&(i0.u9.P_ify0_4_4>=1)))||(((i6.u46.y_0>=1)&&(i5.i0.u7.P_ify0_4_3>...251
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((i6.u46.y_0>=1)&&(i1.i0.u8.P_ify0_4_5>=1))||((i6.u46.y_0>=1)&&(i0.u9.P_ify0_4...311
(forward)formula 5,1,236.099,2227992,1,0,3.64222e+06,564,1660,9.06265e+06,137,2628,4030488
Formula is TRUE !

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

original formula: AG(EF((((((((i6.u46.y_0>=1)&&(u11.P_sety_9_3>=1))||((i1.i0.u14.y_5>=1)&&(i6.u12.P_sety_9_4>=1)))||(((i6.u46.y_0>=1)&&(i6.u10.P_sety_9_2>=...1354
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((i6.u46.y_0>=1)&&(u11.P_sety_9_3>=1))||((i1.i0.u14.y_5>=1)&&(i6.u12.P_sety_...1414
(forward)formula 6,1,259.379,2227992,1,0,3.64222e+06,564,1823,9.06265e+06,140,2628,5003136
Formula is TRUE !

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

original formula: AG(EF((((((((i4.i0.u6.x_2>=1)&&(i6.u12.P_ifxi_10_4>=1))||((i4.i0.u6.x_2>=1)&&(i1.i0.u14.P_ifxi_10_5>=1)))||(((i3.u5.x_1>=1)&&(i6.u10.P_if...1158
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((i4.i0.u6.x_2>=1)&&(i6.u12.P_ifxi_10_4>=1))||((i4.i0.u6.x_2>=1)&&(i1.i0.u14...1218
(forward)formula 7,1,296.105,2266068,1,0,3.69069e+06,564,1924,9.38293e+06,142,2628,7038902
Formula is TRUE !
Detected timeout of ITS tools.
[2024-05-24 08:41:10] [INFO ] Flatten gal took : 8 ms
[2024-05-24 08:41:10] [INFO ] Flatten gal took : 7 ms
[2024-05-24 08:41:10] [INFO ] Time to serialize gal into /tmp/CTLFireability12148755940581125525.gal : 1 ms
[2024-05-24 08:41:10] [INFO ] Time to serialize properties into /tmp/CTLFireability4337186106281480078.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/CTLFireability12148755940581125525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4337186106281480078.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 9 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,5.30682e+08,111.354,2293784,2,318835,5,5.79156e+06,6,0,810,8.41566e+06,0


Converting to forward existential form...Done !
original formula: AG(EF(((((((P_b_11>=1)&&(P_setbi_11_5>=1))||((P_b_2>=1)&&(P_setbi_11_1>=1)))||(((P_b_4>=1)&&(P_setbi_11_2>=1))||((P_b_9>=1)&&(P_setbi_11_...374
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((P_b_11>=1)&&(P_setbi_11_5>=1))||((P_b_2>=1)&&(P_setbi_11_1>=1)))||(((P_b_4>...434
Reverse transition relation is NOT exact ! Due to transitions T_setx_3x0i1, T_setx_3x0i2, T_setx_3x0i3, T_setx_3x0i4, T_setx_3x0i5, T_setx_3x1i1, T_setx_3x...2208

BK_TIME_CONFINEMENT_REACHED

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

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-5"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-171649622600144"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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