Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110800751.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/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 FamilyReunion-PT-L00200M0020C010P010G005, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110800751
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 136M
-rw-r--r-- 1 mcc users 1.7M Apr 30 13:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 9.6M Apr 30 13:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5M Apr 30 10:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.3M Apr 30 10:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 726K May 9 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.8M May 9 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 778K May 9 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.1M May 9 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 684K Apr 30 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.5M Apr 30 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3M Apr 30 15:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33M Apr 30 15:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 25K May 9 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 73K May 9 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 62M May 10 09:33 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 FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-00
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-01
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-02
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-03
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-04
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-05
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-06
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-07
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-08
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-09
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-10
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-11
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-12
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-13
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-14
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654195504272

Running Version 202205111006
[2022-06-02 18:45:05] [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-02 18:45:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 18:45:07] [INFO ] Load time of PNML (sax parser for PT used): 2220 ms
[2022-06-02 18:45:08] [INFO ] Transformed 143908 places.
[2022-06-02 18:45:08] [INFO ] Transformed 134279 transitions.
[2022-06-02 18:45:08] [INFO ] Parsed PT model containing 143908 places and 134279 transitions in 3285 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 738 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 56 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4738 ms. (steps per millisecond=2 ) properties (out of 16) seen :2
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3796 ms. (steps per millisecond=2 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 501 ms. (steps per millisecond=19 ) properties (out of 14) seen :0
Interrupted Best-First random walk after 6393 steps, including 1 resets, run timeout after 5235 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 1834 steps, including 0 resets, run timeout after 5686 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4066 ms. (steps per millisecond=2 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 134279 rows 143852 cols
[2022-06-02 18:47:43] [WARNING] Invariant computation timed out after 120 seconds.
[2022-06-02 18:48:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-02 18:48:09] [INFO ] After 25405ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 62637 out of 143852 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 143852/143852 places, 134279/134279 transitions.
Graph (complete) has 236398 edges and 143852 vertex of which 142776 are kept as prefixes of interest. Removing 1076 places using SCC suffix rule.209 ms
Discarding 1076 places :
Also discarding 201 output transitions
Drop transitions removed 201 transitions
Drop transitions removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Discarding 16865 places :
Implicit places reduction removed 16865 places
[2022-06-02 18:48:39] [INFO ] Computed 30578 place invariants in 176164 ms
Performed 8635 Post agglomeration using F-continuation condition.Transition count delta: 8635
Iterating post reduction 0 with 25701 rules applied. Total rules applied 25702 place count 125911 transition count 125242
Reduce places removed 8635 places and 0 transitions.
Iterating post reduction 1 with 8635 rules applied. Total rules applied 34337 place count 117276 transition count 125242
Performed 8836 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8836 Pre rules applied. Total rules applied 34337 place count 117276 transition count 116406
Deduced a syphon composed of 8836 places in 218 ms
Ensure Unique test removed 2209 places
Reduce places removed 11045 places and 0 transitions.
Iterating global reduction 2 with 19881 rules applied. Total rules applied 54218 place count 106231 transition count 116406
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 54219 place count 106230 transition count 116406
Performed 2207 Post agglomeration using F-continuation condition.Transition count delta: 2207
Deduced a syphon composed of 2207 places in 213 ms
Reduce places removed 2207 places and 0 transitions.
Iterating global reduction 3 with 4414 rules applied. Total rules applied 58633 place count 104023 transition count 114199
Free-agglomeration rule (complex) applied 2811 times.
Iterating global reduction 3 with 2811 rules applied. Total rules applied 61444 place count 104023 transition count 111388
Ensure Unique test removed 201 places
Reduce places removed 3012 places and 0 transitions.
Iterating post reduction 3 with 3012 rules applied. Total rules applied 64456 place count 101011 transition count 111388
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 64466 place count 101001 transition count 109378
Iterating global reduction 4 with 10 rules applied. Total rules applied 64476 place count 101001 transition count 109378
Applied a total of 64476 rules in 92060 ms. Remains 101001 /143852 variables (removed 42851) and now considering 109378/134279 (removed 24901) transitions.
Finished structural reductions, in 1 iterations. Remains : 101001/143852 places, 109378/134279 transitions.
Interrupted random walk after 145828 steps, including 15 resets, run timeout after 30001 ms. (steps per millisecond=4 ) properties seen 6
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 16028 steps, including 0 resets, run timeout after 5038 ms. (steps per millisecond=3 ) properties seen 0
Interrupted Best-First random walk after 6226 steps, including 0 resets, run timeout after 5192 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 11928 steps, including 0 resets, run timeout after 5060 ms. (steps per millisecond=2 ) properties seen 0
Interrupted Best-First random walk after 800966 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=160 ) properties seen 0
Interrupted Best-First random walk after 753420 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=150 ) properties seen 0
Interrupted Best-First random walk after 838958 steps, including 2 resets, run timeout after 5002 ms. (steps per millisecond=167 ) properties seen 0
Interrupted Best-First random walk after 846824 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=169 ) properties seen 1
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 721530 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=144 ) properties seen 0
Running SMT prover for 7 properties.
// Phase 1: matrix 109378 rows 101001 cols
[2022-06-02 18:51:44] [INFO ] Computed 10678 place invariants in 50628 ms
[2022-06-02 18:53:03] [INFO ] [Real]Absence check using 0 positive and 10678 generalized place invariants in 40850 ms returned sat
[2022-06-02 18:53:05] [INFO ] After 80906ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-02 18:54:19] [INFO ] [Nat]Absence check using 0 positive and 10678 generalized place invariants in 37561 ms returned sat
[2022-06-02 18:55:26] [INFO ] After 54671ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-06-02 18:56:53] [INFO ] After 141626ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-06-02 18:56:53] [INFO ] After 227651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 30420 out of 101001 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 101001/101001 places, 109378/109378 transitions.
Discarding 8451 places :
Implicit places reduction removed 8451 places
Drop transitions removed 16823 transitions
Trivial Post-agglo rules discarded 16823 transitions
Performed 16823 trivial Post agglomeration. Transition count delta: 16823
Iterating post reduction 0 with 25274 rules applied. Total rules applied 25274 place count 92550 transition count 92555
Reduce places removed 16823 places and 0 transitions.
Performed 4464 Post agglomeration using F-continuation condition.Transition count delta: 4464
Iterating post reduction 1 with 21287 rules applied. Total rules applied 46561 place count 75727 transition count 88091
Reduce places removed 4464 places and 0 transitions.
Iterating post reduction 2 with 4464 rules applied. Total rules applied 51025 place count 71263 transition count 88091
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 51025 place count 71263 transition count 88086
Deduced a syphon composed of 5 places in 120 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 51036 place count 71257 transition count 88086
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: 201
Deduced a syphon composed of 201 places in 78 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 51438 place count 71056 transition count 87885
Free-agglomeration rule (complex) applied 9607 times.
Iterating global reduction 3 with 9607 rules applied. Total rules applied 61045 place count 71056 transition count 78278
Ensure Unique test removed 198 places
Reduce places removed 9805 places and 0 transitions.
Iterating post reduction 3 with 9805 rules applied. Total rules applied 70850 place count 61251 transition count 78278
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 70867 place count 61234 transition count 74861
Iterating global reduction 4 with 17 rules applied. Total rules applied 70884 place count 61234 transition count 74861
Applied a total of 70884 rules in 36775 ms. Remains 61234 /101001 variables (removed 39767) and now considering 74861/109378 (removed 34517) transitions.
Finished structural reductions, in 1 iterations. Remains : 61234/101001 places, 74861/109378 transitions.
Interrupted random walk after 186080 steps, including 24 resets, run timeout after 30001 ms. (steps per millisecond=6 ) properties seen 3
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 17326 steps, including 0 resets, run timeout after 5047 ms. (steps per millisecond=3 ) properties seen 0
Interrupted Best-First random walk after 6664 steps, including 0 resets, run timeout after 5158 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 13100 steps, including 0 resets, run timeout after 5113 ms. (steps per millisecond=2 ) properties seen 0
Interrupted Best-First random walk after 855847 steps, including 2 resets, run timeout after 5002 ms. (steps per millisecond=171 ) properties seen 0
Running SMT prover for 4 properties.
// Phase 1: matrix 74861 rows 61234 cols
[2022-06-02 18:58:26] [INFO ] Computed 2028 place invariants in 5164 ms
[2022-06-02 18:58:47] [INFO ] [Real]Absence check using 0 positive and 2028 generalized place invariants in 5999 ms returned sat
[2022-06-02 18:58:48] [INFO ] After 22106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-02 18:59:09] [INFO ] [Nat]Absence check using 0 positive and 2028 generalized place invariants in 6255 ms returned sat
[2022-06-02 18:59:39] [INFO ] After 25843ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-02 19:00:07] [INFO ] After 54112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10947 ms.
[2022-06-02 19:00:18] [INFO ] After 90180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 30392 out of 61234 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61234/61234 places, 74861/74861 transitions.
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 61227 transition count 74852
Reduce places removed 9 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 61218 transition count 74845
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 39 place count 61211 transition count 74845
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 60 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 43 place count 61209 transition count 74843
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 3 with 29 rules applied. Total rules applied 72 place count 61209 transition count 74814
Ensure Unique test removed 2 places
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 103 place count 61178 transition count 74814
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 105 place count 61176 transition count 74412
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 61176 transition count 74412
Applied a total of 107 rules in 2963 ms. Remains 61176 /61234 variables (removed 58) and now considering 74412/74861 (removed 449) transitions.
Finished structural reductions, in 1 iterations. Remains : 61176/61234 places, 74412/74861 transitions.
Interrupted random walk after 181367 steps, including 23 resets, run timeout after 30001 ms. (steps per millisecond=6 ) properties seen 0
Interrupted Best-First random walk after 16174 steps, including 0 resets, run timeout after 5059 ms. (steps per millisecond=3 ) properties seen 0
Interrupted Best-First random walk after 6386 steps, including 0 resets, run timeout after 5233 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 12570 steps, including 0 resets, run timeout after 5140 ms. (steps per millisecond=2 ) properties seen 0
Interrupted Best-First random walk after 849484 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=169 ) properties seen 0
Interrupted probabilistic random walk after 791399 steps, run timeout after 150011 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 791399 steps, saw 787459 distinct states, run finished after 150014 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 74412 rows 61176 cols
[2022-06-02 19:03:47] [INFO ] Computed 2019 place invariants in 5490 ms
[2022-06-02 19:04:09] [INFO ] [Real]Absence check using 0 positive and 2019 generalized place invariants in 6302 ms returned sat
[2022-06-02 19:04:10] [INFO ] After 22929ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-02 19:04:31] [INFO ] [Nat]Absence check using 0 positive and 2019 generalized place invariants in 6052 ms returned sat
[2022-06-02 19:05:02] [INFO ] After 26043ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-02 19:05:31] [INFO ] After 55315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 9641 ms.
[2022-06-02 19:05:41] [INFO ] After 90678ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 30392 out of 61176 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61176/61176 places, 74412/74412 transitions.
Applied a total of 0 rules in 758 ms. Remains 61176 /61176 variables (removed 0) and now considering 74412/74412 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61176/61176 places, 74412/74412 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 61176/61176 places, 74412/74412 transitions.
Applied a total of 0 rules in 637 ms. Remains 61176 /61176 variables (removed 0) and now considering 74412/74412 (removed 0) transitions.
// Phase 1: matrix 74412 rows 61176 cols
[2022-06-02 19:05:48] [INFO ] Computed 2019 place invariants in 5465 ms
[2022-06-02 19:05:52] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-02 19:05:52] [INFO ] Implicit Places using invariants in 9961 ms returned []
Implicit Place search using SMT only with invariants took 9962 ms to find 0 implicit places.
// Phase 1: matrix 74412 rows 61176 cols
[2022-06-02 19:05:57] [INFO ] Computed 2019 place invariants in 5180 ms
[2022-06-02 19:06:02] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-02 19:06:02] [INFO ] Dead Transitions using invariants and state equation in 9467 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61176/61176 places, 74412/74412 transitions.
Interrupted random walk after 178388 steps, including 23 resets, run timeout after 30001 ms. (steps per millisecond=5 ) properties seen 0
Interrupted Best-First random walk after 15136 steps, including 0 resets, run timeout after 5019 ms. (steps per millisecond=3 ) properties seen 0
Interrupted Best-First random walk after 6040 steps, including 0 resets, run timeout after 5045 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 12088 steps, including 0 resets, run timeout after 5095 ms. (steps per millisecond=2 ) properties seen 0
Interrupted Best-First random walk after 888569 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=177 ) properties seen 1
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 74412 rows 61176 cols
[2022-06-02 19:06:58] [INFO ] Computed 2019 place invariants in 5624 ms
[2022-06-02 19:07:19] [INFO ] [Real]Absence check using 0 positive and 2019 generalized place invariants in 6099 ms returned sat
[2022-06-02 19:07:20] [INFO ] After 21958ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-02 19:07:41] [INFO ] [Nat]Absence check using 0 positive and 2019 generalized place invariants in 6072 ms returned sat
[2022-06-02 19:08:08] [INFO ] After 23416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-02 19:08:29] [INFO ] After 44859ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7310 ms.
[2022-06-02 19:08:36] [INFO ] After 76128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 30379 out of 61176 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61176/61176 places, 74412/74412 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61173 transition count 74409
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 61170 transition count 74407
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 61168 transition count 74407
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 65 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 place count 61166 transition count 74405
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 41 place count 61166 transition count 74381
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 66 place count 61141 transition count 74381
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 67 place count 61140 transition count 74180
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 61140 transition count 74180
Applied a total of 68 rules in 2843 ms. Remains 61140 /61176 variables (removed 36) and now considering 74180/74412 (removed 232) transitions.
Finished structural reductions, in 1 iterations. Remains : 61140/61176 places, 74180/74412 transitions.
Interrupted random walk after 208429 steps, including 27 resets, run timeout after 30001 ms. (steps per millisecond=6 ) properties seen 0
Interrupted Best-First random walk after 16246 steps, including 0 resets, run timeout after 5076 ms. (steps per millisecond=3 ) properties seen 0
Interrupted Best-First random walk after 6464 steps, including 0 resets, run timeout after 5108 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 12674 steps, including 0 resets, run timeout after 5113 ms. (steps per millisecond=2 ) properties seen 0
Interrupted probabilistic random walk after 788912 steps, run timeout after 135035 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 788912 steps, saw 785013 distinct states, run finished after 135036 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 74180 rows 61140 cols
[2022-06-02 19:11:45] [INFO ] Computed 2015 place invariants in 5325 ms
[2022-06-02 19:12:06] [INFO ] [Real]Absence check using 0 positive and 2015 generalized place invariants in 6152 ms returned sat
[2022-06-02 19:12:08] [INFO ] After 22258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-02 19:12:29] [INFO ] [Nat]Absence check using 0 positive and 2015 generalized place invariants in 6337 ms returned sat
[2022-06-02 19:12:56] [INFO ] After 23167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-02 19:13:18] [INFO ] After 44822ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7419 ms.
[2022-06-02 19:13:25] [INFO ] After 77511ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 30379 out of 61140 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61140/61140 places, 74180/74180 transitions.
Applied a total of 0 rules in 879 ms. Remains 61140 /61140 variables (removed 0) and now considering 74180/74180 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61140/61140 places, 74180/74180 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 61140/61140 places, 74180/74180 transitions.
Applied a total of 0 rules in 623 ms. Remains 61140 /61140 variables (removed 0) and now considering 74180/74180 (removed 0) transitions.
// Phase 1: matrix 74180 rows 61140 cols
[2022-06-02 19:13:32] [INFO ] Computed 2015 place invariants in 5494 ms
[2022-06-02 19:13:37] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-02 19:13:37] [INFO ] Implicit Places using invariants in 10256 ms returned []
Implicit Place search using SMT only with invariants took 10257 ms to find 0 implicit places.
// Phase 1: matrix 74180 rows 61140 cols
[2022-06-02 19:13:45] [INFO ] Computed 2015 place invariants in 8176 ms
[2022-06-02 19:13:49] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-02 19:13:49] [INFO ] Dead Transitions using invariants and state equation in 12515 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61140/61140 places, 74180/74180 transitions.
Applied a total of 0 rules in 565 ms. Remains 61140 /61140 variables (removed 0) and now considering 74180/74180 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 74180 rows 61140 cols
[2022-06-02 19:13:55] [INFO ] Computed 2015 place invariants in 4720 ms
[2022-06-02 19:14:16] [INFO ] [Real]Absence check using 0 positive and 2015 generalized place invariants in 5926 ms returned sat
[2022-06-02 19:14:17] [INFO ] After 21446ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-02 19:14:37] [INFO ] [Nat]Absence check using 0 positive and 2015 generalized place invariants in 5947 ms returned sat
[2022-06-02 19:15:03] [INFO ] After 22952ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-02 19:15:25] [INFO ] After 44928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7144 ms.
[2022-06-02 19:15:32] [INFO ] After 75698ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-06-02 19:15:37] [INFO ] Flatten gal took : 2418 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3432630427650500542
[2022-06-02 19:15:39] [INFO ] Too many transitions (74180) to apply POR reductions. Disabling POR matrices.
[2022-06-02 19:15:40] [INFO ] Built C files in 1667ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3432630427650500542
Running compilation step : cd /tmp/ltsmin3432630427650500542;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' '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-06-02 19:15:41] [INFO ] Applying decomposition
[2022-06-02 19:15:43] [INFO ] Flatten gal took : 3865 ms
[2022-06-02 19:15:44] [INFO ] Flatten gal took : 3412 ms
[2022-06-02 19:15:45] [INFO ] Input system was already deterministic with 74180 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/graph10678417503379519445.txt' '-o' '/tmp/graph10678417503379519445.bin' '-w' '/tmp/graph10678417503379519445.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10678417503379519445.bin' '-l' '-1' '-v' '-w' '/tmp/graph10678417503379519445.weights' '-q' '0' '-e' '0.001'
[2022-06-02 19:15:51] [INFO ] Decomposing Gal with order
[2022-06-02 19:16:09] [INFO ] Ran tautology test, simplified 0 / 3 in 26050 ms.
[2022-06-02 19:16:13] [INFO ] BMC solution for property FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-00(UNSAT) depth K=0 took 1324 ms
[2022-06-02 19:16:13] [INFO ] BMC solution for property FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-04(UNSAT) depth K=0 took 223 ms
[2022-06-02 19:16:13] [INFO ] BMC solution for property FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-07(UNSAT) depth K=0 took 99 ms
[2022-06-02 19:16:22] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 74180 rows 61140 cols
[2022-06-02 19:16:36] [INFO ] Computed 2015 place invariants in 5871 ms
[2022-06-02 19:16:36] [INFO ] Computed 2015 place invariants in 5888 ms
[2022-06-02 19:19:04] [INFO ] BMC solution for property FamilyReunion-PT-L00200M0020C010P010G005-ReachabilityFireability-00(UNSAT) depth K=1 took 169921 ms
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3432630427650500542;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' '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' killed by timeout after 240 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3432630427650500542;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' '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' killed by timeout after 240 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)

BK_STOP 1654197634282

--------------------
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="FamilyReunion-PT-L00200M0020C010P010G005"
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 FamilyReunion-PT-L00200M0020C010P010G005, 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 r078-tall-165260110800751"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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