Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572600703.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ResAllocation-PT-R100C002, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572600703
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 7.2K Apr 30 02:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 30 02:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 02:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 02:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 30 02:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 30 02:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 30 02:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 30 02:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 9 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 422K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-00
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-01
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-02
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-03
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-04
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-05
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-06
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-07
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-08
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-09
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-10
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-11
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-12
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-13
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-14
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654448399475

Running Version 202205111006
[2022-06-05 17:00:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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, 3600]
[2022-06-05 17:00:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-05 17:00:01] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2022-06-05 17:00:01] [INFO ] Transformed 400 places.
[2022-06-05 17:00:01] [INFO ] Transformed 202 transitions.
[2022-06-05 17:00:01] [INFO ] Parsed PT model containing 400 places and 202 transitions in 257 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 16) seen :9
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :1
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :1
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 5 properties.
// Phase 1: matrix 202 rows 400 cols
[2022-06-05 17:00:02] [INFO ] Computed 200 place invariants in 19 ms
[2022-06-05 17:00:02] [INFO ] [Real]Absence check using 200 positive place invariants in 28 ms returned sat
[2022-06-05 17:00:02] [INFO ] After 133ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2022-06-05 17:00:02] [INFO ] After 173ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-05 17:00:02] [INFO ] After 435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-05 17:00:02] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2022-06-05 17:00:03] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2022-06-05 17:00:03] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 5 ms to minimize.
[2022-06-05 17:00:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2022-06-05 17:00:03] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
[2022-06-05 17:00:03] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
[2022-06-05 17:00:03] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2022-06-05 17:00:03] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2022-06-05 17:00:03] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2022-06-05 17:00:03] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2022-06-05 17:00:03] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2022-06-05 17:00:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 419 ms
[2022-06-05 17:00:03] [INFO ] After 995ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 180 ms.
[2022-06-05 17:00:03] [INFO ] After 1351ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 7919 ms.
Support contains 68 out of 400 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 400/400 places, 202/202 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 398 transition count 201
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 398 transition count 200
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 396 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 394 transition count 199
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 394 transition count 198
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 392 transition count 198
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 390 transition count 197
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 390 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 388 transition count 196
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 21 place count 386 transition count 195
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 386 transition count 194
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 24 place count 384 transition count 194
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 27 place count 382 transition count 193
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 382 transition count 192
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 30 place count 380 transition count 192
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 31 place count 380 transition count 191
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 33 place count 378 transition count 191
Applied a total of 33 rules in 266 ms. Remains 378 /400 variables (removed 22) and now considering 191/202 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 378/400 places, 191/202 transitions.
Incomplete random walk after 1000000 steps, including 438 resets, run finished after 12102 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 74 resets, run finished after 3517 ms. (steps per millisecond=284 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 28 resets, run finished after 4011 ms. (steps per millisecond=249 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 12705851 steps, run timeout after 57001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 12705851 steps, saw 2667146 distinct states, run finished after 57004 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 191 rows 378 cols
[2022-06-05 17:01:28] [INFO ] Computed 189 place invariants in 13 ms
[2022-06-05 17:01:29] [INFO ] [Real]Absence check using 189 positive place invariants in 97 ms returned sat
[2022-06-05 17:01:29] [INFO ] After 254ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-06-05 17:01:29] [INFO ] After 286ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-06-05 17:01:29] [INFO ] After 606ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2022-06-05 17:01:29] [INFO ] [Nat]Absence check using 189 positive place invariants in 23 ms returned sat
[2022-06-05 17:01:29] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-05 17:01:30] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2022-06-05 17:01:30] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2022-06-05 17:01:30] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2022-06-05 17:01:30] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2022-06-05 17:01:30] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2022-06-05 17:01:30] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2022-06-05 17:01:30] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2022-06-05 17:01:30] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-06-05 17:01:30] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2022-06-05 17:01:30] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2022-06-05 17:01:30] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2022-06-05 17:01:30] [INFO ] Trap strengthening procedure interrupted after too many repetitions 749 ms
[2022-06-05 17:01:30] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 749 ms
[2022-06-05 17:01:30] [INFO ] After 1165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 161 ms.
[2022-06-05 17:01:30] [INFO ] After 1443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4033 ms.
Support contains 68 out of 378 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 378/378 places, 191/191 transitions.
Applied a total of 0 rules in 13 ms. Remains 378 /378 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 378/378 places, 191/191 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 378/378 places, 191/191 transitions.
Applied a total of 0 rules in 12 ms. Remains 378 /378 variables (removed 0) and now considering 191/191 (removed 0) transitions.
// Phase 1: matrix 191 rows 378 cols
[2022-06-05 17:01:34] [INFO ] Computed 189 place invariants in 3 ms
[2022-06-05 17:01:35] [INFO ] Implicit Places using invariants in 408 ms returned [193, 195, 197, 199, 203, 205, 209, 211, 213, 215, 217, 219, 221, 223, 225, 227, 229, 231, 233, 235, 237, 239, 241, 247, 249, 251, 253, 255, 257, 259, 261, 263, 265, 267, 269, 271, 273, 275, 279, 281, 283, 285, 287, 289, 291, 295, 297, 299, 301, 303, 305, 307, 309, 311, 313, 317, 319, 321, 323, 325, 327, 329, 331, 333, 335, 337, 339, 341, 343, 347, 349, 351, 353, 355, 357, 359, 363, 365, 367, 369, 371, 373, 375, 377]
Discarding 84 places :
Implicit Place search using SMT only with invariants took 425 ms to find 84 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 294/378 places, 191/191 transitions.
Applied a total of 0 rules in 7 ms. Remains 294 /294 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 294/378 places, 191/191 transitions.
Incomplete random walk after 1000000 steps, including 438 resets, run finished after 10325 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 72 resets, run finished after 4584 ms. (steps per millisecond=218 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 29 resets, run finished after 3580 ms. (steps per millisecond=279 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 13912589 steps, run timeout after 54001 ms. (steps per millisecond=257 ) properties seen :{}
Probabilistic random walk after 13912589 steps, saw 2911675 distinct states, run finished after 54002 ms. (steps per millisecond=257 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 191 rows 294 cols
[2022-06-05 17:02:47] [INFO ] Computed 105 place invariants in 5 ms
[2022-06-05 17:02:47] [INFO ] [Real]Absence check using 105 positive place invariants in 17 ms returned sat
[2022-06-05 17:02:48] [INFO ] After 131ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-06-05 17:02:48] [INFO ] After 166ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-05 17:02:48] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2022-06-05 17:02:48] [INFO ] [Nat]Absence check using 105 positive place invariants in 12 ms returned sat
[2022-06-05 17:02:48] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-05 17:02:48] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2022-06-05 17:02:48] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-06-05 17:02:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 168 ms
[2022-06-05 17:02:48] [INFO ] After 526ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 136 ms.
[2022-06-05 17:02:48] [INFO ] After 753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2399 ms.
Support contains 68 out of 294 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 294/294 places, 191/191 transitions.
Applied a total of 0 rules in 17 ms. Remains 294 /294 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 294/294 places, 191/191 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 294/294 places, 191/191 transitions.
Applied a total of 0 rules in 5 ms. Remains 294 /294 variables (removed 0) and now considering 191/191 (removed 0) transitions.
// Phase 1: matrix 191 rows 294 cols
[2022-06-05 17:02:51] [INFO ] Computed 105 place invariants in 2 ms
[2022-06-05 17:02:51] [INFO ] Implicit Places using invariants in 191 ms returned []
// Phase 1: matrix 191 rows 294 cols
[2022-06-05 17:02:51] [INFO ] Computed 105 place invariants in 2 ms
[2022-06-05 17:02:51] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2022-06-05 17:02:51] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 191 rows 294 cols
[2022-06-05 17:02:51] [INFO ] Computed 105 place invariants in 1 ms
[2022-06-05 17:02:51] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 294/294 places, 191/191 transitions.
Incomplete random walk after 1000000 steps, including 438 resets, run finished after 10082 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 72 resets, run finished after 2472 ms. (steps per millisecond=404 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 31 resets, run finished after 3022 ms. (steps per millisecond=330 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 11788912 steps, run timeout after 45001 ms. (steps per millisecond=261 ) properties seen :{}
Probabilistic random walk after 11788912 steps, saw 2480900 distinct states, run finished after 45002 ms. (steps per millisecond=261 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 191 rows 294 cols
[2022-06-05 17:03:52] [INFO ] Computed 105 place invariants in 3 ms
[2022-06-05 17:03:52] [INFO ] [Real]Absence check using 105 positive place invariants in 15 ms returned sat
[2022-06-05 17:03:52] [INFO ] After 93ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-06-05 17:03:52] [INFO ] After 114ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-06-05 17:03:52] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2022-06-05 17:03:52] [INFO ] [Nat]Absence check using 105 positive place invariants in 12 ms returned sat
[2022-06-05 17:03:53] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-05 17:03:53] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-06-05 17:03:53] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-06-05 17:03:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2022-06-05 17:03:53] [INFO ] After 467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 150 ms.
[2022-06-05 17:03:53] [INFO ] After 694ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2403 ms.
Support contains 68 out of 294 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 294/294 places, 191/191 transitions.
Applied a total of 0 rules in 5 ms. Remains 294 /294 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 294/294 places, 191/191 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 294/294 places, 191/191 transitions.
Applied a total of 0 rules in 5 ms. Remains 294 /294 variables (removed 0) and now considering 191/191 (removed 0) transitions.
// Phase 1: matrix 191 rows 294 cols
[2022-06-05 17:03:55] [INFO ] Computed 105 place invariants in 1 ms
[2022-06-05 17:03:56] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 191 rows 294 cols
[2022-06-05 17:03:56] [INFO ] Computed 105 place invariants in 3 ms
[2022-06-05 17:03:56] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2022-06-05 17:03:56] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 191 rows 294 cols
[2022-06-05 17:03:56] [INFO ] Computed 105 place invariants in 7 ms
[2022-06-05 17:03:56] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 294/294 places, 191/191 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 294 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 293 transition count 190
Applied a total of 2 rules in 13 ms. Remains 293 /294 variables (removed 1) and now considering 190/191 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 190 rows 293 cols
[2022-06-05 17:03:56] [INFO ] Computed 105 place invariants in 1 ms
[2022-06-05 17:03:56] [INFO ] [Real]Absence check using 105 positive place invariants in 11 ms returned sat
[2022-06-05 17:03:56] [INFO ] After 72ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-06-05 17:03:56] [INFO ] After 92ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-05 17:03:56] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2022-06-05 17:03:56] [INFO ] [Nat]Absence check using 105 positive place invariants in 18 ms returned sat
[2022-06-05 17:03:56] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-05 17:03:56] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-06-05 17:03:57] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-06-05 17:03:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2022-06-05 17:03:57] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 12 ms to minimize.
[2022-06-05 17:03:57] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 5 ms to minimize.
[2022-06-05 17:03:57] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-06-05 17:03:57] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-06-05 17:03:57] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2022-06-05 17:03:57] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2022-06-05 17:03:57] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2022-06-05 17:03:57] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2022-06-05 17:03:57] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2022-06-05 17:03:58] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-06-05 17:03:58] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-06-05 17:03:58] [INFO ] Trap strengthening procedure interrupted after too many repetitions 870 ms
[2022-06-05 17:03:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 871 ms
[2022-06-05 17:03:58] [INFO ] After 1378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 187 ms.
[2022-06-05 17:03:58] [INFO ] After 1683ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-05 17:03:58] [INFO ] Flatten gal took : 51 ms
[2022-06-05 17:03:58] [INFO ] Flatten gal took : 25 ms
[2022-06-05 17:03:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12984364031400246314.gal : 10 ms
[2022-06-05 17:03:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14750731001620727591.prop : 1 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12984364031400246314.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14750731001620727591.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality14750731001620727591.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 32
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :32 after 448
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :448 after 14336
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :14336 after 1.67772e+07
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.67772e+07 after 7.03687e+13
Detected timeout of ITS tools.
[2022-06-05 17:04:13] [INFO ] Flatten gal took : 17 ms
[2022-06-05 17:04:13] [INFO ] Applying decomposition
[2022-06-05 17:04:13] [INFO ] Flatten gal took : 15 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/graph1219114978169354262.txt' '-o' '/tmp/graph1219114978169354262.bin' '-w' '/tmp/graph1219114978169354262.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1219114978169354262.bin' '-l' '-1' '-v' '-w' '/tmp/graph1219114978169354262.weights' '-q' '0' '-e' '0.001'
[2022-06-05 17:04:13] [INFO ] Decomposing Gal with order
[2022-06-05 17:04:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-05 17:04:14] [INFO ] Flatten gal took : 130 ms
[2022-06-05 17:04:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2022-06-05 17:04:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4706670990802639449.gal : 11 ms
[2022-06-05 17:04:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11428994727502834893.prop : 12 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4706670990802639449.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11428994727502834893.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality11428994727502834893.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1.23794e+27
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,9.60641e+29,0.430246,16928,194,16,34419,92,434,37847,35,166,0
Total reachable state count : 960641470485455093321720397824

Verifying 2 reachability properties.
Reachability property ResAllocation-PT-R100C002-ReachabilityFireability-09 does not hold.
No reachable states exhibit your property : ResAllocation-PT-R100C002-ReachabilityFireability-09

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ResAllocation-PT-R100C002-ReachabilityFireability-09,0,0.434401,17192,1,0,34419,92,455,37847,38,166,40
Reachability property ResAllocation-PT-R100C002-ReachabilityFireability-10 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ResAllocation-PT-R100C002-ReachabilityFireability-10,4.95176e+27,0.437553,17192,69,11,34419,92,614,37847,38,166,44
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-09 FALSE TECHNIQUES OVER_APPROXIMATION
[2022-06-05 17:04:14] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2868284904761868485
[2022-06-05 17:04:14] [INFO ] Applying decomposition
[2022-06-05 17:04:14] [INFO ] Computing symmetric may disable matrix : 191 transitions.
[2022-06-05 17:04:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-05 17:04:14] [INFO ] Computing symmetric may enable matrix : 191 transitions.
[2022-06-05 17:04:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-05 17:04:14] [INFO ] Flatten gal took : 54 ms
[2022-06-05 17:04:14] [INFO ] Flatten gal took : 35 ms
[2022-06-05 17:04:14] [INFO ] Computing Do-Not-Accords matrix : 191 transitions.
[2022-06-05 17:04:14] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-05 17:04:14] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2868284904761868485
[2022-06-05 17:04:14] [INFO ] Input system was already deterministic with 191 transitions.
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/graph16624190161898231496.txt' '-o' '/tmp/graph16624190161898231496.bin' '-w' '/tmp/graph16624190161898231496.weights'
Running compilation step : cd /tmp/ltsmin2868284904761868485;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16624190161898231496.bin' '-l' '-1' '-v' '-w' '/tmp/graph16624190161898231496.weights' '-q' '0' '-e' '0.001'
[2022-06-05 17:04:14] [INFO ] Decomposing Gal with order
[2022-06-05 17:04:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-05 17:04:14] [INFO ] Flatten gal took : 47 ms
[2022-06-05 17:04:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-06-05 17:04:14] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9275044501142936579.gal : 5 ms
[2022-06-05 17:04:14] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10973114636144529696.prop : 32 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability9275044501142936579.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability10973114636144529696.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityFireability10973114636144529696.prop.
[2022-06-05 17:04:15] [INFO ] Ran tautology test, simplified 0 / 1 in 490 ms.
[2022-06-05 17:04:15] [INFO ] BMC solution for property ResAllocation-PT-R100C002-ReachabilityFireability-10(UNSAT) depth K=0 took 48 ms
[2022-06-05 17:04:15] [INFO ] BMC solution for property ResAllocation-PT-R100C002-ReachabilityFireability-10(UNSAT) depth K=1 took 48 ms
[2022-06-05 17:04:15] [INFO ] BMC solution for property ResAllocation-PT-R100C002-ReachabilityFireability-10(UNSAT) depth K=2 took 152 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 191 rows 294 cols
[2022-06-05 17:04:15] [INFO ] Computed 105 place invariants in 1 ms
[2022-06-05 17:04:15] [INFO ] Computed 105 place invariants in 1 ms
[2022-06-05 17:04:15] [INFO ] BMC solution for property ResAllocation-PT-R100C002-ReachabilityFireability-10(UNSAT) depth K=3 took 250 ms
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,9.70545e+29,0.848686,16784,171,12,33684,61,458,34877,22,85,0
Total reachable state count : 970544990799738135520913391616

Verifying 1 reachability properties.
Reachability property ResAllocation-PT-R100C002-ReachabilityFireability-10 is true.
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ResAllocation-PT-R100C002-ReachabilityFireability-10,2.85609e+25,0.853419,16784,101,13,33684,61,666,34877,28,85,408
[2022-06-05 17:04:15] [WARNING] Interrupting SMT solver.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-05 17:04:15] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
Exception in thread "Thread-11" java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-05 17:04:15] [WARNING] Unexpected error occurred while running SMT. Was verifying ResAllocation-PT-R100C002-ReachabilityFireability-10 SMT depth 4
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
[2022-06-05 17:04:15] [INFO ] During BMC, SMT solver timed out at depth 4
[2022-06-05 17:04:15] [INFO ] BMC solving timed out (3600000 secs) at depth 4
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:117)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:283)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-05 17:04:15] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
Total runtime 255178 ms.

BK_STOP 1654448656055

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//
++ perl -pe 's/.*\.//g'
++ 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 ReachabilityFireability -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 3600 -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="ResAllocation-PT-R100C002"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 ResAllocation-PT-R100C002, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-tajo-165281572600703"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R100C002.tgz
mv ResAllocation-PT-R100C002 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;