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.r222-tall-165286025600702.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 ShieldPPPt-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025600702
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 7.6K Apr 29 13:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 13:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 13:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 29 13:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 29 13:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 13:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 29 13:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 13:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.9M 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 ShieldPPPt-PT-100B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654277867860

Running Version 202205111006
[2022-06-03 17:37:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-03 17:37:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 17:37:49] [INFO ] Load time of PNML (sax parser for PT used): 326 ms
[2022-06-03 17:37:49] [INFO ] Transformed 7803 places.
[2022-06-03 17:37:49] [INFO ] Transformed 7103 transitions.
[2022-06-03 17:37:49] [INFO ] Found NUPN structural information;
[2022-06-03 17:37:49] [INFO ] Parsed PT model containing 7803 places and 7103 transitions in 763 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 734 ms. (steps per millisecond=13 ) properties (out of 14) seen :5
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 7103 rows 7803 cols
[2022-06-03 17:37:51] [INFO ] Computed 1101 place invariants in 75 ms
[2022-06-03 17:37:54] [INFO ] After 2510ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-03 17:37:56] [INFO ] [Nat]Absence check using 1101 positive place invariants in 846 ms returned sat
[2022-06-03 17:38:10] [INFO ] After 13238ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2022-06-03 17:38:15] [INFO ] Deduced a trap composed of 19 places in 4170 ms of which 29 ms to minimize.
[2022-06-03 17:38:19] [INFO ] Deduced a trap composed of 21 places in 3917 ms of which 7 ms to minimize.
[2022-06-03 17:38:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 17:38:19] [INFO ] After 25503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 101791 ms.
Support contains 49 out of 7803 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Drop transitions removed 1870 transitions
Trivial Post-agglo rules discarded 1870 transitions
Performed 1870 trivial Post agglomeration. Transition count delta: 1870
Iterating post reduction 0 with 1870 rules applied. Total rules applied 1870 place count 7803 transition count 5233
Reduce places removed 1870 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1872 rules applied. Total rules applied 3742 place count 5933 transition count 5231
Reduce places removed 1 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 12 rules applied. Total rules applied 3754 place count 5932 transition count 5220
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 3765 place count 5921 transition count 5220
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 402 Pre rules applied. Total rules applied 3765 place count 5921 transition count 4818
Deduced a syphon composed of 402 places in 25 ms
Reduce places removed 402 places and 0 transitions.
Iterating global reduction 4 with 804 rules applied. Total rules applied 4569 place count 5519 transition count 4818
Discarding 690 places :
Symmetric choice reduction at 4 with 690 rule applications. Total rules 5259 place count 4829 transition count 4128
Iterating global reduction 4 with 690 rules applied. Total rules applied 5949 place count 4829 transition count 4128
Performed 296 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 296 Pre rules applied. Total rules applied 5949 place count 4829 transition count 3832
Deduced a syphon composed of 296 places in 19 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 4 with 592 rules applied. Total rules applied 6541 place count 4533 transition count 3832
Performed 1673 Post agglomeration using F-continuation condition.Transition count delta: 1673
Deduced a syphon composed of 1673 places in 38 ms
Reduce places removed 1673 places and 0 transitions.
Iterating global reduction 4 with 3346 rules applied. Total rules applied 9887 place count 2860 transition count 2159
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 11 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10089 place count 2759 transition count 2159
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10291 place count 2658 transition count 2159
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 91 places in 4 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 4 with 182 rules applied. Total rules applied 10473 place count 2567 transition count 2159
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 10477 place count 2567 transition count 2155
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 10481 place count 2563 transition count 2155
Partial Free-agglomeration rule applied 290 times.
Drop transitions removed 290 transitions
Iterating global reduction 5 with 290 rules applied. Total rules applied 10771 place count 2563 transition count 2155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10772 place count 2562 transition count 2154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 10773 place count 2561 transition count 2154
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 10773 place count 2561 transition count 2152
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 10777 place count 2559 transition count 2152
Applied a total of 10777 rules in 3506 ms. Remains 2559 /7803 variables (removed 5244) and now considering 2152/7103 (removed 4951) transitions.
Finished structural reductions, in 1 iterations. Remains : 2559/7803 places, 2152/7103 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 25980 ms. (steps per millisecond=38 ) properties (out of 7) seen :4
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 417317 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen 0
Interrupted Best-First random walk after 410480 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=82 ) properties seen 0
Interrupted Best-First random walk after 597938 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=119 ) properties seen 0
Running SMT prover for 3 properties.
// Phase 1: matrix 2152 rows 2559 cols
[2022-06-03 17:40:45] [INFO ] Computed 1100 place invariants in 18 ms
[2022-06-03 17:40:46] [INFO ] After 384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-03 17:40:46] [INFO ] [Nat]Absence check using 1100 positive place invariants in 222 ms returned sat
[2022-06-03 17:40:48] [INFO ] After 1586ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-03 17:40:48] [INFO ] State equation strengthened by 603 read => feed constraints.
[2022-06-03 17:40:51] [INFO ] After 2834ms SMT Verify possible using 603 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-03 17:40:51] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 2 ms to minimize.
[2022-06-03 17:40:52] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 2 ms to minimize.
[2022-06-03 17:40:52] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 1 ms to minimize.
[2022-06-03 17:40:52] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 0 ms to minimize.
[2022-06-03 17:40:52] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 1 ms to minimize.
[2022-06-03 17:40:53] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 1 ms to minimize.
[2022-06-03 17:40:53] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2022-06-03 17:40:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2014 ms
[2022-06-03 17:40:53] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 0 ms to minimize.
[2022-06-03 17:40:54] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 1 ms to minimize.
[2022-06-03 17:40:54] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 0 ms to minimize.
[2022-06-03 17:40:54] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2022-06-03 17:40:55] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 1 ms to minimize.
[2022-06-03 17:40:55] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 0 ms to minimize.
[2022-06-03 17:40:55] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 0 ms to minimize.
[2022-06-03 17:40:55] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 1 ms to minimize.
[2022-06-03 17:40:55] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2022-06-03 17:40:56] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 1 ms to minimize.
[2022-06-03 17:40:56] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2633 ms
[2022-06-03 17:40:57] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 1 ms to minimize.
[2022-06-03 17:40:57] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 0 ms to minimize.
[2022-06-03 17:40:57] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2022-06-03 17:40:58] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2022-06-03 17:40:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1312 ms
[2022-06-03 17:40:58] [INFO ] After 9837ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 748 ms.
[2022-06-03 17:40:59] [INFO ] After 12892ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14728 ms.
Support contains 30 out of 2559 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2559/2559 places, 2152/2152 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 2559 transition count 2147
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 2554 transition count 2147
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 44 place count 2537 transition count 2130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 2536 transition count 2130
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 2536 transition count 2130
Applied a total of 50 rules in 555 ms. Remains 2536 /2559 variables (removed 23) and now considering 2130/2152 (removed 22) transitions.
Finished structural reductions, in 1 iterations. Remains : 2536/2559 places, 2130/2152 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 23400 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 414318 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=82 ) properties seen 0
Interrupted Best-First random walk after 418094 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen 0
Interrupted Best-First random walk after 626040 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=125 ) properties seen 0
Probabilistic random walk exhausted memory after 1470833 steps, saw 1266677 distinct states, run finished after 65388 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2130 rows 2536 cols
[2022-06-03 17:42:58] [INFO ] Computed 1100 place invariants in 10 ms
[2022-06-03 17:42:58] [INFO ] After 346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-03 17:42:59] [INFO ] [Nat]Absence check using 1100 positive place invariants in 210 ms returned sat
[2022-06-03 17:43:02] [INFO ] After 2701ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-03 17:43:02] [INFO ] State equation strengthened by 607 read => feed constraints.
[2022-06-03 17:43:04] [INFO ] After 2189ms SMT Verify possible using 607 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-03 17:43:04] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 0 ms to minimize.
[2022-06-03 17:43:04] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 0 ms to minimize.
[2022-06-03 17:43:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 405 ms
[2022-06-03 17:43:05] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2022-06-03 17:43:05] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2022-06-03 17:43:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 473 ms
[2022-06-03 17:43:06] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2022-06-03 17:43:07] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2022-06-03 17:43:07] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
[2022-06-03 17:43:08] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2022-06-03 17:43:08] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2022-06-03 17:43:09] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 3 ms to minimize.
[2022-06-03 17:43:10] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2022-06-03 17:43:11] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2022-06-03 17:43:11] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5403 ms
[2022-06-03 17:43:11] [INFO ] After 9750ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3038 ms.
[2022-06-03 17:43:14] [INFO ] After 16186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 15605 ms.
Support contains 30 out of 2536 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2536/2536 places, 2130/2130 transitions.
Applied a total of 0 rules in 130 ms. Remains 2536 /2536 variables (removed 0) and now considering 2130/2130 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2536/2536 places, 2130/2130 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2536/2536 places, 2130/2130 transitions.
Applied a total of 0 rules in 132 ms. Remains 2536 /2536 variables (removed 0) and now considering 2130/2130 (removed 0) transitions.
// Phase 1: matrix 2130 rows 2536 cols
[2022-06-03 17:43:30] [INFO ] Computed 1100 place invariants in 9 ms
[2022-06-03 17:43:32] [INFO ] Implicit Places using invariants in 1555 ms returned [2519, 2523]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1559 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2534/2536 places, 2130/2130 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2532 transition count 2128
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2532 transition count 2128
Applied a total of 4 rules in 245 ms. Remains 2532 /2534 variables (removed 2) and now considering 2128/2130 (removed 2) transitions.
// Phase 1: matrix 2128 rows 2532 cols
[2022-06-03 17:43:32] [INFO ] Computed 1098 place invariants in 7 ms
[2022-06-03 17:43:34] [INFO ] Implicit Places using invariants in 1676 ms returned []
// Phase 1: matrix 2128 rows 2532 cols
[2022-06-03 17:43:34] [INFO ] Computed 1098 place invariants in 5 ms
[2022-06-03 17:43:35] [INFO ] State equation strengthened by 605 read => feed constraints.
[2022-06-03 17:43:53] [INFO ] Implicit Places using invariants and state equation in 19365 ms returned []
Implicit Place search using SMT with State Equation took 21044 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 2532/2536 places, 2128/2130 transitions.
Finished structural reductions, in 2 iterations. Remains : 2532/2536 places, 2128/2130 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 25256 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 413969 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=82 ) properties seen 0
Interrupted Best-First random walk after 406104 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=81 ) properties seen 0
Interrupted Best-First random walk after 614318 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=122 ) properties seen 0
Probabilistic random walk exhausted memory after 1453523 steps, saw 1259713 distinct states, run finished after 59572 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2128 rows 2532 cols
[2022-06-03 17:45:33] [INFO ] Computed 1098 place invariants in 11 ms
[2022-06-03 17:45:33] [INFO ] After 324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-03 17:45:34] [INFO ] [Nat]Absence check using 1098 positive place invariants in 208 ms returned sat
[2022-06-03 17:45:36] [INFO ] After 1712ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-03 17:45:36] [INFO ] State equation strengthened by 605 read => feed constraints.
[2022-06-03 17:45:41] [INFO ] After 5114ms SMT Verify possible using 605 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-03 17:45:41] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2022-06-03 17:45:41] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2022-06-03 17:45:41] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2022-06-03 17:45:42] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2022-06-03 17:45:42] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2022-06-03 17:45:42] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2022-06-03 17:45:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1311 ms
[2022-06-03 17:45:46] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2022-06-03 17:45:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1183 ms
[2022-06-03 17:45:47] [INFO ] After 10896ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2846 ms.
[2022-06-03 17:45:49] [INFO ] After 16126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 16078 ms.
Support contains 30 out of 2532 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2532/2532 places, 2128/2128 transitions.
Applied a total of 0 rules in 120 ms. Remains 2532 /2532 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2532/2532 places, 2128/2128 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2532/2532 places, 2128/2128 transitions.
Applied a total of 0 rules in 125 ms. Remains 2532 /2532 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
// Phase 1: matrix 2128 rows 2532 cols
[2022-06-03 17:46:06] [INFO ] Computed 1098 place invariants in 8 ms
[2022-06-03 17:46:07] [INFO ] Implicit Places using invariants in 1529 ms returned []
// Phase 1: matrix 2128 rows 2532 cols
[2022-06-03 17:46:07] [INFO ] Computed 1098 place invariants in 10 ms
[2022-06-03 17:46:09] [INFO ] State equation strengthened by 605 read => feed constraints.
[2022-06-03 17:46:25] [INFO ] Implicit Places using invariants and state equation in 17538 ms returned []
Implicit Place search using SMT with State Equation took 19069 ms to find 0 implicit places.
[2022-06-03 17:46:25] [INFO ] Redundant transitions in 123 ms returned []
// Phase 1: matrix 2128 rows 2532 cols
[2022-06-03 17:46:25] [INFO ] Computed 1098 place invariants in 4 ms
[2022-06-03 17:46:26] [INFO ] Dead Transitions using invariants and state equation in 1443 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2532/2532 places, 2128/2128 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 23942 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 427419 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=85 ) properties seen 0
Interrupted Best-First random walk after 419750 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen 0
Interrupted Best-First random walk after 629669 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=125 ) properties seen 0
Probabilistic random walk exhausted memory after 1453523 steps, saw 1259713 distinct states, run finished after 59028 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2128 rows 2532 cols
[2022-06-03 17:48:05] [INFO ] Computed 1098 place invariants in 7 ms
[2022-06-03 17:48:05] [INFO ] After 370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-03 17:48:05] [INFO ] [Nat]Absence check using 1098 positive place invariants in 199 ms returned sat
[2022-06-03 17:48:07] [INFO ] After 1721ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-03 17:48:07] [INFO ] State equation strengthened by 605 read => feed constraints.
[2022-06-03 17:48:13] [INFO ] After 5237ms SMT Verify possible using 605 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-03 17:48:13] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2022-06-03 17:48:13] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2022-06-03 17:48:13] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 0 ms to minimize.
[2022-06-03 17:48:13] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2022-06-03 17:48:13] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2022-06-03 17:48:14] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2022-06-03 17:48:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1271 ms
[2022-06-03 17:48:17] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2022-06-03 17:48:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1153 ms
[2022-06-03 17:48:18] [INFO ] After 10929ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2855 ms.
[2022-06-03 17:48:21] [INFO ] After 16158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 16292 ms.
Support contains 30 out of 2532 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2532/2532 places, 2128/2128 transitions.
Applied a total of 0 rules in 124 ms. Remains 2532 /2532 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2532/2532 places, 2128/2128 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2532/2532 places, 2128/2128 transitions.
Applied a total of 0 rules in 124 ms. Remains 2532 /2532 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
// Phase 1: matrix 2128 rows 2532 cols
[2022-06-03 17:48:38] [INFO ] Computed 1098 place invariants in 7 ms
[2022-06-03 17:48:39] [INFO ] Implicit Places using invariants in 1809 ms returned []
// Phase 1: matrix 2128 rows 2532 cols
[2022-06-03 17:48:39] [INFO ] Computed 1098 place invariants in 12 ms
[2022-06-03 17:48:41] [INFO ] State equation strengthened by 605 read => feed constraints.
[2022-06-03 17:49:02] [INFO ] Implicit Places using invariants and state equation in 22210 ms returned []
Implicit Place search using SMT with State Equation took 24020 ms to find 0 implicit places.
[2022-06-03 17:49:02] [INFO ] Redundant transitions in 86 ms returned []
// Phase 1: matrix 2128 rows 2532 cols
[2022-06-03 17:49:02] [INFO ] Computed 1098 place invariants in 5 ms
[2022-06-03 17:49:03] [INFO ] Dead Transitions using invariants and state equation in 1413 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2532/2532 places, 2128/2128 transitions.
Partial Free-agglomeration rule applied 667 times.
Drop transitions removed 667 transitions
Iterating global reduction 0 with 667 rules applied. Total rules applied 667 place count 2532 transition count 2128
Applied a total of 667 rules in 314 ms. Remains 2532 /2532 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2128 rows 2532 cols
[2022-06-03 17:49:03] [INFO ] Computed 1098 place invariants in 11 ms
[2022-06-03 17:49:04] [INFO ] After 323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-03 17:49:04] [INFO ] [Nat]Absence check using 1098 positive place invariants in 207 ms returned sat
[2022-06-03 17:49:06] [INFO ] After 1721ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-03 17:49:06] [INFO ] State equation strengthened by 650 read => feed constraints.
[2022-06-03 17:49:16] [INFO ] After 9825ms SMT Verify possible using 650 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 17:49:17] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 1 ms to minimize.
[2022-06-03 17:49:18] [INFO ] Deduced a trap composed of 7 places in 260 ms of which 1 ms to minimize.
[2022-06-03 17:49:18] [INFO ] Deduced a trap composed of 8 places in 266 ms of which 1 ms to minimize.
[2022-06-03 17:49:18] [INFO ] Deduced a trap composed of 8 places in 262 ms of which 1 ms to minimize.
[2022-06-03 17:49:19] [INFO ] Deduced a trap composed of 8 places in 266 ms of which 1 ms to minimize.
[2022-06-03 17:49:19] [INFO ] Deduced a trap composed of 8 places in 262 ms of which 1 ms to minimize.
[2022-06-03 17:49:19] [INFO ] Deduced a trap composed of 8 places in 255 ms of which 3 ms to minimize.
[2022-06-03 17:49:20] [INFO ] Deduced a trap composed of 16 places in 258 ms of which 1 ms to minimize.
[2022-06-03 17:49:20] [INFO ] Deduced a trap composed of 10 places in 268 ms of which 1 ms to minimize.
[2022-06-03 17:49:21] [INFO ] Deduced a trap composed of 8 places in 260 ms of which 1 ms to minimize.
[2022-06-03 17:49:21] [INFO ] Deduced a trap composed of 15 places in 249 ms of which 1 ms to minimize.
[2022-06-03 17:49:21] [INFO ] Deduced a trap composed of 7 places in 254 ms of which 1 ms to minimize.
[2022-06-03 17:49:22] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 0 ms to minimize.
[2022-06-03 17:49:22] [INFO ] Deduced a trap composed of 8 places in 255 ms of which 2 ms to minimize.
[2022-06-03 17:49:22] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 2 ms to minimize.
[2022-06-03 17:49:23] [INFO ] Deduced a trap composed of 9 places in 246 ms of which 2 ms to minimize.
[2022-06-03 17:49:23] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 1 ms to minimize.
[2022-06-03 17:49:23] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 0 ms to minimize.
[2022-06-03 17:49:24] [INFO ] Deduced a trap composed of 16 places in 256 ms of which 1 ms to minimize.
[2022-06-03 17:49:24] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 1 ms to minimize.
[2022-06-03 17:49:24] [INFO ] Deduced a trap composed of 8 places in 264 ms of which 1 ms to minimize.
[2022-06-03 17:49:25] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 1 ms to minimize.
[2022-06-03 17:49:25] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 8082 ms
[2022-06-03 17:49:25] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 0 ms to minimize.
[2022-06-03 17:49:26] [INFO ] Deduced a trap composed of 8 places in 249 ms of which 0 ms to minimize.
[2022-06-03 17:49:26] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 1 ms to minimize.
[2022-06-03 17:49:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1149 ms
[2022-06-03 17:49:26] [INFO ] After 20087ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 280 ms.
[2022-06-03 17:49:27] [INFO ] After 22737ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-03 17:49:27] [INFO ] Flatten gal took : 307 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6872674441440639014
[2022-06-03 17:49:27] [INFO ] Too many transitions (2128) to apply POR reductions. Disabling POR matrices.
[2022-06-03 17:49:27] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6872674441440639014
Running compilation step : cd /tmp/ltsmin6872674441440639014;'/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-03 17:49:27] [INFO ] Applying decomposition
[2022-06-03 17:49:28] [INFO ] Flatten gal took : 336 ms
[2022-06-03 17:49:28] [INFO ] Flatten gal took : 277 ms
[2022-06-03 17:49:28] [INFO ] Input system was already deterministic with 2128 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/graph17679055529696751370.txt' '-o' '/tmp/graph17679055529696751370.bin' '-w' '/tmp/graph17679055529696751370.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17679055529696751370.bin' '-l' '-1' '-v' '-w' '/tmp/graph17679055529696751370.weights' '-q' '0' '-e' '0.001'
[2022-06-03 17:49:28] [INFO ] Decomposing Gal with order
[2022-06-03 17:49:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 17:49:29] [INFO ] Ran tautology test, simplified 0 / 3 in 1055 ms.
[2022-06-03 17:49:29] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-03(UNSAT) depth K=0 took 54 ms
[2022-06-03 17:49:29] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-04(UNSAT) depth K=0 took 0 ms
[2022-06-03 17:49:29] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-13(UNSAT) depth K=0 took 0 ms
[2022-06-03 17:49:29] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-03(UNSAT) depth K=1 took 2 ms
[2022-06-03 17:49:29] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-04(UNSAT) depth K=1 took 1 ms
[2022-06-03 17:49:29] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-13(UNSAT) depth K=1 took 2 ms
[2022-06-03 17:49:29] [INFO ] Removed a total of 1457 redundant transitions.
[2022-06-03 17:49:29] [INFO ] Flatten gal took : 407 ms
[2022-06-03 17:49:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 594 labels/synchronizations in 302 ms.
[2022-06-03 17:49:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7195682571347209389.gal : 78 ms
[2022-06-03 17:49:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6048600265137837199.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/ReachabilityCardinality7195682571347209389.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6048600265137837199.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...298
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 2128 rows 2532 cols
[2022-06-03 17:49:30] [INFO ] Computed 1098 place invariants in 18 ms
[2022-06-03 17:49:30] [INFO ] Computed 1098 place invariants in 19 ms
Loading property file /tmp/ReachabilityCardinality6048600265137837199.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :3 after 5
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :5 after 7
[2022-06-03 17:49:33] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-03(UNSAT) depth K=2 took 3595 ms
Compilation finished in 6136 ms.
Running link step : cd /tmp/ltsmin6872674441440639014;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6872674441440639014;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityCardinality03==true'
[2022-06-03 17:49:35] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-04(UNSAT) depth K=2 took 2164 ms
[2022-06-03 17:49:40] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-13(UNSAT) depth K=2 took 5449 ms
[2022-06-03 17:49:43] [INFO ] Proved 2532 variables to be positive in 12898 ms
[2022-06-03 17:49:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-03
[2022-06-03 17:49:45] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-03(SAT) depth K=0 took 2273 ms
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :7 after 51
[2022-06-03 17:49:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-04
[2022-06-03 17:49:49] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-04(SAT) depth K=0 took 3930 ms
[2022-06-03 17:49:53] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-13
[2022-06-03 17:49:53] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-13(SAT) depth K=0 took 4236 ms
[2022-06-03 17:50:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-03
[2022-06-03 17:50:09] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-03(SAT) depth K=1 took 15161 ms
[2022-06-03 17:50:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-04
[2022-06-03 17:50:33] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-04(SAT) depth K=1 took 24228 ms
[2022-06-03 17:50:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-13
[2022-06-03 17:50:39] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-13(SAT) depth K=1 took 6349 ms
[2022-06-03 17:50:44] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-03(UNSAT) depth K=3 took 63928 ms
Invariant property ShieldPPPt-PT-100B-ReachabilityCardinality-13 does not hold.
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1.6259e+12 after 2.80218e+165
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2.80218e+165 after 2.80218e+165
[2022-06-03 18:04:09] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-04(UNSAT) depth K=3 took 805112 ms
[2022-06-03 18:04:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-03
[2022-06-03 18:04:56] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-03(SAT) depth K=2 took 856370 ms
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin6872674441440639014;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityCardinality03==true'
Running LTSmin : cd /tmp/ltsmin6872674441440639014;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityCardinality04==true'
Detected timeout of ITS tools.
[2022-06-03 18:13:23] [INFO ] Applying decomposition
[2022-06-03 18:13:23] [INFO ] Flatten gal took : 354 ms
[2022-06-03 18:13:23] [INFO ] Decomposing Gal with order
[2022-06-03 18:13:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 18:13:26] [INFO ] Removed a total of 1570 redundant transitions.
[2022-06-03 18:13:26] [INFO ] Flatten gal took : 546 ms
[2022-06-03 18:13:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 2158 labels/synchronizations in 1309 ms.
[2022-06-03 18:13:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16208772471825216806.gal : 270 ms
[2022-06-03 18:13:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9385096409777347158.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/ReachabilityCardinality16208772471825216806.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9385096409777347158.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/ReachabilityCardinality9385096409777347158.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 15
[2022-06-03 18:23:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-04
[2022-06-03 18:23:49] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-04(SAT) depth K=2 took 1133398 ms
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin6872674441440639014;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityCardinality04==true'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin6872674441440639014;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityCardinality03==true'
Detected timeout of ITS tools.
[2022-06-03 18:37:25] [INFO ] Flatten gal took : 336 ms
[2022-06-03 18:37:25] [INFO ] Input system was already deterministic with 2128 transitions.
[2022-06-03 18:37:25] [INFO ] Transformed 2532 places.
[2022-06-03 18:37:25] [INFO ] Transformed 2128 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-03 18:37:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8859920524715144915.gal : 17 ms
[2022-06-03 18:37:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2943258145741430603.prop : 0 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/ReachabilityCardinality8859920524715144915.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2943258145741430603.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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...364
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality2943258145741430603.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 15
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :15 after 39
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :39 after 75
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :75 after 111
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :111 after 653
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :653 after 1955
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1955 after 498139
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :498139 after 1.71948e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.71948e+06 after 9.11264e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :9.11264e+06 after 6.8337e+07

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="ShieldPPPt-PT-100B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldPPPt-PT-100B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025600702"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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