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.r255-tall-171654365400456.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 PGCD-COL-D05N025, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r255-tall-171654365400456
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 6.8K Apr 11 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 11 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 11 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 6 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 6 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 6 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 6 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 15:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 11 15:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 11 15:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 11 15:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11K 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 1716637464209

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PGCD-COL-D05N025
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
ReachabilityDeadlock COL
Running Version 202405141337
[2024-05-25 11:44:25] [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 11:44:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 11:44:25] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 11:44:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 11:44:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 495 ms
[2024-05-25 11:44:26] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 18 PT places and 18.0 transition bindings in 18 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 11:44:26] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 5 ms.
[2024-05-25 11:44:26] [INFO ] Skeletonized 1 HLPN properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Arc [1:1*[(MOD (ADD $x 1) 6)]] contains successor/predecessor on variables of sort CD
[2024-05-25 11:44:26] [INFO ] Unfolded HLPN to a Petri net with 18 places and 18 transitions 84 arcs in 13 ms.
[2024-05-25 11:44:26] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Built sparse matrix representations for Structural reductions in 0 ms.25268KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 18/18 places, 18/18 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 22 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 18 rows 18 cols
[2024-05-25 11:44:26] [INFO ] Computed 7 invariants in 9 ms
[2024-05-25 11:44:26] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 6/18 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 18/36 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/36 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 31 constraints, problems are : Problem set: 0 solved, 6 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 6/18 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 18/36 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 37 constraints, problems are : Problem set: 0 solved, 6 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 458ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 469ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 555 ms. Remains : 18/18 places, 18/18 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 18/18 places, 18/18 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 3 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-25 11:44:26] [INFO ] Invariant cache hit.
[2024-05-25 11:44:26] [INFO ] Implicit Places using invariants in 46 ms returned [12, 13, 14, 15, 16, 17]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 52 ms to find 6 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 12/18 places, 18/18 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 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 57 ms. Remains : 12/18 places, 18/18 transitions.
Random walk for 1250008 steps, including 0 resets, run took 387 ms (no deadlock found). (steps per millisecond=3229 )
Random directed walk for 1250039 steps, including 0 resets, run took 227 ms (no deadlock found). (steps per millisecond=5506 )
// Phase 1: matrix 18 rows 12 cols
[2024-05-25 11:44:27] [INFO ] Computed 1 invariants in 3 ms
[2024-05-25 11:44:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 11:44:27] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 11:44:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 11:44:27] [INFO ] [Real]Added 6 Read/Feed constraints in 2 ms returned sat
[2024-05-25 11:44:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:44:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 11:44:27] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 11:44:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 11:44:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 11:44:27] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 6 ms to minimize.
[2024-05-25 11:44:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-25 11:44:27] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 11:44:27] [INFO ] Added : 2 causal constraints over 1 iterations in 23 ms. Result :sat
Parikh directed walk for 5400 steps, including 149 resets, run took 11 ms. (steps per millisecond=490 )
Random directed walk for 500021 steps, including 0 resets, run took 77 ms (no deadlock found). (steps per millisecond=6493 )
Random walk for 500031 steps, including 0 resets, run took 105 ms (no deadlock found). (steps per millisecond=4762 )
Random directed walk for 500011 steps, including 0 resets, run took 86 ms (no deadlock found). (steps per millisecond=5814 )
Random walk for 500047 steps, including 0 resets, run took 85 ms (no deadlock found). (steps per millisecond=5882 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 12/12 places, 18/18 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 18/18 (removed 0) transitions.
[2024-05-25 11:44:27] [INFO ] Invariant cache hit.
[2024-05-25 11:44:27] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-25 11:44:27] [INFO ] Invariant cache hit.
[2024-05-25 11:44:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 11:44:28] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-25 11:44:28] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-25 11:44:28] [INFO ] Invariant cache hit.
[2024-05-25 11:44:28] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 25 constraints, problems are : Problem set: 0 solved, 6 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 178ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 179ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 289 ms. Remains : 12/12 places, 18/18 transitions.
Random walk for 1250009 steps, including 0 resets, run took 211 ms (no deadlock found). (steps per millisecond=5924 )
Random directed walk for 1250000 steps, including 0 resets, run took 188 ms (no deadlock found). (steps per millisecond=6648 )
[2024-05-25 11:44:28] [INFO ] Invariant cache hit.
[2024-05-25 11:44:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 11:44:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 11:44:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 11:44:28] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 11:44:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:44:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 11:44:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 11:44:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 11:44:28] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 11:44:28] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-05-25 11:44:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2024-05-25 11:44:28] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 11:44:28] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Parikh directed walk for 5400 steps, including 126 resets, run took 8 ms. (steps per millisecond=675 )
Random directed walk for 500028 steps, including 0 resets, run took 101 ms (no deadlock found). (steps per millisecond=4950 )
Random walk for 500023 steps, including 0 resets, run took 82 ms (no deadlock found). (steps per millisecond=6097 )
Random directed walk for 500032 steps, including 0 resets, run took 74 ms (no deadlock found). (steps per millisecond=6757 )
Random walk for 500006 steps, including 0 resets, run took 77 ms (no deadlock found). (steps per millisecond=6493 )
[2024-05-25 11:44:29] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10982675766052041293
[2024-05-25 11:44:29] [INFO ] Applying decomposition
[2024-05-25 11:44:29] [INFO ] Flatten gal took : 4 ms
[2024-05-25 11:44:29] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2024-05-25 11:44:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 11:44:29] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2024-05-25 11:44:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 11:44:29] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2024-05-25 11:44:29] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 11:44:29] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10982675766052041293
Running compilation step : cd /tmp/ltsmin10982675766052041293;'/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/graph4973202407620249167.txt' '-o' '/tmp/graph4973202407620249167.bin' '-w' '/tmp/graph4973202407620249167.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4973202407620249167.bin' '-l' '-1' '-v' '-w' '/tmp/graph4973202407620249167.weights' '-q' '0' '-e' '0.001'
[2024-05-25 11:44:29] [INFO ] Decomposing Gal with order
[2024-05-25 11:44:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 11:44:29] [INFO ] Flatten gal took : 16 ms
[2024-05-25 11:44:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 11:44:29] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock9876151635036665344.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock9876151635036665344.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 -...234
No direction supplied, using forward translation only.
Compilation finished in 279 ms.
Running link step : cd /tmp/ltsmin10982675766052041293;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 85 ms.
Running LTSmin : cd /tmp/ltsmin10982675766052041293;'/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'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: 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 18, guards 18
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: There are 18 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.018: State length is 18, there are 18 groups
pins2lts-mc-linux64( 0/ 8), 0.018: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.018: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.018: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.019: Visible groups: 0 / 18, labels: 0 / 18
pins2lts-mc-linux64( 0/ 8), 0.019: POR cycle proviso: none
pins2lts-mc-linux64( 0/ 8), 0.019: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 1.494: ~2 levels ~960 states ~6864 transitions
pins2lts-mc-linux64( 0/ 8), 1.581: ~5 levels ~1920 states ~12312 transitions
pins2lts-mc-linux64( 6/ 8), 1.641: ~4 levels ~3840 states ~19672 transitions
pins2lts-mc-linux64( 4/ 8), 1.804: ~5 levels ~7680 states ~36384 transitions
pins2lts-mc-linux64( 6/ 8), 2.515: ~5 levels ~15360 states ~73736 transitions
pins2lts-mc-linux64( 6/ 8), 3.185: ~6 levels ~30720 states ~133400 transitions
pins2lts-mc-linux64( 3/ 8), 3.856: ~7 levels ~61440 states ~238976 transitions
pins2lts-mc-linux64( 6/ 8), 4.966: ~8 levels ~122880 states ~503408 transitions
pins2lts-mc-linux64( 6/ 8), 7.804: ~9 levels ~245760 states ~972296 transitions
pins2lts-mc-linux64( 6/ 8), 10.247: ~10 levels ~491520 states ~1812264 transitions
pins2lts-mc-linux64( 4/ 8), 12.990: ~13 levels ~983040 states ~3531088 transitions
pins2lts-mc-linux64( 2/ 8), 15.521: ~14 levels ~1966080 states ~6879512 transitions
pins2lts-mc-linux64( 2/ 8), 19.106: ~16 levels ~3932160 states ~13816176 transitions
pins2lts-mc-linux64( 2/ 8), 27.139: ~17 levels ~7864320 states ~28214360 transitions
pins2lts-mc-linux64( 3/ 8), 42.390: ~19 levels ~15728640 states ~51793088 transitions
pins2lts-mc-linux64( 6/ 8), 74.241: ~21 levels ~31457280 states ~107929928 transitions
pins2lts-mc-linux64( 6/ 8), 139.241: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 139.320:
pins2lts-mc-linux64( 0/ 8), 139.320: mean standard work distribution: 2.0% (states) 2.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 139.320:
pins2lts-mc-linux64( 0/ 8), 139.320: Explored 59848870 states 198101682 transitions, fanout: 3.310
pins2lts-mc-linux64( 0/ 8), 139.320: Total exploration time 139.290 sec (139.230 sec minimum, 139.254 sec on average)
pins2lts-mc-linux64( 0/ 8), 139.320: States per second: 429671, Transitions per second: 1422225
pins2lts-mc-linux64( 0/ 8), 139.320:
pins2lts-mc-linux64( 0/ 8), 139.320: Queue width: 8B, total height: 20592886, memory: 157.11MB
pins2lts-mc-linux64( 0/ 8), 139.321: Tree memory: 869.7MB, 11.3 B/state, compr.: 15.3%
pins2lts-mc-linux64( 0/ 8), 139.321: Tree fill ratio (roots/leafs): 59.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 139.321: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 139.321: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 139.321: Est. total memory use: 1026.8MB (~1181.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10982675766052041293;'/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'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10982675766052041293;'/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'
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:840)
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.58554e+15,380.229,1819020,1540,6779,1.98868e+06,88597,42,620621,24,422024,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,1.24584e+06,400.907,1827724,778,160,1.98868e+06,1.26903e+06,89,620621,557,3.51161e+06,12713

