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.r277-smll-171654416600021.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 ParamProductionCell-PT-3, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r277-smll-171654416600021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 20:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 12 20:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 20:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K 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 1716762672943

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ParamProductionCell-PT-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202405141337
[2024-05-26 22:31:15] [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-26 22:31:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:31:16] [INFO ] Load time of PNML (sax parser for PT used): 292 ms
[2024-05-26 22:31:16] [INFO ] Transformed 231 places.
[2024-05-26 22:31:16] [INFO ] Transformed 202 transitions.
[2024-05-26 22:31:16] [INFO ] Found NUPN structural information;
[2024-05-26 22:31:16] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 533 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 10 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 8 ms.20105KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 231/231 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 231 transition count 188
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 217 transition count 188
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 211 transition count 182
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 211 transition count 182
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 76 place count 193 transition count 164
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 76 rules in 247 ms. Remains 193 /231 variables (removed 38) and now considering 164/202 (removed 38) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 279 ms. Remains : 193/231 places, 164/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2415 ms (no deadlock found). (steps per millisecond=517 )
Random directed walk for 1250001 steps, including 0 resets, run took 2047 ms (no deadlock found). (steps per millisecond=610 )
// Phase 1: matrix 164 rows 193 cols
[2024-05-26 22:31:21] [INFO ] Computed 59 invariants in 23 ms
[2024-05-26 22:31:21] [INFO ] [Real]Absence check using 35 positive place invariants in 53 ms returned sat
[2024-05-26 22:31:21] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 58 ms returned sat
[2024-05-26 22:31:22] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2024-05-26 22:31:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 22:31:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 27 ms returned sat
[2024-05-26 22:31:22] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 26 ms returned sat
[2024-05-26 22:31:22] [INFO ] [Nat]Absence check using state equation in 605 ms returned sat
[2024-05-26 22:31:22] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-26 22:31:23] [INFO ] [Nat]Added 68 Read/Feed constraints in 86 ms returned sat
[2024-05-26 22:31:23] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 16 ms to minimize.
[2024-05-26 22:31:23] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 4 ms to minimize.
[2024-05-26 22:31:23] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 4 ms to minimize.
[2024-05-26 22:31:23] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 4 ms to minimize.
[2024-05-26 22:31:24] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 3 ms to minimize.
[2024-05-26 22:31:24] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 3 ms to minimize.
[2024-05-26 22:31:24] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 4 ms to minimize.
[2024-05-26 22:31:24] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 4 ms to minimize.
[2024-05-26 22:31:24] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 3 ms to minimize.
[2024-05-26 22:31:24] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 3 ms to minimize.
[2024-05-26 22:31:25] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 3 ms to minimize.
[2024-05-26 22:31:25] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-05-26 22:31:25] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-05-26 22:31:25] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 2 ms to minimize.
[2024-05-26 22:31:25] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
[2024-05-26 22:31:25] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-05-26 22:31:25] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 2 ms to minimize.
[2024-05-26 22:31:25] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 2 ms to minimize.
[2024-05-26 22:31:25] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-26 22:31:25] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-26 22:31:26] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 3 ms to minimize.
[2024-05-26 22:31:26] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 3 ms to minimize.
[2024-05-26 22:31:26] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 3 ms to minimize.
[2024-05-26 22:31:26] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 4 ms to minimize.
[2024-05-26 22:31:26] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3454 ms
[2024-05-26 22:31:26] [INFO ] Computed and/alt/rep : 155/412/155 causal constraints (skipped 7 transitions) in 25 ms.
[2024-05-26 22:31:27] [INFO ] Added : 135 causal constraints over 27 iterations in 1016 ms. Result :sat
Parikh directed walk for 26400 steps, including 904 resets, run took 141 ms. (steps per millisecond=187 )
Random directed walk for 500002 steps, including 0 resets, run took 779 ms (no deadlock found). (steps per millisecond=641 )
Random walk for 500000 steps, including 0 resets, run took 973 ms (no deadlock found). (steps per millisecond=513 )
Random directed walk for 500002 steps, including 0 resets, run took 594 ms (no deadlock found). (steps per millisecond=841 )
Random walk for 500000 steps, including 0 resets, run took 757 ms (no deadlock found). (steps per millisecond=660 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 193/193 places, 164/164 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 15 ms. Remains 193 /193 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-05-26 22:31:30] [INFO ] Invariant cache hit.
[2024-05-26 22:31:31] [INFO ] Implicit Places using invariants in 361 ms returned [15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 77, 78, 80, 92, 93, 95, 97, 98, 132, 133, 135, 137, 138, 162, 163, 166, 167, 172, 173, 175, 184]
[2024-05-26 22:31:31] [INFO ] Actually due to overlaps returned [78, 80, 77, 35, 40, 54, 64, 92, 93, 95, 132, 133, 135, 166, 167, 175, 17, 18, 22, 28, 36, 41, 55, 65, 172, 173, 184, 97, 98, 137, 138, 162, 163]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 366 ms to find 33 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 160/193 places, 164/164 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 160 transition count 143
Reduce places removed 21 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 139 transition count 143
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 42 place count 139 transition count 141
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 137 transition count 141
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 135 transition count 139
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 135 transition count 139
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 132 place count 94 transition count 98
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 132 rules in 39 ms. Remains 94 /160 variables (removed 66) and now considering 98/164 (removed 66) transitions.
// Phase 1: matrix 98 rows 94 cols
[2024-05-26 22:31:31] [INFO ] Computed 26 invariants in 2 ms
[2024-05-26 22:31:31] [INFO ] Implicit Places using invariants in 180 ms returned [15, 16, 23, 24, 33, 38]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 185 ms to find 6 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 88/193 places, 98/164 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 85 transition count 95
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 84 transition count 94
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 8 rules in 19 ms. Remains 84 /88 variables (removed 4) and now considering 94/98 (removed 4) transitions.
// Phase 1: matrix 94 rows 84 cols
[2024-05-26 22:31:31] [INFO ] Computed 20 invariants in 5 ms
[2024-05-26 22:31:31] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-26 22:31:31] [INFO ] Invariant cache hit.
[2024-05-26 22:31:31] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-26 22:31:31] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 3 : 84/193 places, 94/164 transitions.
Finished structural reductions in DEADLOCK mode , in 3 iterations and 1137 ms. Remains : 84/193 places, 94/164 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1637 ms (no deadlock found). (steps per millisecond=763 )
Random directed walk for 1250001 steps, including 0 resets, run took 1071 ms (no deadlock found). (steps per millisecond=1167 )
[2024-05-26 22:31:34] [INFO ] Invariant cache hit.
[2024-05-26 22:31:34] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-26 22:31:34] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-26 22:31:34] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2024-05-26 22:31:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 22:31:34] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-26 22:31:34] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-26 22:31:35] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-26 22:31:35] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-26 22:31:35] [INFO ] [Nat]Added 67 Read/Feed constraints in 19 ms returned sat
[2024-05-26 22:31:35] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 2 ms to minimize.
[2024-05-26 22:31:35] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
[2024-05-26 22:31:35] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 2 ms to minimize.
[2024-05-26 22:31:35] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 2 ms to minimize.
[2024-05-26 22:31:35] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 3 ms to minimize.
[2024-05-26 22:31:35] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-26 22:31:35] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-05-26 22:31:35] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-26 22:31:35] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 2 ms to minimize.
[2024-05-26 22:31:35] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
[2024-05-26 22:31:35] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 12 ms to minimize.
[2024-05-26 22:31:35] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2024-05-26 22:31:36] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 22:31:36] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 2 ms to minimize.
[2024-05-26 22:31:36] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 2 ms to minimize.
[2024-05-26 22:31:36] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-26 22:31:36] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-26 22:31:36] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1215 ms
[2024-05-26 22:31:36] [INFO ] Computed and/alt/rep : 92/216/92 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-26 22:31:36] [INFO ] Added : 89 causal constraints over 19 iterations in 363 ms. Result :sat
Parikh directed walk for 19900 steps, including 372 resets, run took 66 ms. (steps per millisecond=301 )
Random directed walk for 500003 steps, including 0 resets, run took 594 ms (no deadlock found). (steps per millisecond=841 )
Random walk for 500000 steps, including 0 resets, run took 512 ms (no deadlock found). (steps per millisecond=976 )
Random directed walk for 500003 steps, including 0 resets, run took 387 ms (no deadlock found). (steps per millisecond=1291 )
Random walk for 500000 steps, including 0 resets, run took 528 ms (no deadlock found). (steps per millisecond=946 )
[2024-05-26 22:31:39] [INFO ] Flatten gal took : 105 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12079104023799442981
[2024-05-26 22:31:39] [INFO ] Applying decomposition
[2024-05-26 22:31:39] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2024-05-26 22:31:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:31:39] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2024-05-26 22:31:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:31:39] [INFO ] Flatten gal took : 39 ms
[2024-05-26 22:31:39] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
[2024-05-26 22:31:39] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:31:39] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12079104023799442981
Running compilation step : cd /tmp/ltsmin12079104023799442981;'/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'
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/graph2244436487912435254.txt' '-o' '/tmp/graph2244436487912435254.bin' '-w' '/tmp/graph2244436487912435254.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2244436487912435254.bin' '-l' '-1' '-v' '-w' '/tmp/graph2244436487912435254.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:31:39] [INFO ] Decomposing Gal with order
[2024-05-26 22:31:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:31:39] [INFO ] Removed a total of 78 redundant transitions.
[2024-05-26 22:31:39] [INFO ] Flatten gal took : 141 ms
[2024-05-26 22:31:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2024-05-26 22:31:39] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock2035464452455103.gal : 30 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/ReachabilityDeadlock2035464452455103.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 -...231
No direction supplied, using forward translation only.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46521e+06,0.240554,11432,1449,60,16740,459,679,18782,68,1308,0


Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
dead,0,0.318367,11432,1,0,16740,459,1862,26665,245,1308,24298

System contains 0 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 0 ]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 24812 ms.

BK_STOP 1716762700364

--------------------
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="ParamProductionCell-PT-3"
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 ParamProductionCell-PT-3, 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 r277-smll-171654416600021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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