fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r211-oct2-165281604000171
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for SafeBus-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8428.792 1800000.00 7022236.00 216.60 [undef] Time out reached

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2022-input.r211-oct2-165281604000171.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SafeBus-PT-10, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-oct2-165281604000171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 26K Apr 29 11:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 29 11:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 213K Apr 29 11:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 959K Apr 29 11:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.4K May 9 08:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K May 9 08:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 75K May 9 08:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 259K May 9 08:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 9 08:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.1K May 9 08:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.2M May 10 09:34 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 1653116580004

Running Version 202205111006
[2022-05-21 07:03:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-21 07:03:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 07:03:01] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2022-05-21 07:03:01] [INFO ] Transformed 316 places.
[2022-05-21 07:03:01] [INFO ] Transformed 1631 transitions.
[2022-05-21 07:03:01] [INFO ] Parsed PT model containing 316 places and 1631 transitions in 327 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 10 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 6 ms.10307KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 306/306 places, 1631/1631 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 332 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 1631/1631 transitions.
Starting structural reductions in DEADLOCKS mode, iteration 0 : 306/306 places, 1631/1631 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 121 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2022-05-21 07:03:02] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2022-05-21 07:03:02] [INFO ] Computed 45 place invariants in 33 ms
[2022-05-21 07:03:02] [INFO ] Implicit Places using invariants in 729 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 770 ms to find 10 implicit places.
Starting structural reductions in DEADLOCKS mode, iteration 1 : 296/306 places, 1631/1631 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1621
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1621
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 20 rules in 213 ms. Remains 286 /296 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
[2022-05-21 07:03:02] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-21 07:03:02] [INFO ] Computed 35 place invariants in 13 ms
[2022-05-21 07:03:03] [INFO ] Implicit Places using invariants in 367 ms returned []
[2022-05-21 07:03:03] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-21 07:03:03] [INFO ] Computed 35 place invariants in 11 ms
[2022-05-21 07:03:03] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-21 07:03:04] [INFO ] Implicit Places using invariants and state equation in 1411 ms returned []
Implicit Place search using SMT with State Equation took 1781 ms to find 0 implicit places.
Starting structural reductions in DEADLOCKS mode, iteration 2 : 286/306 places, 1621/1631 transitions.
Finished structural reductions, in 2 iterations. Remains : 286/306 places, 1621/1631 transitions.
Random walk for 1250000 steps, including 0 resets, run took 5525 ms (no deadlock found). (steps per millisecond=226 )
Random directed walk for 1250001 steps, including 0 resets, run took 4080 ms (no deadlock found). (steps per millisecond=306 )
[2022-05-21 07:03:14] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-21 07:03:14] [INFO ] Computed 35 place invariants in 9 ms
[2022-05-21 07:03:14] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-21 07:03:14] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 27 ms returned sat
[2022-05-21 07:03:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:03:14] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2022-05-21 07:03:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:03:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2022-05-21 07:03:15] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 51 ms returned sat
[2022-05-21 07:03:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:03:15] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2022-05-21 07:03:15] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-21 07:03:15] [INFO ] [Nat]Added 111 Read/Feed constraints in 54 ms returned sat
[2022-05-21 07:03:15] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 2 ms to minimize.
[2022-05-21 07:03:15] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 1 ms to minimize.
[2022-05-21 07:03:16] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
[2022-05-21 07:03:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 560 ms
[2022-05-21 07:03:16] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 602 transitions) in 104 ms.
[2022-05-21 07:03:16] [INFO ] Added : 2 causal constraints over 2 iterations in 367 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
Parikh directed walk for 16400 steps, including 1000 resets, run took 173 ms. (steps per millisecond=94 )
Random directed walk for 500000 steps, including 0 resets, run took 1860 ms (no deadlock found). (steps per millisecond=268 )
Random walk for 500000 steps, including 0 resets, run took 2203 ms (no deadlock found). (steps per millisecond=226 )
Random directed walk for 500002 steps, including 0 resets, run took 1939 ms (no deadlock found). (steps per millisecond=257 )
Random walk for 500000 steps, including 0 resets, run took 2229 ms (no deadlock found). (steps per millisecond=224 )
Starting structural reductions in DEADLOCKS mode, iteration 0 : 286/286 places, 1621/1621 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 139 ms. Remains 286 /286 variables (removed 0) and now considering 1621/1621 (removed 0) transitions.
[2022-05-21 07:03:25] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-21 07:03:25] [INFO ] Computed 35 place invariants in 5 ms
[2022-05-21 07:03:25] [INFO ] Implicit Places using invariants in 348 ms returned []
[2022-05-21 07:03:25] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-21 07:03:25] [INFO ] Computed 35 place invariants in 6 ms
[2022-05-21 07:03:25] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-21 07:03:26] [INFO ] Implicit Places using invariants and state equation in 1374 ms returned []
Implicit Place search using SMT with State Equation took 1729 ms to find 0 implicit places.
[2022-05-21 07:03:27] [INFO ] Redundant transitions in 134 ms returned []
[2022-05-21 07:03:27] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-21 07:03:27] [INFO ] Computed 35 place invariants in 6 ms
[2022-05-21 07:03:27] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 100 transitions.
Found 100 dead transitions using SMT.
Drop transitions removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in DEADLOCKS mode, iteration 1 : 286/286 places, 1521/1621 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 107 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2022-05-21 07:03:27] [INFO ] Redundant transitions in 13 ms returned []
Finished structural reductions, in 2 iterations. Remains : 286/286 places, 1521/1621 transitions.
Random walk for 1250000 steps, including 0 resets, run took 5056 ms (no deadlock found). (steps per millisecond=247 )
Random directed walk for 1250000 steps, including 0 resets, run took 4548 ms (no deadlock found). (steps per millisecond=274 )
[2022-05-21 07:03:37] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-21 07:03:37] [INFO ] Computed 35 place invariants in 13 ms
[2022-05-21 07:03:37] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2022-05-21 07:03:38] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 230 ms returned sat
[2022-05-21 07:03:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:03:39] [INFO ] [Real]Absence check using state equation in 1908 ms returned sat
[2022-05-21 07:03:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:03:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2022-05-21 07:03:40] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 44 ms returned sat
[2022-05-21 07:03:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:03:40] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2022-05-21 07:03:40] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-21 07:03:40] [INFO ] [Nat]Added 111 Read/Feed constraints in 78 ms returned sat
[2022-05-21 07:03:40] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 3 ms to minimize.
[2022-05-21 07:03:41] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 0 ms to minimize.
[2022-05-21 07:03:41] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 1 ms to minimize.
[2022-05-21 07:03:41] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 1 ms to minimize.
[2022-05-21 07:03:41] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 0 ms to minimize.
[2022-05-21 07:03:45] [INFO ] Deduced a trap composed of 57 places in 3764 ms of which 26 ms to minimize.
[2022-05-21 07:03:45] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 1 ms to minimize.
[2022-05-21 07:03:45] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 1 ms to minimize.
[2022-05-21 07:03:46] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 1 ms to minimize.
[2022-05-21 07:03:46] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 0 ms to minimize.
[2022-05-21 07:03:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5833 ms
[2022-05-21 07:03:46] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 602 transitions) in 74 ms.
[2022-05-21 07:03:46] [INFO ] Added : 1 causal constraints over 1 iterations in 193 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
Parikh directed walk for 17000 steps, including 999 resets, run took 134 ms. (steps per millisecond=126 )
Random directed walk for 500003 steps, including 0 resets, run took 1812 ms (no deadlock found). (steps per millisecond=275 )
Random walk for 500000 steps, including 0 resets, run took 2062 ms (no deadlock found). (steps per millisecond=242 )
Random directed walk for 500002 steps, including 0 resets, run took 1674 ms (no deadlock found). (steps per millisecond=298 )
Random walk for 500000 steps, including 0 resets, run took 2060 ms (no deadlock found). (steps per millisecond=242 )
[2022-05-21 07:03:55] [INFO ] Flatten gal took : 528 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8424564179168919438
[2022-05-21 07:03:55] [INFO ] Too many transitions (1631) to apply POR reductions. Disabling POR matrices.
[2022-05-21 07:03:56] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8424564179168919438
[2022-05-21 07:03:56] [INFO ] Applying decomposition
[2022-05-21 07:03:56] [INFO ] Flatten gal took : 197 ms
Running compilation step : cd /tmp/ltsmin8424564179168919438;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13438776741714192652.txt' '-o' '/tmp/graph13438776741714192652.bin' '-w' '/tmp/graph13438776741714192652.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13438776741714192652.bin' '-l' '-1' '-v' '-w' '/tmp/graph13438776741714192652.weights' '-q' '0' '-e' '0.001'
[2022-05-21 07:03:56] [INFO ] Decomposing Gal with order
[2022-05-21 07:03:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 07:03:57] [INFO ] Removed a total of 4999 redundant transitions.
[2022-05-21 07:03:58] [INFO ] Flatten gal took : 915 ms
[2022-05-21 07:03:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 470 labels/synchronizations in 226 ms.
[2022-05-21 07:03:58] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock17206693346320731819.gal : 49 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock17206693346320731819.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/R...226
No direction supplied, using forward translation only.
Compilation finished in 6529 ms.
Running link step : cd /tmp/ltsmin8424564179168919438;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 148 ms.
Running LTSmin : cd /tmp/ltsmin8424564179168919438;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'
Detected timeout of ITS tools.
[2022-05-21 07:14:17] [INFO ] Flatten gal took : 309 ms
[2022-05-21 07:14:17] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock13803841973144482588.gal : 21 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock13803841973144482588.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/R...247
No direction supplied, using forward translation only.
Detected timeout of ITS tools.
[2022-05-21 07:24:36] [INFO ] Flatten gal took : 185 ms
[2022-05-21 07:24:36] [INFO ] Input system was already deterministic with 1631 transitions.
[2022-05-21 07:24:36] [INFO ] Transformed 306 places.
[2022-05-21 07:24:36] [INFO ] Transformed 1631 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-21 07:25:07] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock8215795353072951325.gal : 123 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock8215795353072951325.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/R...291
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="SafeBus-PT-10"
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-4028"
echo " Executing tool itstools"
echo " Input is SafeBus-PT-10, 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 r211-oct2-165281604000171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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