System contains 1.24584e+06 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 1245836 states ] showing 10 first states
[ u5={[ p1_4=42 ]
} u4={[ p1_3=42 ]
} u3={[ p1_2=42 ]
} u2={[ p1_5=26 ]
} u1={[ p2_1=2 p0_1=2 ]
} u0={[ p2_0=2 p0_0=2 ]
} ]
[ u5={[ p1_4=42 ]
} u4={[ p1_3=42 ]
} u3={[ p1_2=42 ]
} u2={[ p2_5=2 p0_5=2 ]
} u1={[ p1_1=26 ]
} u0={[ p2_0=2 p0_0=2 ]
} ]
[ u5={[ p1_4=42 ]
} u4={[ p1_3=42 ]
} u3={[ p1_2=42 ]
} u2={[ p2_5=2 p0_5=2 ]
} u1={[ p2_1=2 p0_1=2 ]
} u0={[ p1_0=26 ]
} ]
[ u5={[ p1_4=42 ]
} u4={[ p1_3=42 ]
} u3={[ p1_2=16 ]
} u2={[ p1_5=52 ]
} u1={[ p2_1=2 p0_1=2 ]
} u0={[ p2_0=2 p0_0=2 ]
} ]
[ u5={[ p1_4=42 ]
} u4={[ p1_3=42 ]
} u3={[ p1_2=16 ]
} u2={[ p2_5=2 p0_5=2 ]
} u1={[ p1_1=52 ]
} u0={[ p2_0=2 p0_0=2 ]
} ]
[ u5={[ p1_4=42 ]
} u4={[ p1_3=42 ]
} u3={[ p1_2=16 ]
} u2={[ p2_5=2 p0_5=2 ]
} u1={[ p2_1=2 p0_1=2 ]
} u0={[ p1_0=52 ]
} ]
[ u5={[ p1_4=42 ]
} u4={[ p1_3=42 ]
} u3={[ p1_2=60 ]
} u2={[ p1_5=8 ]
} u1={[ p2_1=2 p0_1=2 ]
} u0={[ p2_0=2 p0_0=2 ]
} ]
[ u5={[ p1_4=42 ]
} u4={[ p1_3=42 ]
} u3={[ p1_2=60 ]
} u2={[ p2_5=2 p0_5=2 ]
} u1={[ p1_1=8 ]
} u0={[ p2_0=2 p0_0=2 ]
} ]
[ u5={[ p1_4=42 ]
} u4={[ p1_3=42 ]
} u3={[ p1_2=60 ]
} u2={[ p2_5=2 p0_5=2 ]
} u1={[ p2_1=2 p0_1=2 ]
} u0={[ p1_0=8 ]
} ]
[ u5={[ p1_4=42 ]
} u4={[ p1_3=42 ]
} u3={[ p1_2=24 ]
} u2={[ p1_5=44 ]
} u1={[ p2_1=2 p0_1=2 ]
} u0={[ p2_0=2 p0_0=2 ]
} ]
Total runtime 482098 ms.

BK_STOP 1716637947583

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="PGCD-COL-D05N025"
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 PGCD-COL-D05N025, 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 r255-tall-171654365400456"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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