fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r343-tall-171679094300229
Last Updated
July 7, 2024

About the Execution of ITS-Tools for SafeBus-COL-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9566.752 1800000.00 1851868.00 5701.70 [undef] Time out reached

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.r343-tall-171679094300229.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 SafeBus-COL-06, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r343-tall-171679094300229
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.7K Apr 12 14:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 12 14:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 12 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 12 14:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1716832078199

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SafeBus-COL-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
Liveness COL
Running Version 202405141337
[2024-05-27 17:47:59] [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-27 17:47:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 17:47:59] [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-27 17:47:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 17:48:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 593 ms
[2024-05-27 17:48:00] [INFO ] Detected 1 constant HL places corresponding to 6 PT places.
[2024-05-27 17:48:00] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 150 PT places and 2029.0 transition bindings in 24 ms.
[2024-05-27 17:48:00] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2024-05-27 17:48:00] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2024-05-27 17:48:00] [INFO ] Unfolded HLPN to a Petri net with 150 places and 463 transitions 2962 arcs in 30 ms.
[2024-05-27 17:48:00] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2024-05-27 17:48:00] [INFO ] Unfolded HLPN to a Petri net with 150 places and 463 transitions 2962 arcs in 8 ms.
[2024-05-27 17:48:00] [INFO ] Unfolded 14 HLPN properties in 0 ms.
[2024-05-27 17:48:00] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-27 17:48:00] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 1 ms.
[2024-05-27 17:48:00] [INFO ] Skeletonized 14 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 [It(6), It(6)] of place AMC breaks symmetries in sort It
[2024-05-27 17:48:00] [INFO ] Unfolded HLPN to a Petri net with 150 places and 463 transitions 2962 arcs in 11 ms.
[2024-05-27 17:48:00] [INFO ] Unfolded 14 HLPN properties in 1 ms.
[2024-05-27 17:48:00] [INFO ] Reduced 24 identical enabling conditions.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 12 transitions.
Built sparse matrix representations for Structural reductions in 2 ms.22904KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 138/138 places, 451/451 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 49 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61 ms. Remains : 138/138 places, 451/451 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 138/138 places, 451/451 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 28 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-05-27 17:48:00] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 17:48:00] [INFO ] Computed 29 invariants in 26 ms
[2024-05-27 17:48:00] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-27 17:48:00] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-27 17:48:00] [INFO ] Invariant cache hit.
[2024-05-27 17:48:00] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 17:48:00] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2024-05-27 17:48:00] [INFO ] Redundant transitions in 39 ms returned []
Running 445 sub problems to find dead transitions.
[2024-05-27 17:48:01] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-27 17:48:01] [INFO ] Invariant cache hit.
[2024-05-27 17:48:01] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 17:48:03] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 14 ms to minimize.
[2024-05-27 17:48:03] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
[2024-05-27 17:48:04] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-27 17:48:04] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-05-27 17:48:04] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-05-27 17:48:04] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-27 17:48:04] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-27 17:48:05] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-27 17:48:05] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 4 ms to minimize.
[2024-05-27 17:48:05] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2024-05-27 17:48:05] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 11 ms to minimize.
[2024-05-27 17:48:05] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-05-27 17:48:05] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 3 ms to minimize.
[2024-05-27 17:48:05] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2024-05-27 17:48:06] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2024-05-27 17:48:06] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-27 17:48:06] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-27 17:48:06] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-27 17:48:06] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-27 17:48:06] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 20/49 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 17:48:07] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-27 17:48:08] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-05-27 17:48:08] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-27 17:48:08] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-27 17:48:08] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-27 17:48:08] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-27 17:48:08] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-27 17:48:08] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-05-27 17:48:08] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 9/58 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 17:48:10] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/59 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 17:48:11] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-27 17:48:12] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 2/61 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 17:48:14] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/62 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 17:48:15] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 2 ms to minimize.
[2024-05-27 17:48:15] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 2 ms to minimize.
[2024-05-27 17:48:15] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-27 17:48:15] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-27 17:48:15] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-27 17:48:15] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 6/68 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 17:48:18] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-05-27 17:48:18] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2024-05-27 17:48:18] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 3/71 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 17:48:20] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/72 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/72 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/210 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/253 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/253 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 14 (OVERLAPS) 0/380 variables, 0/253 constraints. Problems are: Problem set: 36 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 253 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 36 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 43/72 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/72 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/210 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/253 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/662 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 17:48:39] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-27 17:48:39] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-27 17:48:44] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-27 17:48:44] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2024-05-27 17:48:44] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 5/667 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/667 constraints. Problems are: Problem set: 36 solved, 409 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 667 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/445 constraints, Known Traps: 48/48 constraints]
After SMT, in 60782ms problems are : Problem set: 36 solved, 409 unsolved
Search for dead transitions found 36 dead transitions in 60823ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 138/138 places, 415/451 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 14 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 17:49:01] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 61563 ms. Remains : 138/138 places, 415/451 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2699 ms (no deadlock found). (steps per millisecond=463 )
Random directed walk for 1250002 steps, including 0 resets, run took 1943 ms (no deadlock found). (steps per millisecond=643 )
[2024-05-27 17:49:06] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:49:06] [INFO ] Invariant cache hit.
[2024-05-27 17:49:06] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-27 17:49:06] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 17 ms returned sat
[2024-05-27 17:49:06] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-27 17:49:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 17:49:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-27 17:49:06] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 11 ms returned sat
[2024-05-27 17:49:06] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-27 17:49:06] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 17:49:06] [INFO ] [Nat]Added 43 Read/Feed constraints in 23 ms returned sat
[2024-05-27 17:49:06] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-27 17:49:07] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-27 17:49:07] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 2 ms to minimize.
[2024-05-27 17:49:07] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-27 17:49:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 263 ms
[2024-05-27 17:49:07] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 36 ms.
[2024-05-27 17:49:07] [INFO ] Added : 4 causal constraints over 1 iterations in 92 ms. Result :sat
Parikh directed walk for 10400 steps, including 995 resets, run took 70 ms. (steps per millisecond=148 )
Random directed walk for 500001 steps, including 0 resets, run took 771 ms (no deadlock found). (steps per millisecond=648 )
Random walk for 500000 steps, including 0 resets, run took 1018 ms (no deadlock found). (steps per millisecond=491 )
Random directed walk for 500002 steps, including 0 resets, run took 766 ms (no deadlock found). (steps per millisecond=652 )
Random walk for 500000 steps, including 0 resets, run took 1007 ms (no deadlock found). (steps per millisecond=496 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 138/138 places, 415/415 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 13 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 17:49:10] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:49:10] [INFO ] Invariant cache hit.
[2024-05-27 17:49:10] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-27 17:49:10] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:49:10] [INFO ] Invariant cache hit.
[2024-05-27 17:49:11] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 17:49:11] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-05-27 17:49:11] [INFO ] Redundant transitions in 7 ms returned []
Running 409 sub problems to find dead transitions.
[2024-05-27 17:49:11] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:49:11] [INFO ] Invariant cache hit.
[2024-05-27 17:49:11] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:49:12] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-27 17:49:12] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-27 17:49:13] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-05-27 17:49:13] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-27 17:49:13] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2024-05-27 17:49:14] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-05-27 17:49:14] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-05-27 17:49:14] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-27 17:49:14] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-27 17:49:14] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-27 17:49:14] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-27 17:49:14] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-27 17:49:15] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-05-27 17:49:15] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-27 17:49:15] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-27 17:49:15] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:49:15] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-27 17:49:15] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-27 17:49:15] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-27 17:49:15] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-27 17:49:17] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-05-27 17:49:17] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2024-05-27 17:49:17] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-27 17:49:17] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-27 17:49:17] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-05-27 17:49:17] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:49:19] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 237 constraints, problems are : Problem set: 0 solved, 409 unsolved in 26318 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/646 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:49:45] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 647 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 28/28 constraints]
After SMT, in 56774ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 56788ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 56978 ms. Remains : 138/138 places, 415/415 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2531 ms (no deadlock found). (steps per millisecond=493 )
Random directed walk for 1250000 steps, including 0 resets, run took 1898 ms (no deadlock found). (steps per millisecond=658 )
[2024-05-27 17:50:12] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:50:12] [INFO ] Invariant cache hit.
[2024-05-27 17:50:12] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-27 17:50:12] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 13 ms returned sat
[2024-05-27 17:50:12] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-27 17:50:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 17:50:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-27 17:50:12] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 11 ms returned sat
[2024-05-27 17:50:12] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-27 17:50:12] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 17:50:12] [INFO ] [Nat]Added 43 Read/Feed constraints in 23 ms returned sat
[2024-05-27 17:50:12] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-27 17:50:12] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-27 17:50:12] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-27 17:50:12] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-27 17:50:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 227 ms
[2024-05-27 17:50:12] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 24 ms.
[2024-05-27 17:50:12] [INFO ] Added : 4 causal constraints over 1 iterations in 61 ms. Result :sat
Parikh directed walk for 10400 steps, including 995 resets, run took 40 ms. (steps per millisecond=260 )
Random directed walk for 500000 steps, including 0 resets, run took 789 ms (no deadlock found). (steps per millisecond=633 )
Random walk for 500000 steps, including 0 resets, run took 1012 ms (no deadlock found). (steps per millisecond=494 )
Random directed walk for 500001 steps, including 0 resets, run took 755 ms (no deadlock found). (steps per millisecond=662 )
Random walk for 500000 steps, including 0 resets, run took 1004 ms (no deadlock found). (steps per millisecond=498 )
[2024-05-27 17:50:16] [INFO ] Flatten gal took : 113 ms
[2024-05-27 17:50:16] [INFO ] Unfolded HLPN to a Petri net with 150 places and 463 transitions 2962 arcs in 17 ms.
[2024-05-27 17:50:16] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
[2024-05-27 17:50:16] [INFO ] Reduced 24 identical enabling conditions.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 12 transitions.
RANDOM walk for 250 steps (0 resets) in 38 ms. (6 steps per ms) remains 0/13 properties
[2024-05-27 17:50:16] [INFO ] Flatten gal took : 84 ms
[2024-05-27 17:50:17] [INFO ] Flatten gal took : 58 ms
[2024-05-27 17:50:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12984066869258083186.gal : 20 ms
[2024-05-27 17:50:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality946066119205834499.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12984066869258083186.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality946066119205834499.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 14 properties.
Net is quasi-live, checking if it is reversible to establish liveness.
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 12 places and 12 transitions.
[2024-05-27 17:50:17] [INFO ] Flatten gal took : 40 ms
[2024-05-27 17:50:17] [INFO ] Flatten gal took : 38 ms
[2024-05-27 17:50:17] [INFO ] Time to serialize gal into /tmp/CTLFireability11149602285167125293.gal : 5 ms
[2024-05-27 17:50:17] [INFO ] Time to serialize properties into /tmp/CTLFireability8099997262451009189.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/CTLFireability11149602285167125293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8099997262451009189.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-27 17:50:20] [INFO ] Flatten gal took : 32 ms
[2024-05-27 17:50:20] [INFO ] Applying decomposition
[2024-05-27 17:50:20] [INFO ] Flatten gal took : 28 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/graph4777180130999830602.txt' '-o' '/tmp/graph4777180130999830602.bin' '-w' '/tmp/graph4777180130999830602.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4777180130999830602.bin' '-l' '-1' '-v' '-w' '/tmp/graph4777180130999830602.weights' '-q' '0' '-e' '0.001'
[2024-05-27 17:50:20] [INFO ] Decomposing Gal with order
[2024-05-27 17:50:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 17:50:20] [INFO ] Removed a total of 467 redundant transitions.
[2024-05-27 17:50:20] [INFO ] Flatten gal took : 132 ms
[2024-05-27 17:50:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 18 ms.
[2024-05-27 17:50:20] [INFO ] Time to serialize gal into /tmp/CTLFireability5273377916272332880.gal : 7 ms
[2024-05-27 17:50:20] [INFO ] Time to serialize properties into /tmp/CTLFireability8135847884008995792.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/CTLFireability5273377916272332880.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8135847884008995792.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-27 17:50:23] [INFO ] Flatten gal took : 26 ms
[2024-05-27 17:50:23] [INFO ] Flatten gal took : 24 ms
[2024-05-27 17:50:23] [INFO ] Time to serialize gal into /tmp/CTLFireability15424481957063892931.gal : 4 ms
[2024-05-27 17:50:23] [INFO ] Time to serialize properties into /tmp/CTLFireability2687260103690248526.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/CTLFireability15424481957063892931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2687260103690248526.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-27 17:50:53] [INFO ] Flatten gal took : 24 ms
[2024-05-27 17:50:53] [INFO ] Applying decomposition
[2024-05-27 17:50:53] [INFO ] Flatten gal took : 22 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/graph6760818450622421295.txt' '-o' '/tmp/graph6760818450622421295.bin' '-w' '/tmp/graph6760818450622421295.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6760818450622421295.bin' '-l' '-1' '-v' '-w' '/tmp/graph6760818450622421295.weights' '-q' '0' '-e' '0.001'
[2024-05-27 17:50:53] [INFO ] Decomposing Gal with order
[2024-05-27 17:50:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 17:50:54] [INFO ] Removed a total of 472 redundant transitions.
[2024-05-27 17:50:54] [INFO ] Flatten gal took : 73 ms
[2024-05-27 17:50:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 292 labels/synchronizations in 12 ms.
[2024-05-27 17:50:54] [INFO ] Time to serialize gal into /tmp/CTLFireability8614560580183919713.gal : 5 ms
[2024-05-27 17:50:54] [INFO ] Time to serialize properties into /tmp/CTLFireability16225693285847984830.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/CTLFireability8614560580183919713.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16225693285847984830.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-27 17:51:24] [INFO ] Flatten gal took : 22 ms
[2024-05-27 17:51:24] [INFO ] Flatten gal took : 19 ms
[2024-05-27 17:51:24] [INFO ] Time to serialize gal into /tmp/CTLFireability9422341046612724147.gal : 4 ms
[2024-05-27 17:51:24] [INFO ] Time to serialize properties into /tmp/CTLFireability14154031871050086822.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/CTLFireability9422341046612724147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14154031871050086822.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.81676e+06,144.775,2825640,2,276588,5,5.13864e+06,6,0,1006,5.39922e+06,0


