Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r147-tall-174876820000446.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is PGCD-PT-D02N100, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r147-tall-174876820000446
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 8 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 5.6K May 29 14:32 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 1748814882452

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PGCD-PT-D02N100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202505121319
[2025-06-01 21:54:43] [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]
[2025-06-01 21:54:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 21:54:43] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2025-06-01 21:54:43] [INFO ] Transformed 9 places.
[2025-06-01 21:54:43] [INFO ] Transformed 9 transitions.
[2025-06-01 21:54:43] [INFO ] Parsed PT model containing 9 places and 9 transitions and 42 arcs in 116 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 4 ms.13795KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 9/9 places, 9/9 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 11 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 9 rows 9 cols
[2025-06-01 21:54:43] [INFO ] Computed 4 invariants in 4 ms
[2025-06-01 21:54:43] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/18 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 3 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/18 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 19 constraints, problems are : Problem set: 0 solved, 3 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 340ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 351ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 398 ms. Remains : 9/9 places, 9/9 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 9/9 places, 9/9 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 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2025-06-01 21:54:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:54:44] [INFO ] Implicit Places using invariants in 56 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 63 ms to find 3 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 6/9 places, 9/9 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 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 66 ms. Remains : 6/9 places, 9/9 transitions.
Random walk for 1250069 steps, including 0 resets, run took 240 ms (no deadlock found). (steps per millisecond=5208 )
Random directed walk for 1250049 steps, including 0 resets, run took 173 ms (no deadlock found). (steps per millisecond=7225 )
// Phase 1: matrix 9 rows 6 cols
[2025-06-01 21:54:44] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-01 21:54:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 21:54:44] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-01 21:54:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-01 21:54:44] [INFO ] [Real]Added 3 Read/Feed constraints in 4 ms returned sat
[2025-06-01 21:54:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-01 21:54:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 21:54:44] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-01 21:54:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-01 21:54:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:54:44] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 4 ms to minimize.
[2025-06-01 21:54:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2025-06-01 21:54:44] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 21:54:44] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Parikh directed walk for 15600 steps, including 346 resets, run took 22 ms. (steps per millisecond=709 )
Random directed walk for 500087 steps, including 0 resets, run took 57 ms (no deadlock found). (steps per millisecond=8773 )
Random walk for 500027 steps, including 0 resets, run took 61 ms (no deadlock found). (steps per millisecond=8197 )
Random directed walk for 500036 steps, including 0 resets, run took 49 ms (no deadlock found). (steps per millisecond=10204 )
Random walk for 500017 steps, including 0 resets, run took 65 ms (no deadlock found). (steps per millisecond=7692 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 6/6 places, 9/9 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 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2025-06-01 21:54:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:54:45] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-01 21:54:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:54:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-01 21:54:45] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 21:54:45] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-01 21:54:45] [INFO ] Invariant cache hit.
[2025-06-01 21:54:45] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 125ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 186 ms. Remains : 6/6 places, 9/9 transitions.
Random walk for 1250065 steps, including 0 resets, run took 146 ms (no deadlock found). (steps per millisecond=8562 )
Random directed walk for 1250084 steps, including 0 resets, run took 127 ms (no deadlock found). (steps per millisecond=9843 )
[2025-06-01 21:54:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-01 21:54:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 21:54:45] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-01 21:54:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-01 21:54:45] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-01 21:54:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-01 21:54:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 21:54:45] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-01 21:54:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-01 21:54:45] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:54:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2025-06-01 21:54:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2025-06-01 21:54:45] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 21:54:45] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Parikh directed walk for 15600 steps, including 366 resets, run took 17 ms. (steps per millisecond=917 )
Random directed walk for 500000 steps, including 0 resets, run took 56 ms (no deadlock found). (steps per millisecond=8928 )
Random walk for 500083 steps, including 0 resets, run took 68 ms (no deadlock found). (steps per millisecond=7354 )
Random directed walk for 500087 steps, including 0 resets, run took 51 ms (no deadlock found). (steps per millisecond=9805 )
Random walk for 500077 steps, including 0 resets, run took 49 ms (no deadlock found). (steps per millisecond=10205 )
[2025-06-01 21:54:46] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10298884250945852539
[2025-06-01 21:54:46] [INFO ] Applying decomposition
[2025-06-01 21:54:46] [INFO ] Flatten gal took : 3 ms
[2025-06-01 21:54:46] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2025-06-01 21:54:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 21:54:46] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2025-06-01 21:54:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 21:54:46] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2025-06-01 21:54:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 21:54:46] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10298884250945852539
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2494813793784993201.txt' '-o' '/tmp/graph2494813793784993201.bin' '-w' '/tmp/graph2494813793784993201.weights'
Running compilation step : cd /tmp/ltsmin10298884250945852539;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2494813793784993201.bin' '-l' '-1' '-v' '-w' '/tmp/graph2494813793784993201.weights' '-q' '0' '-e' '0.001'
[2025-06-01 21:54:46] [INFO ] Decomposing Gal with order
[2025-06-01 21:54:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 21:54:46] [INFO ] Flatten gal took : 47 ms
[2025-06-01 21:54:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-01 21:54:46] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock5795519801926914280.gal : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock5795519801926914280.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.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...234
No direction supplied, using forward translation only.
Compilation finished in 225 ms.
Running link step : cd /tmp/ltsmin10298884250945852539;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin10298884250945852539;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Initializing POR dependencies: labels 9, guards 9
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: There are 9 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.007: State length is 9, there are 9 groups
pins2lts-mc-linux64( 0/ 8), 0.007: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.007: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.007: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.007: Visible groups: 0 / 9, labels: 0 / 9
pins2lts-mc-linux64( 0/ 8), 0.007: POR cycle proviso: none
pins2lts-mc-linux64( 0/ 8), 0.007: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.025: ~5 levels ~960 states ~3600 transitions
pins2lts-mc-linux64( 0/ 8), 0.041: ~6 levels ~1920 states ~6728 transitions
pins2lts-mc-linux64( 0/ 8), 0.061: ~8 levels ~3840 states ~12808 transitions
pins2lts-mc-linux64( 0/ 8), 0.093: ~10 levels ~7680 states ~24736 transitions
pins2lts-mc-linux64( 0/ 8), 0.145: ~13 levels ~15360 states ~48176 transitions
pins2lts-mc-linux64( 0/ 8), 0.262: ~16 levels ~30720 states ~94584 transitions
pins2lts-mc-linux64( 2/ 8), 0.476: ~19 levels ~61440 states ~190192 transitions
pins2lts-mc-linux64( 5/ 8), 0.651: ~22 levels ~122880 states ~374592 transitions
pins2lts-mc-linux64( 5/ 8), 1.013: ~26 levels ~245760 states ~747568 transitions
pins2lts-mc-linux64( 5/ 8), 1.479: ~31 levels ~491520 states ~1490616 transitions
pins2lts-mc-linux64( 5/ 8), 2.074: ~35 levels ~983040 states ~2973992 transitions
pins2lts-mc-linux64( 5/ 8), 2.985: ~41 levels ~1966080 states ~5930496 transitions
pins2lts-mc-linux64( 3/ 8), 4.226: ~60 levels ~3932160 states ~11827032 transitions
pins2lts-mc-linux64( 2/ 8), 7.143: ~65 levels ~7864320 states ~23665816 transitions
pins2lts-mc-linux64( 2/ 8), 14.028: ~75 levels ~15728640 states ~47283728 transitions
pins2lts-mc-linux64( 3/ 8), 26.719: ~93 levels ~31457280 states ~94453152 transitions
pins2lts-mc-linux64( 4/ 8), 53.362: ~101 levels ~62914560 states ~188872888 transitions
pins2lts-mc-linux64( 4/ 8), 108.327: ~116 levels ~125829120 states ~377639888 transitions
pins2lts-mc-linux64( 1/ 8), 124.540: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 124.574:
pins2lts-mc-linux64( 0/ 8), 124.574: mean standard work distribution: 1.5% (states) 1.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 124.574:
pins2lts-mc-linux64( 0/ 8), 124.574: Explored 129346185 states 388174567 transitions, fanout: 3.001
pins2lts-mc-linux64( 0/ 8), 124.574: Total exploration time 124.560 sec (124.530 sec minimum, 124.544 sec on average)
pins2lts-mc-linux64( 0/ 8), 124.574: States per second: 1038425, Transitions per second: 3116366
pins2lts-mc-linux64( 0/ 8), 124.574:
pins2lts-mc-linux64( 0/ 8), 124.574: Queue width: 8B, total height: 4872060, memory: 37.17MB
pins2lts-mc-linux64( 0/ 8), 124.574: Tree memory: 1188.9MB, 9.3 B/state, compr.: 24.4%
pins2lts-mc-linux64( 0/ 8), 124.574: Tree fill ratio (roots/leafs): 99.0%/64.0%
pins2lts-mc-linux64( 0/ 8), 124.574: Stored 10 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 124.574: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 124.574: Est. total memory use: 1226.0MB (~1061.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10298884250945852539;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10298884250945852539;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-01 22:04:46] [INFO ] Flatten gal took : 4 ms
[2025-06-01 22:04:46] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock1794003939659341743.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock1794003939659341743.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...255
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,5.58817e+09,378.552,2245776,2,95078,5,5.71497e+06,6,0,57,5.71558e+06,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,397.147,2245776,1,0,6,5.71497e+06,9,1,2949,5.71558e+06,2

System contains 0 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
EmptySet
Total runtime 1000400 ms.

BK_STOP 1748815884113

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-D02N100"
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-5832"
echo " Executing tool itstools"
echo " Input is PGCD-PT-D02N100, 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 r147-tall-174876820000446"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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