Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 40K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1748771021754

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-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
Liveness COL
Running Version 202505121319
[2025-06-01 09:43:42] [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]
[2025-06-01 09:43:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 09:43:43] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-01 09:43:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 09:43:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 523 ms
[2025-06-01 09:43:43] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 135 PT places and 285.0 transition bindings in 18 ms.
[2025-06-01 09:43:43] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2025-06-01 09:43:43] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2025-06-01 09:43:43] [INFO ] Unfolded HLPN to a Petri net with 135 places and 230 transitions 990 arcs in 18 ms.
[2025-06-01 09:43:43] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2025-06-01 09:43:43] [INFO ] Unfolded HLPN to a Petri net with 135 places and 230 transitions 990 arcs in 5 ms.
[2025-06-01 09:43:43] [INFO ] Unfolded 17 HLPN properties in 0 ms.
[2025-06-01 09:43:43] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 0 ms.
[2025-06-01 09:43:43] [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(5), pid(5)] 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.
[2025-06-01 09:43:43] [INFO ] Unfolded HLPN to a Petri net with 135 places and 230 transitions 990 arcs in 12 ms.
[2025-06-01 09:43:43] [INFO ] Unfolded 17 HLPN properties in 1 ms.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 50 transitions.
Built sparse matrix representations for Structural reductions in 1 ms.19390KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 102/102 places, 180/180 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Applied a total of 0 rules in 15 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 23 ms. Remains : 102/102 places, 180/180 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 102/102 places, 180/180 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Applied a total of 0 rules in 10 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2025-06-01 09:43:43] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2025-06-01 09:43:43] [INFO ] Computed 26 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 09:43:43] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-06-01 09:43:43] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2025-06-01 09:43:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 09:43:44] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 09:43:44] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 09:43:44] [INFO ] Redundant transitions in 5 ms returned []
Running 176 sub problems to find dead transitions.
[2025-06-01 09:43:44] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2025-06-01 09:43:44] [INFO ] Invariant cache hit.
[2025-06-01 09:43:44] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:45] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 22 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:45] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 6 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:45] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 5 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:45] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 5 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:45] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:45] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:45] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:45] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:45] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:45] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:45] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:45] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:45] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:46] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 5 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:46] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:46] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:46] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:46] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:46] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 5 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:46] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 20/46 constraints. Problems are: Problem set: 18 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:46] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:46] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:46] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 5 ms to minimize.
Problem TDEAD45 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:46] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 2 ms to minimize.
Problem TDEAD46 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:46] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:46] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:46] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:47] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:47] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 2 ms to minimize.
Problem TDEAD80 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:47] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 5 ms to minimize.
Problem TDEAD84 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:47] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 6 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:47] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:47] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:47] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:47] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:47] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:47] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:47] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:47] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:47] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 3 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 20/66 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:48] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:48] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:48] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:48] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:48] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:48] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:48] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:48] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 8/74 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:49] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:49] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:49] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:49] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:49] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 5/79 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:49] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/80 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/80 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 144/246 variables, 102/182 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 40/222 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:51] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:51] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:51] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 3/225 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/225 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 11 (OVERLAPS) 0/246 variables, 0/225 constraints. Problems are: Problem set: 24 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 225 constraints, problems are : Problem set: 24 solved, 152 unsolved in 10974 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 6/6 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 35/41 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/41 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/102 variables, 20/61 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 22/83 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/83 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 144/246 variables, 102/185 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 40/225 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 152/377 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:57] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:58] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:58] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 3/380 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:43:59] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:00] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 2/382 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:01] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:02] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:02] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 3/385 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:04] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:04] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:04] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:04] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 4/389 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:06] [INFO ] Deduced a trap along path composed of 4 places in 38 ms of which 9 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 1/390 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:12] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:12] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:12] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 3/393 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:15] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:15] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:15] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 3/396 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:18] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 1/397 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:22] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/246 variables, 1/398 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:25] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/246 variables, and 399 constraints, problems are : Problem set: 24 solved, 152 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 152/176 constraints, Known Traps: 78/78 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41085ms problems are : Problem set: 24 solved, 152 unsolved
Search for dead transitions found 24 dead transitions in 41093ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 102/102 places, 156/180 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Applied a total of 0 rules in 9 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 09:44:25] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 41460 ms. Remains : 102/102 places, 156/180 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1434 ms (no deadlock found). (steps per millisecond=871 )
Random directed walk for 1250000 steps, including 0 resets, run took 1174 ms (no deadlock found). (steps per millisecond=1064 )
[2025-06-01 09:44:27] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
// Phase 1: matrix 128 rows 102 cols
[2025-06-01 09:44:27] [INFO ] Computed 26 invariants in 5 ms
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-01 09:44:27] [INFO ] [Real]Absence check using 26 positive place invariants in 7 ms returned sat
[2025-06-01 09:44:27] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2025-06-01 09:44:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-01 09:44:27] [INFO ] [Nat]Absence check using 26 positive place invariants in 8 ms returned sat
[2025-06-01 09:44:28] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2025-06-01 09:44:28] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-01 09:44:28] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 09:44:28] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 2 ms to minimize.
[2025-06-01 09:44:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 777 ms
[2025-06-01 09:44:28] [INFO ] Unfolded HLPN to a Petri net with 135 places and 230 transitions 990 arcs in 5 ms.
[2025-06-01 09:44:28] [INFO ] Unfolded 17 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 50 transitions.
RANDOM walk for 381 steps (0 resets) in 31 ms. (11 steps per ms) remains 0/16 properties
[2025-06-01 09:44:28] [INFO ] Flatten gal took : 42 ms
[2025-06-01 09:44:28] [INFO ] Flatten gal took : 18 ms
[2025-06-01 09:44:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10398293127376834515.gal : 8 ms
[2025-06-01 09:44:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15264106427035900121.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10398293127376834515.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15264106427035900121.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
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 33 places in 1 ms
Reduce places removed 33 places and 50 transitions.
[2025-06-01 09:44:29] [INFO ] Flatten gal took : 19 ms
[2025-06-01 09:44:29] [INFO ] Flatten gal took : 20 ms
[2025-06-01 09:44:29] [INFO ] Time to serialize gal into /tmp/CTLFireability7919572394408541047.gal : 8 ms
[2025-06-01 09:44:29] [INFO ] Time to serialize properties into /tmp/CTLFireability17559473870818495490.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7919572394408541047.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17559473870818495490.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 09:44:32] [INFO ] Flatten gal took : 12 ms
[2025-06-01 09:44:32] [INFO ] Applying decomposition
[2025-06-01 09:44:32] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13779406645525244187.txt' '-o' '/tmp/graph13779406645525244187.bin' '-w' '/tmp/graph13779406645525244187.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13779406645525244187.bin' '-l' '-1' '-v' '-w' '/tmp/graph13779406645525244187.weights' '-q' '0' '-e' '0.001'
[2025-06-01 09:44:32] [INFO ] Decomposing Gal with order
[2025-06-01 09:44:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 09:44:32] [INFO ] Removed a total of 222 redundant transitions.
[2025-06-01 09:44:32] [INFO ] Flatten gal took : 53 ms
[2025-06-01 09:44:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 22 ms.
[2025-06-01 09:44:32] [INFO ] Time to serialize gal into /tmp/CTLFireability16655052553392653703.gal : 4 ms
[2025-06-01 09:44:32] [INFO ] Time to serialize properties into /tmp/CTLFireability2874797496297948820.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16655052553392653703.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2874797496297948820.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...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,1.91478e+06,2.50128,77760,1638,38,128593,279,441,268639,48,1001,0


Converting to forward existential form...Done !
original formula: AG(EF(((((((((i3.u0.P_start_1_1==1)&&(i2.u1.P_start_1_2==1))&&((i0.u2.P_start_1_3==1)&&(i1.i0.u3.P_start_1_4==1)))&&(((i5.u9.x_0==1)&&(i3...2567
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((i3.u0.P_start_1_1==1)&&(i2.u1.P_start_1_2==1))&&((i0.u2.P_start_1_3==1)&&...1528
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-01 09:44:35] [INFO ] Flatten gal took : 13 ms
[2025-06-01 09:44:35] [INFO ] Flatten gal took : 10 ms
[2025-06-01 09:44:35] [INFO ] Time to serialize gal into /tmp/CTLFireability11769798908358579040.gal : 1 ms
[2025-06-01 09:44:35] [INFO ] Time to serialize properties into /tmp/CTLFireability9656879578440824360.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11769798908358579040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9656879578440824360.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91478e+06,4.72127,152200,2,31717,5,416235,6,0,590,579349,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)))&&(((x_0==1)&&(x_1==0))&&((x_2==0)&&(x_3==0))))&&(...1854
=> 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)))...1914
Reverse transition relation is NOT exact ! Due to transitions T_setx_3i1x0, T_setx_3i1x1, T_setx_3i1x2, T_setx_3i1x3, T_setx_3i1x4, T_setx_3i2x0, T_setx_3i...1562
(forward)formula 0,0,17.3182,444620,1,0,405,1.65885e+06,353,156,4335,1.77334e+06,340
ITS tools runner thread asked to quit. Dying gracefully.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 50 transitions.
[2025-06-01 09:44:52] [INFO ] Flatten gal took : 12 ms
[2025-06-01 09:44:52] [INFO ] Flatten gal took : 13 ms
[2025-06-01 09:44:52] [INFO ] Time to serialize gal into /tmp/CTLFireability15573931882401035890.gal : 1 ms
[2025-06-01 09:44:52] [INFO ] Time to serialize properties into /tmp/CTLFireability6168009733640991271.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15573931882401035890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6168009733640991271.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 17 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 09:44:56] [INFO ] Flatten gal took : 11 ms
[2025-06-01 09:44:56] [INFO ] Applying decomposition
[2025-06-01 09:44:56] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1728551689406438109.txt' '-o' '/tmp/graph1728551689406438109.bin' '-w' '/tmp/graph1728551689406438109.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1728551689406438109.bin' '-l' '-1' '-v' '-w' '/tmp/graph1728551689406438109.weights' '-q' '0' '-e' '0.001'
[2025-06-01 09:44:56] [INFO ] Decomposing Gal with order
[2025-06-01 09:44:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 09:44:56] [INFO ] Removed a total of 222 redundant transitions.
[2025-06-01 09:44:56] [INFO ] Flatten gal took : 23 ms
[2025-06-01 09:44:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 7 ms.
[2025-06-01 09:44:56] [INFO ] Time to serialize gal into /tmp/CTLFireability11394028680636537606.gal : 3 ms
[2025-06-01 09:44:56] [INFO ] Time to serialize properties into /tmp/CTLFireability9930562873401440742.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11394028680636537606.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9930562873401440742.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...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,1.91478e+06,2.37815,74748,1840,38,122631,268,468,255197,49,986,0


Converting to forward existential form...Done !
original formula: AG(EF((((((i3.i0.u0.P_start_1_1>=1)&&(i3.i0.u0.P_b_3>=1))||((i3.i0.u0.P_start_1_1>=1)&&(i3.i0.u0.P_b_2>=1)))||(((i1.u3.P_start_1_4>=1)&&(...414
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((i3.i0.u0.P_start_1_1>=1)&&(i3.i0.u0.P_b_3>=1))||((i3.i0.u0.P_start_1_1>=1)&&...474
Reverse transition relation is NOT exact ! Due to transitions T_setx_3i1x0, T_setx_3i1x2, T_setx_3i1x3, T_setx_3i1x4, T_setx_3i2x0, T_setx_3i2x1, T_setx_3i...1619
Detected timeout of ITS tools.
[2025-06-01 09:44:59] [INFO ] Flatten gal took : 10 ms
[2025-06-01 09:44:59] [INFO ] Flatten gal took : 10 ms
[2025-06-01 09:44:59] [INFO ] Time to serialize gal into /tmp/CTLFireability14999986198044829936.gal : 1 ms
[2025-06-01 09:44:59] [INFO ] Time to serialize properties into /tmp/CTLFireability1030678568550688171.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14999986198044829936.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1030678568550688171.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 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,1.91478e+06,4.62003,152428,2,31717,5,416235,6,0,590,579349,0


Converting to forward existential form...Done !
original formula: AG(EF((((((P_start_1_1>=1)&&(P_b_3>=1))||((P_start_1_1>=1)&&(P_b_2>=1)))||(((P_start_1_4>=1)&&(P_b_9>=1))||((P_start_1_2>=1)&&(P_b_4>=1))...294
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((P_start_1_1>=1)&&(P_b_3>=1))||((P_start_1_1>=1)&&(P_b_2>=1)))||(((P_start_1_...354
Reverse transition relation is NOT exact ! Due to transitions T_setx_3i1x0, T_setx_3i1x1, T_setx_3i1x2, T_setx_3i1x3, T_setx_3i1x4, T_setx_3i2x0, T_setx_3i...1562
Detected timeout of ITS tools.
[2025-06-01 09:45:29] [INFO ] Flatten gal took : 9 ms
[2025-06-01 09:45:29] [INFO ] Applying decomposition
[2025-06-01 09:45:29] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph10491242381280885545.txt' '-o' '/tmp/graph10491242381280885545.bin' '-w' '/tmp/graph10491242381280885545.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10491242381280885545.bin' '-l' '-1' '-v' '-w' '/tmp/graph10491242381280885545.weights' '-q' '0' '-e' '0.001'
[2025-06-01 09:45:29] [INFO ] Decomposing Gal with order
[2025-06-01 09:45:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 09:45:29] [INFO ] Removed a total of 222 redundant transitions.
[2025-06-01 09:45:29] [INFO ] Flatten gal took : 18 ms
[2025-06-01 09:45:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 7 ms.
[2025-06-01 09:45:29] [INFO ] Time to serialize gal into /tmp/CTLFireability3498935400520840447.gal : 2 ms
[2025-06-01 09:45:29] [INFO ] Time to serialize properties into /tmp/CTLFireability1597691906435480346.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3498935400520840447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1597691906435480346.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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,1.91478e+06,2.23623,70708,1798,38,117946,286,503,231659,49,1039,0


Converting to forward existential form...Done !
original formula: AG(EF((((((i0.i1.u0.P_start_1_1>=1)&&(i0.i1.u0.P_b_3>=1))||((i0.i1.u0.P_start_1_1>=1)&&(i0.i1.u0.P_b_2>=1)))||(((i4.i0.u3.P_start_1_4>=1)...426
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((i0.i1.u0.P_start_1_1>=1)&&(i0.i1.u0.P_b_3>=1))||((i0.i1.u0.P_start_1_1>=1)&&...486
Reverse transition relation is NOT exact ! Due to transitions T_setx_3i1x0, T_setx_3i1x2, T_setx_3i1x3, T_setx_3i1x4, T_setx_3i2x0, T_setx_3i2x1, T_setx_3i...1596
(forward)formula 0,1,4.67179,104628,1,0,174833,323,2139,409113,194,1455,380002
Formula is TRUE !

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

original formula: AG(EF((((((((i5.u8.x_0>=1)&&(i0.i1.u4.P_setx_3_1>=1))||((i0.i1.u4.x_1>=1)&&(i3.i0.u7.P_setx_3_3>=1)))||(((i0.i1.u4.x_1>=1)&&(i4.i0.u5.P_s...963
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((i5.u8.x_0>=1)&&(i0.i1.u4.P_setx_3_1>=1))||((i0.i1.u4.x_1>=1)&&(i3.i0.u7.P_...1023
(forward)formula 1,1,6.1251,142260,1,0,242287,323,2220,499335,194,1456,513617
Formula is TRUE !

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

original formula: AG(EF(((((((i5.u32.y_1>=1)&&(i1.u6.P_ify0_4_2>=1))||((i5.u32.y_1>=1)&&(i3.i0.u7.P_ify0_4_3>=1)))||(((i5.u32.y_1>=1)&&(i4.i0.u5.P_ify0_4_4...734
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((i5.u32.y_1>=1)&&(i1.u6.P_ify0_4_2>=1))||((i5.u32.y_1>=1)&&(i3.i0.u7.P_ify0_...794
(forward)formula 2,1,8.61225,213940,1,0,365865,326,2283,714811,194,1460,755021
Formula is TRUE !

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

original formula: AG(EF((((((i4.i0.u3.P_b_8>=1)&&(i4.i0.u5.P_setbi_5_4>=1))||((i1.u1.P_b_4>=1)&&(i1.u6.P_setbi_5_2>=1)))||(((i0.i1.u0.P_b_3>=1)&&(i0.i1.u4....426
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((i4.i0.u3.P_b_8>=1)&&(i4.i0.u5.P_setbi_5_4>=1))||((i1.u1.P_b_4>=1)&&(i1.u6.P_...486
(forward)formula 3,1,11.4248,275852,1,0,469786,327,2346,863114,195,1460,965733
Formula is TRUE !

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

original formula: AG(EF(((((i5.u32.y_0>=1)&&(i1.u28.P_awaity_2>=1))||((i5.u32.y_0>=1)&&(i3.i0.u29.P_awaity_3>=1)))||(((i5.u32.y_0>=1)&&(i4.i0.u31.P_awaity_...211
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((i5.u32.y_0>=1)&&(i1.u28.P_awaity_2>=1))||((i5.u32.y_0>=1)&&(i3.i0.u29.P_await...271
(forward)formula 4,1,14.3022,372876,1,0,642628,341,2371,1.20266e+06,195,1482,1312275
Formula is TRUE !

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

original formula: AG(EF(((((i5.u32.y_0>=1)&&(i3.i0.u7.P_ify0_4_3>=1))||((i5.u32.y_0>=1)&&(i4.i0.u5.P_ify0_4_4>=1)))||(((i5.u32.y_0>=1)&&(i0.i1.u4.P_ify0_4_...207
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((i5.u32.y_0>=1)&&(i3.i0.u7.P_ify0_4_3>=1))||((i5.u32.y_0>=1)&&(i4.i0.u5.P_ify0...267
(forward)formula 5,1,16.0446,419596,1,0,725877,349,2384,1.31091e+06,195,1503,1485842
Formula is TRUE !

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

original formula: AG(EF((((((((i5.u32.y_1>=1)&&(i5.u8.P_sety_9_1>=1))||((i5.u32.y_1>=1)&&(i5.u9.P_sety_9_2>=1)))||(((i5.u32.y_1>=1)&&(u10.P_sety_9_3>=1))||...854
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((i5.u32.y_1>=1)&&(i5.u8.P_sety_9_1>=1))||((i5.u32.y_1>=1)&&(i5.u9.P_sety_9_...914
(forward)formula 6,1,17.2556,444044,1,0,759508,355,2484,1.3662e+06,196,1514,1543125
Formula is TRUE !

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

original formula: AG(EF(((((((i1.u6.x_2>=1)&&(u11.P_ifxi_10_4>=1))||((i4.i0.u5.x_4>=1)&&(i5.u8.P_ifxi_10_1>=1)))||(((i5.u8.x_0>=1)&&(i5.u9.P_ifxi_10_2>=1))...737
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((i1.u6.x_2>=1)&&(u11.P_ifxi_10_4>=1))||((i4.i0.u5.x_4>=1)&&(i5.u8.P_ifxi_10_...797
(forward)formula 7,1,19.3966,493768,1,0,833926,366,2553,1.48787e+06,197,1561,1682753
Formula is TRUE !

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

original formula: AG(EF((((((i0.i1.u0.P_b_2>=1)&&(i5.u8.P_setbi_11_1>=1))||((i3.i0.u2.P_b_6>=1)&&(u10.P_setbi_11_3>=1)))||(((i1.u1.P_b_4>=1)&&(i5.u9.P_setb...408
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((i0.i1.u0.P_b_2>=1)&&(i5.u8.P_setbi_11_1>=1))||((i3.i0.u2.P_b_6>=1)&&(u10.P_s...468
(forward)formula 8,1,20.5015,505544,1,0,852950,367,2595,1.5263e+06,197,1562,1708357
Formula is TRUE !

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

original formula: AG(EF((((i1.u1.P_fordo_12_2>=1)||(i0.i1.u0.P_fordo_12_1>=1))||((i4.i0.u3.P_fordo_12_4>=1)||(i3.i0.u2.P_fordo_12_3>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i1.u1.P_fordo_12_2>=1)||(i0.i1.u0.P_fordo_12_1>=1))||((i4.i0.u3.P_fordo_12_4>=...199
(forward)formula 9,1,22.1387,551240,1,0,934059,368,2603,1.66676e+06,197,1566,1863854
Formula is TRUE !

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

original formula: AG(EF((((((((i3.i0.u2.P_b_6>=1)&&(i1.u15.P_wait_13>=1))&&(i1.u14.P_await_13_2>=1))||(((i3.i0.u2.P_b_6>=1)&&(i4.i1.u26.P_wait_23>=1))&&(i4...1294
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((i3.i0.u2.P_b_6>=1)&&(i1.u15.P_wait_13>=1))&&(i1.u14.P_await_13_2>=1))||(((...1354
(forward)formula 10,1,24.1654,605416,1,0,1.02957e+06,368,2793,1.86139e+06,199,1566,2030845
Formula is TRUE !

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

original formula: AG(EF(((((((i1.u14.P_await_13_2>=1)&&(i1.u14.P_done_11>=1))&&((i1.u20.P_done_12>=1)&&(i1.u15.P_done_13>=1)))&&(i1.u21.P_done_14>=1))||(((...575
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((i1.u14.P_await_13_2>=1)&&(i1.u14.P_done_11>=1))&&((i1.u20.P_done_12>=1)&&(i...635
(forward)formula 11,1,27.4391,708840,1,0,1.21452e+06,370,2908,2.16921e+06,201,1572,2386716
Formula is TRUE !
Detected timeout of ITS tools.
[2025-06-01 09:45:59] [INFO ] Flatten gal took : 9 ms
[2025-06-01 09:45:59] [INFO ] Flatten gal took : 8 ms
[2025-06-01 09:45:59] [INFO ] Time to serialize gal into /tmp/CTLFireability1006866146556057867.gal : 1 ms
[2025-06-01 09:45:59] [INFO ] Time to serialize properties into /tmp/CTLFireability14365899106908070763.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1006866146556057867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14365899106908070763.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 5 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,1.91478e+06,4.6553,151900,2,31717,5,416235,6,0,590,579349,0


Converting to forward existential form...Done !
original formula: AG(EF(((((((y_2>=1)&&(P_ifyi_15_1>=1))||((y_2>=1)&&(P_ifyi_15_3>=1)))||(((y_0>=1)&&(P_ifyi_15_4>=1))||((y_0>=1)&&(P_ifyi_15_3>=1))))||(((...534
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((y_2>=1)&&(P_ifyi_15_1>=1))||((y_2>=1)&&(P_ifyi_15_3>=1)))||(((y_0>=1)&&(P_i...594
Reverse transition relation is NOT exact ! Due to transitions T_setx_3i1x0, T_setx_3i1x1, T_setx_3i1x2, T_setx_3i1x3, T_setx_3i1x4, T_setx_3i2x0, T_setx_3i...1562
(forward)formula 0,1,41.7348,1169212,1,0,459,6.24163e+06,353,190,4126,5.15974e+06,430
Formula is TRUE !

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

original formula: AG(EF(((((y_2>=1)&&(P_ifyi_15_2>=1))||((y_4>=1)&&(P_ifyi_15_4>=1)))||(((y_1>=1)&&(P_ifyi_15_1>=1))||((y_3>=1)&&(P_ifyi_15_3>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((y_2>=1)&&(P_ifyi_15_2>=1))||((y_4>=1)&&(P_ifyi_15_4>=1)))||(((y_1>=1)&&(P_ify...210
(forward)formula 1,1,75.2432,2070176,1,0,508,1.16039e+07,354,217,4129,8.8141e+06,501
Formula is TRUE !

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

original formula: AG(EF(((((x_1>=1)&&(P_ifxi_10_1>=1))||((x_2>=1)&&(P_ifxi_10_2>=1)))||(((x_3>=1)&&(P_ifxi_10_3>=1))||((x_4>=1)&&(P_ifxi_10_4>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((x_1>=1)&&(P_ifxi_10_1>=1))||((x_2>=1)&&(P_ifxi_10_2>=1)))||(((x_3>=1)&&(P_ifx...210
(forward)formula 2,1,106.627,2277248,1,0,521,1.27796e+07,14,223,1912,9.63455e+06,50
Formula is TRUE !

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

original formula: AG(EF((((((((y_3>=1)&&(P_CS_21_4>=1))||((y_3>=1)&&(P_CS_21_2>=1)))||(((y_3>=1)&&(P_CS_21_3>=1))||((y_3>=1)&&(P_CS_21_1>=1))))||((((y_2>=1...622
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((y_3>=1)&&(P_CS_21_4>=1))||((y_3>=1)&&(P_CS_21_2>=1)))||(((y_3>=1)&&(P_CS_2...682
(forward)formula 3,1,113.377,2277248,1,0,521,1.27796e+07,15,223,1939,9.63455e+06,86
Formula is TRUE !

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

original formula: AG(EF((((((P_b_3>=1)&&(P_setbi_24_1>=1))||((P_b_2>=1)&&(P_setbi_24_1>=1)))||(((P_b_4>=1)&&(P_setbi_24_2>=1))||((P_b_6>=1)&&(P_setbi_24_3>...302
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((P_b_3>=1)&&(P_setbi_24_1>=1))||((P_b_2>=1)&&(P_setbi_24_1>=1)))||(((P_b_4>=1...362
(forward)formula 4,1,121.526,2277248,1,0,521,1.27796e+07,16,223,1954,9.63455e+06,123
Formula is TRUE !

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

Able to resolve query Liveness after proving 18 properties.
FORMULA Liveness TRUE TECHNIQUES RANDOM_WALK DECISION_DIAGRAMS TOPOLOGICAL INITIAL_STATE USE_NUPN
Total runtime 258812 ms.

BK_STOP 1748771281776

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-4"
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-5832"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-COL-4, 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 r119-tall-174876430400384"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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