Converting to forward existential form...Done !
original formula: AG(EF((((((((((Cpt2_0==1)&&(Cpt2_1==0))&&((Cpt2_2==0)&&(Cpt2_3==0)))&&(((Cpt2_4==0)&&(Cpt2_5==0))&&((Cpt1_0==1)&&(Cpt1_1==0))))&&((((Cpt1...2324
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((((Cpt2_0==1)&&(Cpt2_1==0))&&((Cpt2_2==0)&&(Cpt2_3==0)))&&(((Cpt2_4==0)&&(C...2384
Reverse transition relation is NOT exact ! Due to transitions I_reemitr0i1, I_reemitr0i2, I_reemitr0i3, I_reemitr0i4, I_reemitr0i5, I_reemitr1i0, I_reemitr...1255
Detected timeout of ITS tools.
[2024-05-27 17:56:24] [INFO ] Flatten gal took : 20 ms
[2024-05-27 17:56:24] [INFO ] Applying decomposition
[2024-05-27 17:56:24] [INFO ] Flatten gal took : 19 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/graph1208458153731109051.txt' '-o' '/tmp/graph1208458153731109051.bin' '-w' '/tmp/graph1208458153731109051.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1208458153731109051.bin' '-l' '-1' '-v' '-w' '/tmp/graph1208458153731109051.weights' '-q' '0' '-e' '0.001'
[2024-05-27 17:56:24] [INFO ] Decomposing Gal with order
[2024-05-27 17:56:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 17:56:24] [INFO ] Removed a total of 933 redundant transitions.
[2024-05-27 17:56:24] [INFO ] Flatten gal took : 43 ms
[2024-05-27 17:56:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 199 labels/synchronizations in 11 ms.
[2024-05-27 17:56:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14020132369675262118.gal : 3 ms
[2024-05-27 17:56:24] [INFO ] Time to serialize properties into /tmp/CTLFireability984661192761299069.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/CTLFireability14020132369675262118.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability984661192761299069.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-27 18:01:24] [INFO ] Flatten gal took : 18 ms
[2024-05-27 18:01:24] [INFO ] Flatten gal took : 18 ms
[2024-05-27 18:01:24] [INFO ] Time to serialize gal into /tmp/CTLFireability17938349799618820438.gal : 3 ms
[2024-05-27 18:01:24] [INFO ] Time to serialize properties into /tmp/CTLFireability11499431394415171458.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/CTLFireability17938349799618820438.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11499431394415171458.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,6.81676e+06,148.072,2823416,2,276588,5,5.13864e+06,6,0,1006,5.39922e+06,0


Converting to forward existential form...Done !
original formula: AG(EF((((((((((Cpt2_0==1)&&(Cpt2_1==0))&&((Cpt2_2==0)&&(Cpt2_3==0)))&&(((Cpt2_4==0)&&(Cpt2_5==0))&&((Cpt1_0==1)&&(Cpt1_1==0))))&&((((Cpt1...2324
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((((Cpt2_0==1)&&(Cpt2_1==0))&&((Cpt2_2==0)&&(Cpt2_3==0)))&&(((Cpt2_4==0)&&(C...2384
Reverse transition relation is NOT exact ! Due to transitions I_reemitr0i1, I_reemitr0i2, I_reemitr0i3, I_reemitr0i4, I_reemitr0i5, I_reemitr1i0, I_reemitr...1255

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="SafeBus-COL-06"
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 SafeBus-COL-06, 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 r343-tall-171679094300229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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