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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 18K Apr 12 14:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 14:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 12 14:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 140K Apr 12 14:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 12 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 173K Apr 12 14:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 840K Apr 12 14:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 303K 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 1716833403084

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SafeBus-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
Liveness PT
Running Version 202405141337
[2024-05-27 18:10:04] [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 18:10:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 18:10:04] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-27 18:10:04] [INFO ] Transformed 144 places.
[2024-05-27 18:10:04] [INFO ] Transformed 451 transitions.
[2024-05-27 18:10:04] [INFO ] Found NUPN structural information;
[2024-05-27 18:10:04] [INFO ] Parsed PT model containing 144 places and 451 transitions and 2968 arcs in 205 ms.
Reduce places removed 6 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 8 ms.18974KB 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 59 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 74 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 18:10:04] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 18:10:04] [INFO ] Computed 29 invariants in 22 ms
[2024-05-27 18:10:05] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-27 18:10:05] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-27 18:10:05] [INFO ] Invariant cache hit.
[2024-05-27 18:10:05] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 18:10:05] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2024-05-27 18:10:05] [INFO ] Redundant transitions in 24 ms returned []
Running 445 sub problems to find dead transitions.
[2024-05-27 18:10:05] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-27 18:10:05] [INFO ] Invariant cache hit.
[2024-05-27 18:10:05] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 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 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 18:10:07] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 13 ms to minimize.
[2024-05-27 18:10:07] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 1 ms to minimize.
[2024-05-27 18:10:08] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2024-05-27 18:10:08] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-05-27 18:10:08] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-05-27 18:10:09] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-27 18:10:09] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-27 18:10:09] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-27 18:10:09] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-27 18:10:09] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 9 ms to minimize.
[2024-05-27 18:10:09] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 1 ms to minimize.
[2024-05-27 18:10:09] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2024-05-27 18:10:10] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-27 18:10:10] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-27 18:10:10] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-27 18:10:10] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-27 18:10:10] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-27 18:10:10] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-27 18:10:10] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-27 18:10:10] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 18:10:13] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-05-27 18:10:13] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-05-27 18:10:13] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-05-27 18:10:13] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-27 18:10:13] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-27 18:10:13] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-27 18:10:13] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-27 18:10:13] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
[2024-05-27 18:10:13] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-05-27 18:10:13] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2024-05-27 18:10:13] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 11/198 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 18:10:15] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-05-27 18:10:15] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-27 18:10:15] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-27 18:10:15] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 2 ms to minimize.
[2024-05-27 18:10:16] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 5/203 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 18:10:17] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-05-27 18:10:17] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 0 ms to minimize.
[2024-05-27 18:10:17] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-27 18:10:17] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 4/207 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/207 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 8 (OVERLAPS) 242/380 variables, 138/345 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 43/388 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/388 constraints. Problems are: Problem set: 36 solved, 409 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 (/ 1.0 24.0))
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 (/ 1.0 24.0))
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 (/ 1.0 8.0))
(s47 0.0)
(s48 (/ 1.0 24.0))
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 (/ 1.0 6.0))
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 (/ 3.0 8.0))
(s62 0.0)
(s63 (/ 19.0 24.0))
(s64 (/ 17.0 24.0))
(s65 0.0)
(s66 0.0)
(s67 (/ 11.0 24.0))
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 (/ 23.0 24.0))
(s73 0.0)
(s74 0.0)
(s75 (/ 5.0 24.0))
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 (/ 1.0 6.0))
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 (/ 23.0 24.0))
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 (/ 23.0 24.0))
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 timeout
0.0)
(s124 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 388 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30031 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 36 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 40/207 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 18:10:38] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-27 18:10:38] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-27 18:10:38] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-05-27 18:10:39] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-27 18:10:39] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-05-27 18:10:39] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-27 18:10:39] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-27 18:10:39] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 8/215 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 18:10:45] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2024-05-27 18:10:45] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2024-05-27 18:10:45] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 3/218 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/218 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 242/380 variables, 138/356 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 43/399 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 409/808 constraints. Problems are: Problem set: 36 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 808 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30027 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/445 constraints, Known Traps: 51/51 constraints]
After SMT, in 60669ms problems are : Problem set: 36 solved, 409 unsolved
Search for dead transitions found 36 dead transitions in 60688ms
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 18 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 18:11:06] [INFO ] Redundant transitions in 6 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 61297 ms. Remains : 138/138 places, 415/451 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2692 ms (no deadlock found). (steps per millisecond=464 )
Random directed walk for 1250000 steps, including 0 resets, run took 1896 ms (no deadlock found). (steps per millisecond=659 )
[2024-05-27 18:11:10] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 18:11:10] [INFO ] Computed 29 invariants in 5 ms
[2024-05-27 18:11:10] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-27 18:11:10] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 95 ms returned sat
[2024-05-27 18:11:10] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-27 18:11:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 18:11:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-27 18:11:11] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 26 ms returned sat
[2024-05-27 18:11:11] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2024-05-27 18:11:11] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 18:11:11] [INFO ] [Nat]Added 43 Read/Feed constraints in 23 ms returned sat
[2024-05-27 18:11:11] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-27 18:11:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2024-05-27 18:11:11] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 24 ms.
[2024-05-27 18:11:11] [INFO ] Added : 5 causal constraints over 1 iterations in 68 ms. Result :sat
Parikh directed walk for 6600 steps, including 727 resets, run took 34 ms. (steps per millisecond=194 )
Random directed walk for 500000 steps, including 0 resets, run took 750 ms (no deadlock found). (steps per millisecond=666 )
Random walk for 500000 steps, including 0 resets, run took 976 ms (no deadlock found). (steps per millisecond=512 )
Random directed walk for 500001 steps, including 0 resets, run took 747 ms (no deadlock found). (steps per millisecond=669 )
Random walk for 500000 steps, including 0 resets, run took 970 ms (no deadlock found). (steps per millisecond=515 )
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 12 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 18:11:15] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 18:11:15] [INFO ] Invariant cache hit.
[2024-05-27 18:11:15] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-27 18:11:15] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 18:11:15] [INFO ] Invariant cache hit.
[2024-05-27 18:11:15] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 18:11:15] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-27 18:11:15] [INFO ] Redundant transitions in 3 ms returned []
Running 409 sub problems to find dead transitions.
[2024-05-27 18:11:15] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 18:11:15] [INFO ] Invariant cache hit.
[2024-05-27 18:11:15] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 18:11:17] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2024-05-27 18:11:17] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-27 18:11:17] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-27 18:11:17] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-05-27 18:11:17] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 8 ms to minimize.
[2024-05-27 18:11:18] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-27 18:11:18] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-27 18:11:18] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-05-27 18:11:18] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-27 18:11:18] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2024-05-27 18:11:18] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2024-05-27 18:11:18] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2024-05-27 18:11:18] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-27 18:11:19] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-05-27 18:11:19] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-27 18:11:19] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-27 18:11:19] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-27 18:11:19] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-27 18:11:19] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-27 18:11:19] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 18:11:22] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 18:11:23] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-05-27 18:11:24] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-27 18:11:24] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-27 18:11:24] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-27 18:11:24] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2024-05-27 18:11:24] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2024-05-27 18:11:24] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-05-27 18:11:24] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-05-27 18:11:24] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 18:11:26] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 18:11:29] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-05-27 18:11:29] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 18:11:31] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 18:11:33] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 383 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30021 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 35/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 409/792 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 18:12:02] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-27 18:12:02] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
[2024-05-27 18:12:02] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-27 18:12:02] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 18:12:14] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/797 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 797 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30017 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 40/40 constraints]
After SMT, in 60488ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60494ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 60687 ms. Remains : 138/138 places, 415/415 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2486 ms (no deadlock found). (steps per millisecond=502 )
Random directed walk for 1250002 steps, including 0 resets, run took 1882 ms (no deadlock found). (steps per millisecond=664 )
[2024-05-27 18:12:20] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 18:12:20] [INFO ] Invariant cache hit.
[2024-05-27 18:12:20] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-27 18:12:20] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 104 ms returned sat
[2024-05-27 18:12:20] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2024-05-27 18:12:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 18:12:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-27 18:12:20] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 28 ms returned sat
[2024-05-27 18:12:20] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2024-05-27 18:12:20] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 18:12:20] [INFO ] [Nat]Added 43 Read/Feed constraints in 22 ms returned sat
[2024-05-27 18:12:20] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 0 ms to minimize.
[2024-05-27 18:12:20] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-27 18:12:20] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-27 18:12:20] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-27 18:12:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 268 ms
[2024-05-27 18:12:21] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 22 ms.
[2024-05-27 18:12:21] [INFO ] Added : 8 causal constraints over 2 iterations in 73 ms. Result :sat
Parikh directed walk for 9800 steps, including 783 resets, run took 37 ms. (steps per millisecond=264 )
Random directed walk for 500000 steps, including 0 resets, run took 742 ms (no deadlock found). (steps per millisecond=673 )
Random walk for 500000 steps, including 0 resets, run took 964 ms (no deadlock found). (steps per millisecond=518 )
Random directed walk for 500002 steps, including 0 resets, run took 744 ms (no deadlock found). (steps per millisecond=672 )
Random walk for 500000 steps, including 0 resets, run took 969 ms (no deadlock found). (steps per millisecond=515 )
[2024-05-27 18:12:24] [INFO ] Flatten gal took : 81 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 144/144 places, 451/451 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 138 transition count 451
Applied a total of 6 rules in 8 ms. Remains 138 /144 variables (removed 6) and now considering 451/451 (removed 0) transitions.
[2024-05-27 18:12:24] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 18:12:24] [INFO ] Computed 29 invariants in 12 ms
[2024-05-27 18:12:25] [INFO ] Implicit Places using invariants in 280 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 286 ms to find 6 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 132/144 places, 451/451 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 445
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 445
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 559
Applied a total of 24 rules in 18 ms. Remains 120 /132 variables (removed 12) and now considering 559/451 (removed -108) transitions.
[2024-05-27 18:12:25] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
// Phase 1: matrix 350 rows 120 cols
[2024-05-27 18:12:25] [INFO ] Computed 23 invariants in 4 ms
[2024-05-27 18:12:25] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-27 18:12:25] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
[2024-05-27 18:12:25] [INFO ] Invariant cache hit.
[2024-05-27 18:12:25] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 18:12:25] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 120/144 places, 559/451 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1013 ms. Remains : 120/144 places, 559/451 transitions.
Discarding 144 transitions out of 559. Remains 415
Initial state reduction rules removed 6 formulas.
[2024-05-27 18:12:25] [INFO ] Flatten gal took : 93 ms
[2024-05-27 18:12:26] [INFO ] Flatten gal took : 97 ms
[2024-05-27 18:12:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5656637981658089671.gal : 39 ms
[2024-05-27 18:12:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10504080510081627828.prop : 4 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/ReachabilityCardinality5656637981658089671.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10504080510081627828.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...329
Loading property file /tmp/ReachabilityCardinality10504080510081627828.prop.
Reachability property qltransition_379 is true.
Reachability property qltransition_300 is true.
Reachability property qltransition_299 is true.
Reachability property qltransition_298 is true.
Reachability property qltransition_297 is true.
Reachability property qltransition_296 is true.
SDD proceeding with computation,403 properties remain. new max is 2
SDD size :1 after 2
Reachability property qltransition_409 is true.
Reachability property qltransition_306 is true.
Reachability property qltransition_305 is true.
Reachability property qltransition_304 is true.
Reachability property qltransition_303 is true.
Reachability property qltransition_295 is true.
SDD proceeding with computation,397 properties remain. new max is 2
SDD size :2 after 5
Reachability property qltransition_439 is true.
Reachability property qltransition_312 is true.
Reachability property qltransition_311 is true.
Reachability property qltransition_310 is true.
Reachability property qltransition_302 is true.
Reachability property qltransition_301 is true.
SDD proceeding with computation,391 properties remain. new max is 2
SDD size :5 after 11
SDD proceeding with computation,391 properties remain. new max is 4
SDD size :11 after 12
SDD proceeding with computation,391 properties remain. new max is 8
SDD size :12 after 16
Reachability property qltransition_469 is true.
Reachability property qltransition_318 is true.
Reachability property qltransition_317 is true.
Reachability property qltransition_309 is true.
Reachability property qltransition_308 is true.
Reachability property qltransition_307 is true.
SDD proceeding with computation,385 properties remain. new max is 8
SDD size :16 after 37
SDD proceeding with computation,385 properties remain. new max is 16
SDD size :37 after 41
SDD proceeding with computation,385 properties remain. new max is 32
SDD size :41 after 46
Reachability property qltransition_499 is true.
RANDOM walk for 40000 steps (8 resets) in 2234 ms. (17 steps per ms) remains 36/409 properties
Reachability property qltransition_324 is true.
Reachability property qltransition_316 is true.
Reachability property qltransition_315 is true.
Reachability property qltransition_314 is true.
Reachability property qltransition_313 is true.
SDD proceeding with computation,379 properties remain. new max is 32
SDD size :46 after 134
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 36/36 properties
SDD proceeding with computation,379 properties remain. new max is 64
SDD size :134 after 163
BEST_FIRST walk for 4002 steps (8 resets) in 99 ms. (40 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 91 ms. (43 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 76 ms. (51 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 36/36 properties
SDD proceeding with computation,379 properties remain. new max is 128
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
SDD size :163 after 220
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
Reachability property qltransition_373 is true.
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
Reachability property qltransition_325 is true.
Reachability property qltransition_253 is true.
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 36/36 properties
Reachability property qltransition_185 is true.
Reachability property qltransition_184 is true.
Reachability property qltransition_183 is true.
Reachability property qltransition_181 is true.
Reachability property qltransition_149 is true.
Reachability property qltransition_148 is true.
Reachability property qltransition_147 is true.
Reachability property qltransition_145 is true.
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 36/36 properties
Reachability property qltransition_113 is true.
Reachability property qltransition_112 is true.
Reachability property qltransition_111 is true.
Reachability property qltransition_109 is true.
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
Reachability property qltransition_83 is true.
Reachability property qltransition_82 is true.
Reachability property qltransition_80 is true.
Reachability property qltransition_79 is true.
Reachability property qltransition_77 is true.
Reachability property qltransition_76 is true.
Reachability property qltransition_75 is true.
Reachability property qltransition_73 is true.
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 36/36 properties
SDD proceeding with computation,356 properties remain. new max is 128
SDD size :220 after 539
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
[2024-05-27 18:12:27] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
[2024-05-27 18:12:27] [INFO ] Invariant cache hit.
[2024-05-27 18:12:27] [INFO ] State equation strengthened by 43 read => feed constraints.
Reachability property qltransition_191 is true.
Reachability property qltransition_190 is true.
Reachability property qltransition_188 is true.
Reachability property qltransition_187 is true.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Reachability property qltransition_161 is true.
Reachability property qltransition_159 is true.
Reachability property qltransition_158 is true.
Reachability property qltransition_157 is true.
Reachability property qltransition_155 is true.
Reachability property qltransition_154 is true.
Reachability property qltransition_152 is true.
Reachability property qltransition_151 is true.
Reachability property qltransition_125 is true.
Reachability property qltransition_123 is true.
Reachability property qltransition_122 is true.
Reachability property qltransition_121 is true.
Reachability property qltransition_119 is true.
Reachability property qltransition_118 is true.
Reachability property qltransition_116 is true.
Reachability property qltransition_115 is true.
Reachability property qltransition_89 is true.
Reachability property qltransition_87 is true.
Reachability property qltransition_86 is true.
Reachability property qltransition_85 is true.
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 36 unsolved
SDD proceeding with computation,332 properties remain. new max is 128
SDD size :539 after 788
At refinement iteration 2 (OVERLAPS) 38/87 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 38/92 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem qltransition_38 is UNSAT
SMT process timed out in 325ms, After SMT, problems are : Problem set: 0 solved, 36 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 559/559 transitions.
Applied a total of 0 rules in 23 ms. Remains 120 /120 variables (removed 0) and now considering 559/559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 120/120 places, 559/559 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 143277 ms.

BK_STOP 1716833548015

--------------------
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-PT-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-PT-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-171679094400264"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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