About the Execution of ITS-Tools for SafeBus-PT-15
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10969.039 | 1800000.00 | 6776090.00 | 152.00 | [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-165281604000176.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-15, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-oct2-165281604000176
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 39K Apr 29 12:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 254K Apr 29 12:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 178K Apr 29 11:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 792K Apr 29 11:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 24K May 9 08:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 9 08:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 388K May 9 08:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M May 9 08:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 9 08:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K 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 3.5M 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 1653116598145
Running Version 202205111006
[2022-05-21 07:03:19] [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:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 07:03:19] [INFO ] Load time of PNML (sax parser for PT used): 324 ms
[2022-05-21 07:03:19] [INFO ] Transformed 621 places.
[2022-05-21 07:03:19] [INFO ] Transformed 4771 transitions.
[2022-05-21 07:03:19] [INFO ] Parsed PT model containing 621 places and 4771 transitions in 459 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 15 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 9 ms.22552KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 606/606 places, 4771/4771 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 1238 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 606/606 places, 4771/4771 transitions.
Starting structural reductions in DEADLOCKS mode, iteration 0 : 606/606 places, 4771/4771 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 941 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
[2022-05-21 07:03:22] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2022-05-21 07:03:22] [INFO ] Computed 65 place invariants in 67 ms
[2022-05-21 07:03:23] [INFO ] Implicit Places using invariants in 1714 ms returned [546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1753 ms to find 15 implicit places.
Starting structural reductions in DEADLOCKS mode, iteration 1 : 591/606 places, 4771/4771 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 0 place count 591 transition count 4756
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 576 transition count 4756
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 30 rules in 988 ms. Remains 576 /591 variables (removed 15) and now considering 4756/4771 (removed 15) transitions.
[2022-05-21 07:03:24] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2022-05-21 07:03:24] [INFO ] Computed 50 place invariants in 33 ms
[2022-05-21 07:03:27] [INFO ] Implicit Places using invariants in 2304 ms returned []
[2022-05-21 07:03:27] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2022-05-21 07:03:27] [INFO ] Computed 50 place invariants in 17 ms
[2022-05-21 07:03:27] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-05-21 07:03:31] [INFO ] Implicit Places using invariants and state equation in 4938 ms returned []
Implicit Place search using SMT with State Equation took 7248 ms to find 0 implicit places.
Starting structural reductions in DEADLOCKS mode, iteration 2 : 576/606 places, 4756/4771 transitions.
Finished structural reductions, in 2 iterations. Remains : 576/606 places, 4756/4771 transitions.
Random walk for 1250000 steps, including 0 resets, run took 13281 ms (no deadlock found). (steps per millisecond=94 )
Random directed walk for 1250005 steps, including 0 resets, run took 10848 ms (no deadlock found). (steps per millisecond=115 )
[2022-05-21 07:03:56] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2022-05-21 07:03:56] [INFO ] Computed 50 place invariants in 17 ms
[2022-05-21 07:03:56] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2022-05-21 07:03:57] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 1140 ms returned sat
[2022-05-21 07:03:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:03:58] [INFO ] [Real]Absence check using state equation in 1063 ms returned sat
[2022-05-21 07:03:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:03:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2022-05-21 07:04:00] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 294 ms returned sat
[2022-05-21 07:04:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:04:01] [INFO ] [Nat]Absence check using state equation in 1254 ms returned sat
[2022-05-21 07:04:01] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-05-21 07:04:02] [INFO ] [Nat]Added 241 Read/Feed constraints in 581 ms returned sat
[2022-05-21 07:04:02] [INFO ] Deduced a trap composed of 74 places in 605 ms of which 3 ms to minimize.
[2022-05-21 07:04:03] [INFO ] Deduced a trap composed of 61 places in 725 ms of which 27 ms to minimize.
[2022-05-21 07:04:04] [INFO ] Deduced a trap composed of 74 places in 264 ms of which 1 ms to minimize.
[2022-05-21 07:04:04] [INFO ] Deduced a trap composed of 61 places in 254 ms of which 1 ms to minimize.
[2022-05-21 07:04:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2800 ms
[2022-05-21 07:04:05] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 461 ms.
[2022-05-21 07:04:05] [INFO ] Added : 2 causal constraints over 2 iterations in 806 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 61 ms.
Parikh directed walk for 68200 steps, including 1000 resets, run took 902 ms. (steps per millisecond=75 )
Random directed walk for 500001 steps, including 0 resets, run took 4140 ms (no deadlock found). (steps per millisecond=120 )
Random walk for 500000 steps, including 0 resets, run took 5166 ms (no deadlock found). (steps per millisecond=96 )
Random directed walk for 500004 steps, including 0 resets, run took 4067 ms (no deadlock found). (steps per millisecond=122 )
Random walk for 500000 steps, including 0 resets, run took 5316 ms (no deadlock found). (steps per millisecond=94 )
Starting structural reductions in DEADLOCKS mode, iteration 0 : 576/576 places, 4756/4756 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 939 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2022-05-21 07:04:26] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2022-05-21 07:04:26] [INFO ] Computed 50 place invariants in 26 ms
[2022-05-21 07:04:27] [INFO ] Implicit Places using invariants in 1115 ms returned []
[2022-05-21 07:04:27] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2022-05-21 07:04:27] [INFO ] Computed 50 place invariants in 17 ms
[2022-05-21 07:04:28] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-05-21 07:04:32] [INFO ] Implicit Places using invariants and state equation in 4625 ms returned []
Implicit Place search using SMT with State Equation took 5771 ms to find 0 implicit places.
[2022-05-21 07:04:32] [INFO ] Redundant transitions in 306 ms returned []
[2022-05-21 07:04:32] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2022-05-21 07:04:32] [INFO ] Computed 50 place invariants in 8 ms
[2022-05-21 07:04:37] [INFO ] Dead Transitions using invariants and state equation in 4653 ms found 225 transitions.
Found 225 dead transitions using SMT.
Drop transitions removed 225 transitions
Dead transitions reduction (with SMT) removed 225 transitions
Starting structural reductions in DEADLOCKS mode, iteration 1 : 576/576 places, 4531/4756 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 767 ms. Remains 576 /576 variables (removed 0) and now considering 4531/4531 (removed 0) transitions.
[2022-05-21 07:04:38] [INFO ] Redundant transitions in 195 ms returned []
Finished structural reductions, in 2 iterations. Remains : 576/576 places, 4531/4756 transitions.
Random walk for 1250000 steps, including 0 resets, run took 12369 ms (no deadlock found). (steps per millisecond=101 )
Random directed walk for 1250000 steps, including 0 resets, run took 10023 ms (no deadlock found). (steps per millisecond=124 )
[2022-05-21 07:05:00] [INFO ] Flow matrix only has 1397 transitions (discarded 3134 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2022-05-21 07:05:00] [INFO ] Computed 50 place invariants in 11 ms
[2022-05-21 07:05:01] [INFO ] [Real]Absence check using 19 positive place invariants in 36 ms returned sat
[2022-05-21 07:05:02] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 651 ms returned sat
[2022-05-21 07:05:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:05:03] [INFO ] [Real]Absence check using state equation in 1367 ms returned sat
[2022-05-21 07:05:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:05:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2022-05-21 07:05:04] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 116 ms returned sat
[2022-05-21 07:05:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:05:05] [INFO ] [Nat]Absence check using state equation in 1152 ms returned sat
[2022-05-21 07:05:05] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-05-21 07:05:06] [INFO ] [Nat]Added 241 Read/Feed constraints in 549 ms returned sat
[2022-05-21 07:05:06] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 1 ms to minimize.
[2022-05-21 07:05:06] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 1 ms to minimize.
[2022-05-21 07:05:07] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 0 ms to minimize.
[2022-05-21 07:05:07] [INFO ] Deduced a trap composed of 74 places in 232 ms of which 0 ms to minimize.
[2022-05-21 07:05:08] [INFO ] Deduced a trap composed of 61 places in 147 ms of which 0 ms to minimize.
[2022-05-21 07:05:08] [INFO ] Deduced a trap composed of 61 places in 152 ms of which 1 ms to minimize.
[2022-05-21 07:05:08] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 0 ms to minimize.
[2022-05-21 07:05:09] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 0 ms to minimize.
[2022-05-21 07:05:09] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 1 ms to minimize.
[2022-05-21 07:05:09] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 0 ms to minimize.
[2022-05-21 07:05:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3485 ms
[2022-05-21 07:05:09] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 156 ms.
[2022-05-21 07:05:10] [INFO ] Added : 1 causal constraints over 1 iterations in 349 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
Parikh directed walk for 19300 steps, including 1000 resets, run took 235 ms. (steps per millisecond=82 )
Random directed walk for 500003 steps, including 0 resets, run took 4457 ms (no deadlock found). (steps per millisecond=112 )
Random walk for 500000 steps, including 0 resets, run took 5438 ms (no deadlock found). (steps per millisecond=91 )
Random directed walk for 500005 steps, including 0 resets, run took 4568 ms (no deadlock found). (steps per millisecond=109 )
Random walk for 500000 steps, including 0 resets, run took 4887 ms (no deadlock found). (steps per millisecond=102 )
[2022-05-21 07:05:30] [INFO ] Flatten gal took : 420 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1106212673524362689
[2022-05-21 07:05:30] [INFO ] Too many transitions (4771) to apply POR reductions. Disabling POR matrices.
[2022-05-21 07:05:30] [INFO ] Built C files in 120ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1106212673524362689
[2022-05-21 07:05:30] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin1106212673524362689;'/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'
[2022-05-21 07:05:31] [INFO ] Flatten gal took : 387 ms
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/graph8055564433295141404.txt' '-o' '/tmp/graph8055564433295141404.bin' '-w' '/tmp/graph8055564433295141404.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8055564433295141404.bin' '-l' '-1' '-v' '-w' '/tmp/graph8055564433295141404.weights' '-q' '0' '-e' '0.001'
[2022-05-21 07:05:32] [INFO ] Decomposing Gal with order
[2022-05-21 07:05:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 07:05:33] [INFO ] Removed a total of 12109 redundant transitions.
[2022-05-21 07:05:33] [INFO ] Flatten gal took : 1212 ms
[2022-05-21 07:05:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 1045 labels/synchronizations in 152 ms.
[2022-05-21 07:05:33] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock8421635297012284565.gal : 30 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/ReachabilityDeadlock8421635297012284565.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...225
No direction supplied, using forward translation only.
Compilation finished in 16592 ms.
Running link step : cd /tmp/ltsmin1106212673524362689;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin1106212673524362689;'/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:16:20] [INFO ] Flatten gal took : 1828 ms
[2022-05-21 07:16:20] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock10754920245161355064.gal : 79 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/ReachabilityDeadlock10754920245161355064.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:27:05] [INFO ] Flatten gal took : 670 ms
[2022-05-21 07:27:05] [INFO ] Input system was already deterministic with 4771 transitions.
[2022-05-21 07:27:06] [INFO ] Transformed 606 places.
[2022-05-21 07:27:06] [INFO ] Transformed 4771 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:27:37] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock11381041362066669061.gal : 48 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/ReachabilityDeadlock11381041362066669061.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...292
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ 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-15"
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-15, 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-165281604000176"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-15.tgz
mv SafeBus-PT-15 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 '
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 ;