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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 21K Apr 12 15:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 12 15:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 145K Apr 12 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 605K Apr 12 15:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.4K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 79K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 245K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Apr 12 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 218K Apr 12 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 989K Apr 12 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.1K 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 1.2M 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1716833571145

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SafeBus-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202405141337
[2024-05-27 18:12:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-27 18:12:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 18:12:52] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2024-05-27 18:12:52] [INFO ] Transformed 316 places.
[2024-05-27 18:12:52] [INFO ] Transformed 1631 transitions.
[2024-05-27 18:12:52] [INFO ] Found NUPN structural information;
[2024-05-27 18:12:52] [INFO ] Parsed PT model containing 316 places and 1631 transitions and 11384 arcs in 287 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 5 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 10 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 6 ms.21293KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 306/306 places, 1631/1631 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 311 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 327 ms. Remains : 306/306 places, 1631/1631 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 306/306 places, 1631/1631 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 158 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-05-27 18:12:53] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 18:12:53] [INFO ] Computed 45 invariants in 39 ms
[2024-05-27 18:12:54] [INFO ] Implicit Places using invariants in 1450 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1482 ms to find 10 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 296/306 places, 1631/1631 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1621
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1621
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 20 rules in 198 ms. Remains 286 /296 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
[2024-05-27 18:12:54] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-05-27 18:12:54] [INFO ] Computed 35 invariants in 17 ms
[2024-05-27 18:12:55] [INFO ] Implicit Places using invariants in 897 ms returned []
[2024-05-27 18:12:55] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2024-05-27 18:12:55] [INFO ] Invariant cache hit.
[2024-05-27 18:12:55] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 18:12:58] [INFO ] Implicit Places using invariants and state equation in 2306 ms returned []
Implicit Place search using SMT with State Equation took 3222 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 286/306 places, 1621/1631 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 5064 ms. Remains : 286/306 places, 1621/1631 transitions.
Random walk for 1250000 steps, including 0 resets, run took 6713 ms (no deadlock found). (steps per millisecond=186 )
Random directed walk for 1250007 steps, including 0 resets, run took 4867 ms (no deadlock found). (steps per millisecond=256 )
[2024-05-27 18:13:09] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2024-05-27 18:13:09] [INFO ] Invariant cache hit.
[2024-05-27 18:13:09] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2024-05-27 18:13:10] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 164 ms returned sat
[2024-05-27 18:13:11] [INFO ] [Real]Absence check using state equation in 1088 ms returned sat
[2024-05-27 18:13:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 18:13:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-27 18:13:11] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 163 ms returned sat
[2024-05-27 18:13:12] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2024-05-27 18:13:12] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 18:13:12] [INFO ] [Nat]Added 111 Read/Feed constraints in 460 ms returned sat
[2024-05-27 18:13:12] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 7 ms to minimize.
[2024-05-27 18:13:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 899 ms
[2024-05-27 18:13:13] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 602 transitions) in 108 ms.
[2024-05-27 18:13:13] [INFO ] Added : 1 causal constraints over 1 iterations in 426 ms. Result :sat
Parikh directed walk for 16400 steps, including 1000 resets, run took 142 ms. (steps per millisecond=115 )
Random directed walk for 500006 steps, including 0 resets, run took 1911 ms (no deadlock found). (steps per millisecond=261 )
Random walk for 500000 steps, including 0 resets, run took 2590 ms (no deadlock found). (steps per millisecond=193 )
Random directed walk for 500000 steps, including 0 resets, run took 1911 ms (no deadlock found). (steps per millisecond=261 )
Random walk for 500000 steps, including 0 resets, run took 2583 ms (no deadlock found). (steps per millisecond=193 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 286/286 places, 1621/1621 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 116 ms. Remains 286 /286 variables (removed 0) and now considering 1621/1621 (removed 0) transitions.
[2024-05-27 18:13:23] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2024-05-27 18:13:23] [INFO ] Invariant cache hit.
[2024-05-27 18:13:24] [INFO ] Implicit Places using invariants in 1151 ms returned []
[2024-05-27 18:13:24] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2024-05-27 18:13:24] [INFO ] Invariant cache hit.
[2024-05-27 18:13:24] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 18:13:26] [INFO ] Implicit Places using invariants and state equation in 2368 ms returned []
Implicit Place search using SMT with State Equation took 3522 ms to find 0 implicit places.
[2024-05-27 18:13:26] [INFO ] Redundant transitions in 97 ms returned []
Running 1611 sub problems to find dead transitions.
[2024-05-27 18:13:26] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2024-05-27 18:13:26] [INFO ] Invariant cache hit.
[2024-05-27 18:13:26] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 286/286 constraints. Problems are: Problem set: 0 solved, 1611 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 14/300 constraints. Problems are: Problem set: 0 solved, 1611 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 21/321 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
[2024-05-27 18:13:40] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 8 ms to minimize.
[2024-05-27 18:13:40] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
[2024-05-27 18:13:40] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
[2024-05-27 18:13:40] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2024-05-27 18:13:40] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-05-27 18:13:49] [INFO ] Deduced a trap composed of 49 places in 218 ms of which 3 ms to minimize.
[2024-05-27 18:13:49] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 3 ms to minimize.
[2024-05-27 18:13:50] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 2 ms to minimize.
[2024-05-27 18:13:50] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 2 ms to minimize.
[2024-05-27 18:13:53] [INFO ] Deduced a trap composed of 36 places in 215 ms of which 2 ms to minimize.
[2024-05-27 18:13:53] [INFO ] Deduced a trap composed of 43 places in 231 ms of which 2 ms to minimize.
[2024-05-27 18:13:53] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 1 ms to minimize.
[2024-05-27 18:13:54] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 2 ms to minimize.
[2024-05-27 18:13:54] [INFO ] Deduced a trap composed of 68 places in 133 ms of which 1 ms to minimize.
[2024-05-27 18:13:54] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 2 ms to minimize.
[2024-05-27 18:13:54] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 2 ms to minimize.
[2024-05-27 18:13:55] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 17/338 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/918 variables, and 338 constraints, problems are : Problem set: 100 solved, 1511 unsolved in 30054 ms.
Refiners :[Domain max(s): 286/286 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1611/1611 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1511 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 286/286 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 14/300 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 21/321 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 17/338 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
[2024-05-27 18:14:14] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
[2024-05-27 18:14:16] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 2 ms to minimize.
[2024-05-27 18:14:28] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 1 ms to minimize.
[2024-05-27 18:14:28] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 2 ms to minimize.
[2024-05-27 18:14:28] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 1 ms to minimize.
[2024-05-27 18:14:29] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 2 ms to minimize.
[2024-05-27 18:14:31] [INFO ] Deduced a trap composed of 57 places in 139 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/918 variables, and 345 constraints, problems are : Problem set: 100 solved, 1511 unsolved in 30030 ms.
Refiners :[Domain max(s): 286/286 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1611 constraints, Known Traps: 24/24 constraints]
After SMT, in 64343ms problems are : Problem set: 100 solved, 1511 unsolved
Search for dead transitions found 100 dead transitions in 64380ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 286/286 places, 1521/1621 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 89 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-05-27 18:14:31] [INFO ] Redundant transitions in 28 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 68276 ms. Remains : 286/286 places, 1521/1621 transitions.
Random walk for 1250000 steps, including 0 resets, run took 6125 ms (no deadlock found). (steps per millisecond=204 )
Random directed walk for 1250009 steps, including 0 resets, run took 4496 ms (no deadlock found). (steps per millisecond=278 )
[2024-05-27 18:14:41] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-05-27 18:14:41] [INFO ] Computed 35 invariants in 15 ms
[2024-05-27 18:14:42] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-05-27 18:14:44] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 2268 ms returned sat
[2024-05-27 18:14:44] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2024-05-27 18:14:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 18:14:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 18:14:45] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 111 ms returned sat
[2024-05-27 18:14:45] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2024-05-27 18:14:45] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 18:14:45] [INFO ] [Nat]Added 111 Read/Feed constraints in 79 ms returned sat
[2024-05-27 18:14:45] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
[2024-05-27 18:14:45] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2024-05-27 18:14:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 867 ms
[2024-05-27 18:14:46] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 602 transitions) in 69 ms.
[2024-05-27 18:14:46] [INFO ] Added : 0 causal constraints over 0 iterations in 127 ms. Result :sat
Parikh directed walk for 12000 steps, including 999 resets, run took 80 ms. (steps per millisecond=150 )
Random directed walk for 500000 steps, including 0 resets, run took 1817 ms (no deadlock found). (steps per millisecond=275 )
Random walk for 500000 steps, including 0 resets, run took 2441 ms (no deadlock found). (steps per millisecond=204 )
Random directed walk for 500008 steps, including 0 resets, run took 1812 ms (no deadlock found). (steps per millisecond=275 )
Random walk for 500000 steps, including 0 resets, run took 2446 ms (no deadlock found). (steps per millisecond=204 )
[2024-05-27 18:14:55] [INFO ] Flatten gal took : 184 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11179738265054529938
[2024-05-27 18:14:55] [INFO ] Too many transitions (1631) to apply POR reductions. Disabling POR matrices.
[2024-05-27 18:14:55] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11179738265054529938
[2024-05-27 18:14:55] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin11179738265054529938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-27 18:14:56] [INFO ] Flatten gal took : 107 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/graph1793400156691110110.txt' '-o' '/tmp/graph1793400156691110110.bin' '-w' '/tmp/graph1793400156691110110.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1793400156691110110.bin' '-l' '-1' '-v' '-w' '/tmp/graph1793400156691110110.weights' '-q' '0' '-e' '0.001'
[2024-05-27 18:14:56] [INFO ] Decomposing Gal with order
[2024-05-27 18:14:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 18:14:56] [INFO ] Removed a total of 3821 redundant transitions.
[2024-05-27 18:14:56] [INFO ] Flatten gal took : 488 ms
[2024-05-27 18:14:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 639 labels/synchronizations in 61 ms.
[2024-05-27 18:14:57] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock10392314791130556143.gal : 13 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/ReachabilityDeadlock10392314791130556143.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK'

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 -...235
No direction supplied, using forward translation only.
Compilation finished in 4531 ms.
Running link step : cd /tmp/ltsmin11179738265054529938;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin11179738265054529938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'
Detected timeout of ITS tools.
[2024-05-27 18:25:38] [INFO ] Applying decomposition
[2024-05-27 18:25:39] [INFO ] Flatten gal took : 236 ms
[2024-05-27 18:25:39] [INFO ] Decomposing Gal with order
[2024-05-27 18:25:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 18:25:39] [INFO ] Removed a total of 5185 redundant transitions.
[2024-05-27 18:25:39] [INFO ] Flatten gal took : 455 ms
[2024-05-27 18:25:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 431 labels/synchronizations in 97 ms.
[2024-05-27 18:25:39] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock17537865166828329085.gal : 7 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/ReachabilityDeadlock17537865166828329085.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK'

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 -...235
No direction supplied, using forward translation only.
Detected timeout of ITS tools.
[2024-05-27 18:36:21] [INFO ] Flatten gal took : 196 ms
[2024-05-27 18:36:22] [INFO ] Input system was already deterministic with 1631 transitions.
[2024-05-27 18:36:22] [INFO ] Transformed 306 places.
[2024-05-27 18:36:22] [INFO ] Transformed 1631 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-27 18:36:52] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock10102674570391281769.gal : 36 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/ReachabilityDeadlock10102674570391281769.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK' '--load-order' '/home/mcc/execution/model.ord' '--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 -...301
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.

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
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -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 ReachabilityDeadlock -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-10"
export BK_EXAMINATION="ReachabilityDeadlock"
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-10, examination is ReachabilityDeadlock"
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-171679094400266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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