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.r264-tall-171654374000476.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 gold2023
Input is PGCD-PT-D03N050, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r264-tall-171654374000476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.0K Apr 11 15:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 11 15:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 11 15:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 11 15:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 6 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 6 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 6 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 6 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 15:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 15:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 11 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 7.4K 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 1716640803116

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PGCD-PT-D03N050
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202304061127
[2024-05-25 12:40:04] [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-25 12:40:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 12:40:04] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2024-05-25 12:40:04] [INFO ] Transformed 12 places.
[2024-05-25 12:40:04] [INFO ] Transformed 12 transitions.
[2024-05-25 12:40:04] [INFO ] Parsed PT model containing 12 places and 12 transitions and 56 arcs in 75 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 3 ms.24227KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 12/12 places, 12/12 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 132 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2024-05-25 12:40:05] [INFO ] Computed 5 invariants in 5 ms
[2024-05-25 12:40:05] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 311 ms. Remains : 12/12 places, 12/12 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 12/12 places, 12/12 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 2 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-25 12:40:05] [INFO ] Invariant cache hit.
[2024-05-25 12:40:05] [INFO ] Implicit Places using invariants in 44 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 46 ms to find 4 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 8/12 places, 12/12 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 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 49 ms. Remains : 8/12 places, 12/12 transitions.
Random walk for 1250055 steps, including 0 resets, run took 226 ms (no deadlock found). (steps per millisecond=5531 )
Random directed walk for 1250024 steps, including 0 resets, run took 172 ms (no deadlock found). (steps per millisecond=7267 )
// Phase 1: matrix 12 rows 8 cols
[2024-05-25 12:40:05] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 12:40:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 12:40:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:40:05] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 12:40:05] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 12:40:05] [INFO ] [Real]Added 4 Read/Feed constraints in 8 ms returned sat
[2024-05-25 12:40:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:40:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 12:40:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:40:05] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-25 12:40:05] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 12:40:05] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-05-25 12:40:05] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 5 ms to minimize.
[2024-05-25 12:40:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-25 12:40:05] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 12:40:05] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
Parikh directed walk for 8500 steps, including 185 resets, run took 13 ms. (steps per millisecond=653 )
Random directed walk for 500004 steps, including 0 resets, run took 61 ms (no deadlock found). (steps per millisecond=8196 )
Random walk for 500002 steps, including 0 resets, run took 75 ms (no deadlock found). (steps per millisecond=6666 )
Random directed walk for 500023 steps, including 0 resets, run took 69 ms (no deadlock found). (steps per millisecond=7246 )
Random walk for 500068 steps, including 0 resets, run took 66 ms (no deadlock found). (steps per millisecond=7576 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 8/8 places, 12/12 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 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-25 12:40:06] [INFO ] Invariant cache hit.
[2024-05-25 12:40:06] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 12:40:06] [INFO ] Invariant cache hit.
[2024-05-25 12:40:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 12:40:06] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-25 12:40:06] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 12:40:06] [INFO ] Invariant cache hit.
[2024-05-25 12:40:06] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 89 ms. Remains : 8/8 places, 12/12 transitions.
Random walk for 1250045 steps, including 0 resets, run took 149 ms (no deadlock found). (steps per millisecond=8389 )
Random directed walk for 1250035 steps, including 0 resets, run took 145 ms (no deadlock found). (steps per millisecond=8620 )
[2024-05-25 12:40:06] [INFO ] Invariant cache hit.
[2024-05-25 12:40:06] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 12:40:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:40:06] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 12:40:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 12:40:06] [INFO ] [Real]Added 4 Read/Feed constraints in 3 ms returned sat
[2024-05-25 12:40:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:40:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 12:40:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:40:06] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-25 12:40:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 12:40:06] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-25 12:40:06] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-25 12:40:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2024-05-25 12:40:06] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 12:40:06] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
Parikh directed walk for 8500 steps, including 187 resets, run took 11 ms. (steps per millisecond=772 )
Random directed walk for 500037 steps, including 0 resets, run took 57 ms (no deadlock found). (steps per millisecond=8772 )
Random walk for 500004 steps, including 0 resets, run took 77 ms (no deadlock found). (steps per millisecond=6493 )
Random directed walk for 500035 steps, including 0 resets, run took 70 ms (no deadlock found). (steps per millisecond=7143 )
Random walk for 500019 steps, including 0 resets, run took 68 ms (no deadlock found). (steps per millisecond=7353 )
[2024-05-25 12:40:06] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6618200628968093265
[2024-05-25 12:40:06] [INFO ] Applying decomposition
[2024-05-25 12:40:06] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2024-05-25 12:40:06] [INFO ] Flatten gal took : 3 ms
[2024-05-25 12:40:06] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:40:06] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2024-05-25 12:40:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:40:06] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2024-05-25 12:40:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:40:06] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6618200628968093265
Running compilation step : cd /tmp/ltsmin6618200628968093265;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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.202304061127/bin/convert-linux64' '-i' '/tmp/graph13694850682561623007.txt' '-o' '/tmp/graph13694850682561623007.bin' '-w' '/tmp/graph13694850682561623007.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13694850682561623007.bin' '-l' '-1' '-v' '-w' '/tmp/graph13694850682561623007.weights' '-q' '0' '-e' '0.001'
[2024-05-25 12:40:07] [INFO ] Decomposing Gal with order
[2024-05-25 12:40:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 12:40:07] [INFO ] Flatten gal took : 24 ms
[2024-05-25 12:40:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-25 12:40:07] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock11422875982827487974.gal : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock11422875982827487974.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.202304061127/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...235
No direction supplied, using forward translation only.
Compilation finished in 234 ms.
Running link step : cd /tmp/ltsmin6618200628968093265;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin6618200628968093265;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Initializing POR dependencies: labels 12, guards 12
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: There are 12 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.012: State length is 12, there are 12 groups
pins2lts-mc-linux64( 0/ 8), 0.012: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.012: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.012: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.012: Visible groups: 0 / 12, labels: 0 / 12
pins2lts-mc-linux64( 0/ 8), 0.012: POR cycle proviso: none
pins2lts-mc-linux64( 0/ 8), 0.012: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.031: ~5 levels ~960 states ~4808 transitions
pins2lts-mc-linux64( 0/ 8), 0.052: ~5 levels ~1920 states ~8752 transitions
pins2lts-mc-linux64( 0/ 8), 0.084: ~6 levels ~3840 states ~15496 transitions
pins2lts-mc-linux64( 2/ 8), 0.157: ~5 levels ~7680 states ~25752 transitions
pins2lts-mc-linux64( 2/ 8), 0.223: ~6 levels ~15360 states ~51728 transitions
pins2lts-mc-linux64( 2/ 8), 0.389: ~8 levels ~30720 states ~102016 transitions
pins2lts-mc-linux64( 5/ 8), 0.657: ~11 levels ~61440 states ~203640 transitions
pins2lts-mc-linux64( 0/ 8), 1.004: ~16 levels ~122880 states ~389968 transitions
pins2lts-mc-linux64( 0/ 8), 1.482: ~19 levels ~245760 states ~764328 transitions
pins2lts-mc-linux64( 4/ 8), 1.998: ~17 levels ~491520 states ~1598592 transitions
pins2lts-mc-linux64( 4/ 8), 2.740: ~20 levels ~983040 states ~3149560 transitions
pins2lts-mc-linux64( 6/ 8), 3.862: ~21 levels ~1966080 states ~6072408 transitions
pins2lts-mc-linux64( 2/ 8), 6.312: ~27 levels ~3932160 states ~11924592 transitions
pins2lts-mc-linux64( 6/ 8), 11.651: ~29 levels ~7864320 states ~24043816 transitions
pins2lts-mc-linux64( 6/ 8), 21.720: ~34 levels ~15728640 states ~47878464 transitions
pins2lts-mc-linux64( 7/ 8), 40.022: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 40.113:
pins2lts-mc-linux64( 0/ 8), 40.114: mean standard work distribution: 2.3% (states) 2.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 40.114:
pins2lts-mc-linux64( 0/ 8), 40.114: Explored 28214171 states 85584263 transitions, fanout: 3.033
pins2lts-mc-linux64( 0/ 8), 40.114: Total exploration time 40.070 sec (40.030 sec minimum, 40.048 sec on average)
pins2lts-mc-linux64( 0/ 8), 40.114: States per second: 704122, Transitions per second: 2135869
pins2lts-mc-linux64( 0/ 8), 40.114:
pins2lts-mc-linux64( 0/ 8), 40.114: Queue width: 8B, total height: 3552306, memory: 27.10MB
pins2lts-mc-linux64( 0/ 8), 40.114: Tree memory: 498.4MB, 16.5 B/state, compr.: 32.9%
pins2lts-mc-linux64( 0/ 8), 40.114: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 40.114: Stored 12 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 40.114: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 40.114: Est. total memory use: 525.5MB (~1051.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6618200628968093265;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6618200628968093265;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
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,4.17215e+11,337.864,1329192,1386,10995,948228,98675,32,399666,24,574242,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,364.284,1341684,1,0,948228,1.66301e+06,65,399666,692,4.93656e+06,9213

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

BK_STOP 1716641194907

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="PGCD-PT-D03N050"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is PGCD-PT-D03N050, 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 r264-tall-171654374000476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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