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.r233-tall-171649622300001.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 JoinFreeModules-PT-0003, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-171649622300001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 11 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 11 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.4K May 18 16:42 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 1716534711185

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=JoinFreeModules-PT-0003
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202405141337
[2024-05-24 07:11:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-24 07:11:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 07:11:52] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2024-05-24 07:11:52] [INFO ] Transformed 16 places.
[2024-05-24 07:11:52] [INFO ] Transformed 25 transitions.
[2024-05-24 07:11:52] [INFO ] Parsed PT model containing 16 places and 25 transitions and 71 arcs in 145 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 1 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 3 ms.19079KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 15/15 places, 25/25 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 16 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Running 18 sub problems to find dead transitions.
// Phase 1: matrix 25 rows 15 cols
[2024-05-24 07:11:52] [INFO ] Computed 3 invariants in 3 ms
[2024-05-24 07:11:52] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-24 07:11:52] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 14 ms to minimize.
[2024-05-24 07:11:53] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-24 07:11:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/40 variables, and 24 constraints, problems are : Problem set: 0 solved, 18 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 18/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/40 variables, and 42 constraints, problems are : Problem set: 0 solved, 18 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
After SMT, in 889ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 899ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 961 ms. Remains : 15/15 places, 25/25 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 15/15 places, 25/25 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 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-24 07:11:53] [INFO ] Invariant cache hit.
[2024-05-24 07:11:53] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-24 07:11:53] [INFO ] Invariant cache hit.
[2024-05-24 07:11:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-24 07:11:53] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-24 07:11:53] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-24 07:11:53] [INFO ] Invariant cache hit.
[2024-05-24 07:11:53] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-24 07:11:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
[2024-05-24 07:11:53] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 2 ms to minimize.
[2024-05-24 07:11:53] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/40 variables, and 24 constraints, problems are : Problem set: 0 solved, 18 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 18/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/40 variables, and 42 constraints, problems are : Problem set: 0 solved, 18 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
After SMT, in 611ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 612ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 669 ms. Remains : 15/15 places, 25/25 transitions.
Random walk for 1250000 steps, including 0 resets, run took 978 ms (no deadlock found). (steps per millisecond=1278 )
Random directed walk for 1250001 steps, including 0 resets, run took 781 ms (no deadlock found). (steps per millisecond=1600 )
[2024-05-24 07:11:56] [INFO ] Invariant cache hit.
[2024-05-24 07:11:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 07:11:56] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-24 07:11:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 07:11:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 07:11:56] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-24 07:11:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-24 07:11:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2024-05-24 07:11:56] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 07:11:56] [INFO ] Added : 10 causal constraints over 2 iterations in 20 ms. Result :sat
Parikh directed walk for 3500 steps, including 166 resets, run took 15 ms. (steps per millisecond=233 )
Random directed walk for 500001 steps, including 0 resets, run took 480 ms (no deadlock found). (steps per millisecond=1041 )
Random walk for 500000 steps, including 0 resets, run took 347 ms (no deadlock found). (steps per millisecond=1440 )
Random directed walk for 500004 steps, including 0 resets, run took 306 ms (no deadlock found). (steps per millisecond=1634 )
Random walk for 500000 steps, including 0 resets, run took 348 ms (no deadlock found). (steps per millisecond=1436 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 15/15 places, 25/25 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 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-24 07:11:57] [INFO ] Invariant cache hit.
[2024-05-24 07:11:57] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 07:11:57] [INFO ] Invariant cache hit.
[2024-05-24 07:11:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-24 07:11:57] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-24 07:11:57] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-24 07:11:57] [INFO ] Invariant cache hit.
[2024-05-24 07:11:57] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-24 07:11:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-24 07:11:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-24 07:11:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/40 variables, and 24 constraints, problems are : Problem set: 0 solved, 18 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 18/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/40 variables, and 42 constraints, problems are : Problem set: 0 solved, 18 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
After SMT, in 487ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 488ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 556 ms. Remains : 15/15 places, 25/25 transitions.
Random walk for 1250000 steps, including 0 resets, run took 831 ms (no deadlock found). (steps per millisecond=1504 )
Random directed walk for 1250000 steps, including 0 resets, run took 750 ms (no deadlock found). (steps per millisecond=1666 )
[2024-05-24 07:11:59] [INFO ] Invariant cache hit.
[2024-05-24 07:11:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 07:11:59] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 07:11:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 07:11:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 07:11:59] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-24 07:11:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-24 07:11:59] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2024-05-24 07:11:59] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 07:11:59] [INFO ] Added : 10 causal constraints over 2 iterations in 16 ms. Result :sat
Parikh directed walk for 3500 steps, including 164 resets, run took 6 ms. (steps per millisecond=583 )
Random directed walk for 500005 steps, including 0 resets, run took 317 ms (no deadlock found). (steps per millisecond=1577 )
Random walk for 500000 steps, including 0 resets, run took 344 ms (no deadlock found). (steps per millisecond=1453 )
Random directed walk for 500002 steps, including 0 resets, run took 306 ms (no deadlock found). (steps per millisecond=1633 )
Random walk for 500000 steps, including 0 resets, run took 343 ms (no deadlock found). (steps per millisecond=1457 )
[2024-05-24 07:12:01] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6549411713220497155
[2024-05-24 07:12:01] [INFO ] Applying decomposition
[2024-05-24 07:12:01] [INFO ] Flatten gal took : 4 ms
[2024-05-24 07:12:01] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2024-05-24 07:12:01] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 07:12:01] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2024-05-24 07:12:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 07:12:01] [INFO ] Computing Do-Not-Accords matrix : 25 transitions.
[2024-05-24 07:12:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 07:12:01] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6549411713220497155
Running compilation step : cd /tmp/ltsmin6549411713220497155;'/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/graph11258839483981411428.txt' '-o' '/tmp/graph11258839483981411428.bin' '-w' '/tmp/graph11258839483981411428.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11258839483981411428.bin' '-l' '-1' '-v' '-w' '/tmp/graph11258839483981411428.weights' '-q' '0' '-e' '0.001'
[2024-05-24 07:12:01] [INFO ] Decomposing Gal with order
[2024-05-24 07:12:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 07:12:01] [INFO ] Flatten gal took : 31 ms
[2024-05-24 07:12:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-24 07:12:01] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock6928517797743844077.gal : 4 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/ReachabilityDeadlock6928517797743844077.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.
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,35937,0.015669,3476,32,29,238,191,76,272,45,397,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.017271,3476,1,0,238,308,147,354,152,569,212

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.
Total runtime 9146 ms.

BK_STOP 1716534721647

--------------------
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="JoinFreeModules-PT-0003"
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 JoinFreeModules-PT-0003, 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 r233-tall-171649622300001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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