fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r255-tall-171654365400446
Last Updated
July 7, 2024

About the Execution of ITS-Tools for PGCD-COL-D04N025

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2161.936 153151.00 343358.00 342.80 T normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 7.6K Apr 11 15:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 15:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 11 15:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 27K Apr 11 15:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 6 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 13K Apr 11 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 11 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 11 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 15:35 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 1716636316045

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-D04N025
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
ReachabilityDeadlock COL
Running Version 202405141337
[2024-05-25 11:25:17] [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:25:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 11:25:17] [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:25:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 11:25:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 524 ms
[2024-05-25 11:25:17] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 15 PT places and 15.0 transition bindings in 14 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:25:17] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 3 ms.
[2024-05-25 11:25:17] [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) 5)]] contains successor/predecessor on variables of sort CD
[2024-05-25 11:25:17] [INFO ] Unfolded HLPN to a Petri net with 15 places and 15 transitions 70 arcs in 12 ms.
[2024-05-25 11:25:17] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Built sparse matrix representations for Structural reductions in 0 ms.25522KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 15/15 places, 15/15 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 10 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
// Phase 1: matrix 15 rows 15 cols
[2024-05-25 11:25:17] [INFO ] Computed 6 invariants in 6 ms
[2024-05-25 11:25:17] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 5/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 15/30 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 26 constraints, problems are : Problem set: 0 solved, 5 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 15/15 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 5/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 15/30 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 31 constraints, problems are : Problem set: 0 solved, 5 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 15/15 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 351ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 361ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 407 ms. Remains : 15/15 places, 15/15 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 15/15 places, 15/15 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 15/15 (removed 0) transitions.
[2024-05-25 11:25:18] [INFO ] Invariant cache hit.
[2024-05-25 11:25:18] [INFO ] Implicit Places using invariants in 48 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 54 ms to find 5 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 10/15 places, 15/15 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 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 58 ms. Remains : 10/15 places, 15/15 transitions.
Random walk for 1250009 steps, including 0 resets, run took 308 ms (no deadlock found). (steps per millisecond=4058 )
Random directed walk for 1250028 steps, including 0 resets, run took 187 ms (no deadlock found). (steps per millisecond=6684 )
// Phase 1: matrix 15 rows 10 cols
[2024-05-25 11:25:18] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 11:25:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 11:25:18] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 11:25:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 11:25:18] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-25 11:25:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:25:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 11:25:18] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 11:25:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 11:25:18] [INFO ] [Nat]Added 5 Read/Feed constraints in 3 ms returned sat
[2024-05-25 11:25:18] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 7 ms to minimize.
[2024-05-25 11:25:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-25 11:25:19] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-25 11:25:19] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Parikh directed walk for 5200 steps, including 127 resets, run took 9 ms. (steps per millisecond=577 )
Random directed walk for 500033 steps, including 0 resets, run took 69 ms (no deadlock found). (steps per millisecond=7246 )
Random walk for 500026 steps, including 0 resets, run took 84 ms (no deadlock found). (steps per millisecond=5952 )
Random directed walk for 500015 steps, including 0 resets, run took 70 ms (no deadlock found). (steps per millisecond=7143 )
Random walk for 500000 steps, including 0 resets, run took 68 ms (no deadlock found). (steps per millisecond=7352 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 10/10 places, 15/15 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 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-25 11:25:19] [INFO ] Invariant cache hit.
[2024-05-25 11:25:19] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-25 11:25:19] [INFO ] Invariant cache hit.
[2024-05-25 11:25:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 11:25:19] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-25 11:25:19] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-25 11:25:19] [INFO ] Invariant cache hit.
[2024-05-25 11:25:19] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 126ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 192 ms. Remains : 10/10 places, 15/15 transitions.
Random walk for 1250000 steps, including 0 resets, run took 192 ms (no deadlock found). (steps per millisecond=6510 )
Random directed walk for 1250015 steps, including 0 resets, run took 178 ms (no deadlock found). (steps per millisecond=7022 )
[2024-05-25 11:25:19] [INFO ] Invariant cache hit.
[2024-05-25 11:25:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 11:25:19] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 11:25:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 11:25:19] [INFO ] [Real]Added 5 Read/Feed constraints in 4 ms returned sat
[2024-05-25 11:25:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:25:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 11:25:19] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 11:25:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 11:25:19] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-25 11:25:19] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-25 11:25:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2024-05-25 11:25:19] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 11:25:19] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Parikh directed walk for 5200 steps, including 126 resets, run took 7 ms. (steps per millisecond=742 )
Random directed walk for 500042 steps, including 0 resets, run took 65 ms (no deadlock found). (steps per millisecond=7692 )
Random walk for 500001 steps, including 0 resets, run took 71 ms (no deadlock found). (steps per millisecond=7042 )
Random directed walk for 500004 steps, including 0 resets, run took 64 ms (no deadlock found). (steps per millisecond=7812 )
Random walk for 500014 steps, including 0 resets, run took 67 ms (no deadlock found). (steps per millisecond=7462 )
[2024-05-25 11:25:20] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6126235627684402336
[2024-05-25 11:25:20] [INFO ] Applying decomposition
[2024-05-25 11:25:20] [INFO ] Flatten gal took : 4 ms
[2024-05-25 11:25:20] [INFO ] Computing symmetric may disable matrix : 15 transitions.
[2024-05-25 11:25:20] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 11:25:20] [INFO ] Computing symmetric may enable matrix : 15 transitions.
[2024-05-25 11:25:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 11:25:20] [INFO ] Computing Do-Not-Accords matrix : 15 transitions.
[2024-05-25 11:25:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 11:25:20] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6126235627684402336
Running compilation step : cd /tmp/ltsmin6126235627684402336;'/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/graph3821003702082227393.txt' '-o' '/tmp/graph3821003702082227393.bin' '-w' '/tmp/graph3821003702082227393.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3821003702082227393.bin' '-l' '-1' '-v' '-w' '/tmp/graph3821003702082227393.weights' '-q' '0' '-e' '0.001'
[2024-05-25 11:25:20] [INFO ] Decomposing Gal with order
[2024-05-25 11:25:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 11:25:20] [INFO ] Flatten gal took : 14 ms
[2024-05-25 11:25:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-25 11:25:20] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock1245277250308631605.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/ReachabilityDeadlock1245277250308631605.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 252 ms.
Running link step : cd /tmp/ltsmin6126235627684402336;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin6126235627684402336;'/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.003: 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( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Initializing POR dependencies: labels 15, guards 15
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: There are 15 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.011: State length is 15, there are 15 groups
pins2lts-mc-linux64( 0/ 8), 0.011: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.011: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.012: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.012: Visible groups: 0 / 15, labels: 0 / 15
pins2lts-mc-linux64( 0/ 8), 0.012: POR cycle proviso: none
pins2lts-mc-linux64( 0/ 8), 0.012: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.059: ~4 levels ~960 states ~5992 transitions
pins2lts-mc-linux64( 4/ 8), 0.108: ~2 levels ~1920 states ~9576 transitions
pins2lts-mc-linux64( 4/ 8), 0.133: ~2 levels ~3840 states ~18152 transitions
pins2lts-mc-linux64( 4/ 8), 0.197: ~3 levels ~7680 states ~32880 transitions
pins2lts-mc-linux64( 4/ 8), 0.296: ~4 levels ~15360 states ~63600 transitions
pins2lts-mc-linux64( 4/ 8), 0.470: ~5 levels ~30720 states ~117352 transitions
pins2lts-mc-linux64( 0/ 8), 0.741: ~11 levels ~61440 states ~222000 transitions
pins2lts-mc-linux64( 4/ 8), 1.061: ~8 levels ~122880 states ~415920 transitions
pins2lts-mc-linux64( 4/ 8), 1.581: ~10 levels ~245760 states ~798368 transitions
pins2lts-mc-linux64( 4/ 8), 2.218: ~12 levels ~491520 states ~1567584 transitions
pins2lts-mc-linux64( 4/ 8), 2.987: ~15 levels ~983040 states ~3155120 transitions
pins2lts-mc-linux64( 4/ 8), 4.224: ~17 levels ~1966080 states ~6417208 transitions
pins2lts-mc-linux64( 1/ 8), 6.634: ~18 levels ~3932160 states ~12740224 transitions
pins2lts-mc-linux64( 5/ 8), 11.303: ~21 levels ~7864320 states ~24909240 transitions
pins2lts-mc-linux64( 1/ 8), 21.507: ~24 levels ~15728640 states ~49576008 transitions
pins2lts-mc-linux64( 5/ 8), 41.219: ~27 levels ~31457280 states ~98905240 transitions
pins2lts-mc-linux64( 4/ 8), 61.359: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 61.418:
pins2lts-mc-linux64( 0/ 8), 61.418: mean standard work distribution: 1.6% (states) 1.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 61.418:
pins2lts-mc-linux64( 0/ 8), 61.418: Explored 44195860 states 138436100 transitions, fanout: 3.132
pins2lts-mc-linux64( 0/ 8), 61.418: Total exploration time 61.400 sec (61.350 sec minimum, 61.365 sec on average)
pins2lts-mc-linux64( 0/ 8), 61.418: States per second: 719802, Transitions per second: 2254660
pins2lts-mc-linux64( 0/ 8), 61.418:
pins2lts-mc-linux64( 0/ 8), 61.418: Queue width: 8B, total height: 9634980, memory: 73.51MB
pins2lts-mc-linux64( 0/ 8), 61.418: Tree memory: 666.7MB, 13.0 B/state, compr.: 20.9%
pins2lts-mc-linux64( 0/ 8), 61.418: Tree fill ratio (roots/leafs): 40.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 61.418: Stored 15 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 61.418: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 61.418: Est. total memory use: 740.2MB (~1097.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6126235627684402336;'/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/ltsmin6126235627684402336;'/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,2.57364e+12,106.74,675900,1088,4803,654445,40926,37,239560,24,185680,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,21435,114.821,680220,456,134,654445,572049,77,239560,478,1.66417e+06,8135

System contains 21435 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 21435 states ] showing 10 first states
[ u4={[ p1_1=24 ]
} u3={[ p1_0=24 ]
} u2={[ p1_4=78 ]
} u1={[ p2_3=2 p0_3=2 ]
} u0={[ p2_2=2 p0_2=2 ]
} ]
[ u4={[ p1_1=24 ]
} u3={[ p1_0=24 ]
} u2={[ p2_4=2 p0_4=2 ]
} u1={[ p1_3=78 ]
} u0={[ p2_2=2 p0_2=2 ]
} ]
[ u4={[ p1_1=24 ]
} u3={[ p1_0=24 ]
} u2={[ p2_4=2 p0_4=2 ]
} u1={[ p2_3=2 p0_3=2 ]
} u0={[ p1_2=78 ]
} ]
[ u4={[ p1_1=24 ]
} u3={[ p1_0=32 ]
} u2={[ p1_4=70 ]
} u1={[ p2_3=2 p0_3=2 ]
} u0={[ p2_2=2 p0_2=2 ]
} ]
[ u4={[ p1_1=24 ]
} u3={[ p1_0=32 ]
} u2={[ p2_4=2 p0_4=2 ]
} u1={[ p1_3=70 ]
} u0={[ p2_2=2 p0_2=2 ]
} ]
[ u4={[ p1_1=24 ]
} u3={[ p1_0=32 ]
} u2={[ p2_4=2 p0_4=2 ]
} u1={[ p2_3=2 p0_3=2 ]
} u0={[ p1_2=70 ]
} ]
[ u4={[ p1_1=24 ]
} u3={[ p1_0=8 ]
} u2={[ p1_4=94 ]
} u1={[ p2_3=2 p0_3=2 ]
} u0={[ p2_2=2 p0_2=2 ]
} ]
[ u4={[ p1_1=24 ]
} u3={[ p1_0=8 ]
} u2={[ p2_4=2 p0_4=2 ]
} u1={[ p1_3=94 ]
} u0={[ p2_2=2 p0_2=2 ]
} ]
[ u4={[ p1_1=24 ]
} u3={[ p1_0=8 ]
} u2={[ p2_4=2 p0_4=2 ]
} u1={[ p2_3=2 p0_3=2 ]
} u0={[ p1_2=94 ]
} ]
[ u4={[ p1_1=24 ]
} u3={[ ]
} u2={[ p1_4=102 ]
} u1={[ p2_3=2 p0_3=2 ]
} u0={[ p2_2=2 p0_2=2 ]
} ]
Total runtime 151954 ms.

BK_STOP 1716636469196

--------------------
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="PGCD-COL-D04N025"
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-D04N025, 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-171654365400446"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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