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-165286025600687.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-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025600687
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.7K Apr 29 13:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 13:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 13:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 13:38 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.5K May 9 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 29 13:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 13:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 13:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 29 13:38 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 955K 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-050B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654276995679

Running Version 202205111006
[2022-06-03 17:23:16] [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-03 17:23:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 17:23:17] [INFO ] Load time of PNML (sax parser for PT used): 251 ms
[2022-06-03 17:23:17] [INFO ] Transformed 3903 places.
[2022-06-03 17:23:17] [INFO ] Transformed 3553 transitions.
[2022-06-03 17:23:17] [INFO ] Found NUPN structural information;
[2022-06-03 17:23:17] [INFO ] Parsed PT model containing 3903 places and 3553 transitions in 539 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=14 ) properties (out of 16) seen :3
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 3553 rows 3903 cols
[2022-06-03 17:23:19] [INFO ] Computed 551 place invariants in 49 ms
[2022-06-03 17:23:20] [INFO ] After 1772ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-06-03 17:23:22] [INFO ] [Nat]Absence check using 551 positive place invariants in 262 ms returned sat
[2022-06-03 17:23:31] [INFO ] After 7745ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2022-06-03 17:23:32] [INFO ] Deduced a trap composed of 33 places in 1184 ms of which 10 ms to minimize.
[2022-06-03 17:23:34] [INFO ] Deduced a trap composed of 28 places in 1178 ms of which 4 ms to minimize.
[2022-06-03 17:23:35] [INFO ] Deduced a trap composed of 20 places in 1172 ms of which 2 ms to minimize.
[2022-06-03 17:23:36] [INFO ] Deduced a trap composed of 21 places in 1172 ms of which 3 ms to minimize.
[2022-06-03 17:23:37] [INFO ] Deduced a trap composed of 25 places in 1155 ms of which 2 ms to minimize.
[2022-06-03 17:23:39] [INFO ] Deduced a trap composed of 23 places in 1148 ms of which 2 ms to minimize.
[2022-06-03 17:23:40] [INFO ] Deduced a trap composed of 22 places in 1134 ms of which 2 ms to minimize.
[2022-06-03 17:23:41] [INFO ] Deduced a trap composed of 30 places in 1146 ms of which 2 ms to minimize.
[2022-06-03 17:23:43] [INFO ] Deduced a trap composed of 27 places in 1123 ms of which 2 ms to minimize.
[2022-06-03 17:23:44] [INFO ] Deduced a trap composed of 27 places in 1133 ms of which 2 ms to minimize.
[2022-06-03 17:23:45] [INFO ] Deduced a trap composed of 20 places in 1117 ms of which 3 ms to minimize.
[2022-06-03 17:23:46] [INFO ] Deduced a trap composed of 25 places in 1103 ms of which 3 ms to minimize.
[2022-06-03 17:23:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 17:23:46] [INFO ] After 25988ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 89177 ms.
Support contains 248 out of 3903 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Drop transitions removed 760 transitions
Trivial Post-agglo rules discarded 760 transitions
Performed 760 trivial Post agglomeration. Transition count delta: 760
Iterating post reduction 0 with 760 rules applied. Total rules applied 760 place count 3903 transition count 2793
Reduce places removed 760 places and 0 transitions.
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Iterating post reduction 1 with 836 rules applied. Total rules applied 1596 place count 3143 transition count 2717
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 1672 place count 3067 transition count 2717
Performed 213 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 213 Pre rules applied. Total rules applied 1672 place count 3067 transition count 2504
Deduced a syphon composed of 213 places in 25 ms
Reduce places removed 213 places and 0 transitions.
Iterating global reduction 3 with 426 rules applied. Total rules applied 2098 place count 2854 transition count 2504
Discarding 297 places :
Symmetric choice reduction at 3 with 297 rule applications. Total rules 2395 place count 2557 transition count 2207
Iterating global reduction 3 with 297 rules applied. Total rules applied 2692 place count 2557 transition count 2207
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 2692 place count 2557 transition count 2106
Deduced a syphon composed of 101 places in 60 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2894 place count 2456 transition count 2106
Performed 759 Post agglomeration using F-continuation condition.Transition count delta: 759
Deduced a syphon composed of 759 places in 4 ms
Reduce places removed 759 places and 0 transitions.
Iterating global reduction 3 with 1518 rules applied. Total rules applied 4412 place count 1697 transition count 1347
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 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4614 place count 1596 transition count 1347
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 4624 place count 1591 transition count 1347
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 4631 place count 1591 transition count 1340
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 4638 place count 1584 transition count 1340
Partial Free-agglomeration rule applied 128 times.
Drop transitions removed 128 transitions
Iterating global reduction 4 with 128 rules applied. Total rules applied 4766 place count 1584 transition count 1340
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 4767 place count 1584 transition count 1340
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4768 place count 1583 transition count 1339
Applied a total of 4768 rules in 2152 ms. Remains 1583 /3903 variables (removed 2320) and now considering 1339/3553 (removed 2214) transitions.
Finished structural reductions, in 1 iterations. Remains : 1583/3903 places, 1339/3553 transitions.
Interrupted random walk after 913790 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen 2
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 499824 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen 0
Interrupted Best-First random walk after 611913 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=122 ) properties seen 0
Interrupted Best-First random walk after 529264 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=105 ) properties seen 0
Interrupted Best-First random walk after 605751 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=121 ) properties seen 0
Interrupted Best-First random walk after 547236 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=109 ) properties seen 0
Interrupted Best-First random walk after 545662 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=109 ) properties seen 0
Interrupted Best-First random walk after 583438 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=116 ) properties seen 0
Interrupted Best-First random walk after 587451 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=117 ) properties seen 2
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 528058 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=105 ) properties seen 0
Running SMT prover for 8 properties.
// Phase 1: matrix 1339 rows 1583 cols
[2022-06-03 17:26:33] [INFO ] Computed 551 place invariants in 6 ms
[2022-06-03 17:26:33] [INFO ] After 431ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-03 17:26:34] [INFO ] [Nat]Absence check using 551 positive place invariants in 107 ms returned sat
[2022-06-03 17:26:36] [INFO ] After 1502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-03 17:26:36] [INFO ] State equation strengthened by 162 read => feed constraints.
[2022-06-03 17:26:37] [INFO ] After 1761ms SMT Verify possible using 162 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-06-03 17:26:38] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 1 ms to minimize.
[2022-06-03 17:26:38] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 1 ms to minimize.
[2022-06-03 17:26:38] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 1 ms to minimize.
[2022-06-03 17:26:39] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 0 ms to minimize.
[2022-06-03 17:26:39] [INFO ] Deduced a trap composed of 6 places in 257 ms of which 1 ms to minimize.
[2022-06-03 17:26:39] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 1 ms to minimize.
[2022-06-03 17:26:40] [INFO ] Deduced a trap composed of 7 places in 246 ms of which 1 ms to minimize.
[2022-06-03 17:26:40] [INFO ] Deduced a trap composed of 9 places in 246 ms of which 1 ms to minimize.
[2022-06-03 17:26:40] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 1 ms to minimize.
[2022-06-03 17:26:41] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 1 ms to minimize.
[2022-06-03 17:26:41] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 1 ms to minimize.
[2022-06-03 17:26:41] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 1 ms to minimize.
[2022-06-03 17:26:42] [INFO ] Deduced a trap composed of 14 places in 223 ms of which 1 ms to minimize.
[2022-06-03 17:26:42] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 1 ms to minimize.
[2022-06-03 17:26:42] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 1 ms to minimize.
[2022-06-03 17:26:42] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 1 ms to minimize.
[2022-06-03 17:26:43] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 1 ms to minimize.
[2022-06-03 17:26:43] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 1 ms to minimize.
[2022-06-03 17:26:43] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 1 ms to minimize.
[2022-06-03 17:26:44] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 1 ms to minimize.
[2022-06-03 17:26:44] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 1 ms to minimize.
[2022-06-03 17:26:44] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 6491 ms
[2022-06-03 17:26:45] [INFO ] Deduced a trap composed of 6 places in 269 ms of which 1 ms to minimize.
[2022-06-03 17:26:45] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 0 ms to minimize.
[2022-06-03 17:26:46] [INFO ] Deduced a trap composed of 6 places in 390 ms of which 1 ms to minimize.
[2022-06-03 17:26:46] [INFO ] Deduced a trap composed of 6 places in 370 ms of which 1 ms to minimize.
[2022-06-03 17:26:47] [INFO ] Deduced a trap composed of 6 places in 386 ms of which 1 ms to minimize.
[2022-06-03 17:26:47] [INFO ] Deduced a trap composed of 5 places in 372 ms of which 1 ms to minimize.
[2022-06-03 17:26:48] [INFO ] Deduced a trap composed of 8 places in 358 ms of which 1 ms to minimize.
[2022-06-03 17:26:48] [INFO ] Deduced a trap composed of 5 places in 360 ms of which 1 ms to minimize.
[2022-06-03 17:26:48] [INFO ] Deduced a trap composed of 11 places in 347 ms of which 1 ms to minimize.
[2022-06-03 17:26:49] [INFO ] Deduced a trap composed of 6 places in 333 ms of which 2 ms to minimize.
[2022-06-03 17:26:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4636 ms
[2022-06-03 17:26:49] [INFO ] Deduced a trap composed of 7 places in 350 ms of which 11 ms to minimize.
[2022-06-03 17:26:50] [INFO ] Deduced a trap composed of 12 places in 337 ms of which 1 ms to minimize.
[2022-06-03 17:26:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 896 ms
[2022-06-03 17:26:51] [INFO ] Deduced a trap composed of 8 places in 371 ms of which 1 ms to minimize.
[2022-06-03 17:26:51] [INFO ] Deduced a trap composed of 9 places in 334 ms of which 1 ms to minimize.
[2022-06-03 17:26:52] [INFO ] Deduced a trap composed of 6 places in 327 ms of which 1 ms to minimize.
[2022-06-03 17:26:52] [INFO ] Deduced a trap composed of 9 places in 335 ms of which 1 ms to minimize.
[2022-06-03 17:26:52] [INFO ] Deduced a trap composed of 10 places in 313 ms of which 1 ms to minimize.
[2022-06-03 17:26:53] [INFO ] Deduced a trap composed of 10 places in 340 ms of which 1 ms to minimize.
[2022-06-03 17:26:53] [INFO ] Deduced a trap composed of 12 places in 308 ms of which 1 ms to minimize.
[2022-06-03 17:26:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2956 ms
[2022-06-03 17:26:54] [INFO ] Deduced a trap composed of 13 places in 359 ms of which 1 ms to minimize.
[2022-06-03 17:26:54] [INFO ] Deduced a trap composed of 15 places in 371 ms of which 1 ms to minimize.
[2022-06-03 17:26:55] [INFO ] Deduced a trap composed of 18 places in 361 ms of which 1 ms to minimize.
[2022-06-03 17:26:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1391 ms
[2022-06-03 17:26:56] [INFO ] Deduced a trap composed of 6 places in 338 ms of which 5 ms to minimize.
[2022-06-03 17:26:56] [INFO ] Deduced a trap composed of 3 places in 325 ms of which 1 ms to minimize.
[2022-06-03 17:26:56] [INFO ] Deduced a trap composed of 6 places in 336 ms of which 1 ms to minimize.
[2022-06-03 17:26:57] [INFO ] Deduced a trap composed of 6 places in 323 ms of which 1 ms to minimize.
[2022-06-03 17:26:57] [INFO ] Deduced a trap composed of 9 places in 323 ms of which 1 ms to minimize.
[2022-06-03 17:26:58] [INFO ] Deduced a trap composed of 8 places in 328 ms of which 1 ms to minimize.
[2022-06-03 17:26:58] [INFO ] Deduced a trap composed of 17 places in 322 ms of which 1 ms to minimize.
[2022-06-03 17:26:58] [INFO ] Deduced a trap composed of 5 places in 344 ms of which 1 ms to minimize.
[2022-06-03 17:26:59] [INFO ] Deduced a trap composed of 8 places in 317 ms of which 1 ms to minimize.
[2022-06-03 17:26:59] [INFO ] Deduced a trap composed of 7 places in 331 ms of which 1 ms to minimize.
[2022-06-03 17:27:00] [INFO ] Deduced a trap composed of 14 places in 314 ms of which 3 ms to minimize.
[2022-06-03 17:27:00] [INFO ] Deduced a trap composed of 13 places in 303 ms of which 1 ms to minimize.
[2022-06-03 17:27:00] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4827 ms
[2022-06-03 17:27:00] [INFO ] Deduced a trap composed of 5 places in 334 ms of which 1 ms to minimize.
[2022-06-03 17:27:01] [INFO ] Deduced a trap composed of 12 places in 326 ms of which 1 ms to minimize.
[2022-06-03 17:27:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 849 ms
[2022-06-03 17:27:01] [INFO ] Deduced a trap composed of 8 places in 371 ms of which 1 ms to minimize.
[2022-06-03 17:27:02] [INFO ] Deduced a trap composed of 12 places in 369 ms of which 1 ms to minimize.
[2022-06-03 17:27:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 926 ms
[2022-06-03 17:27:02] [INFO ] After 26459ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1675 ms.
[2022-06-03 17:27:04] [INFO ] After 30355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 11534 ms.
Support contains 181 out of 1583 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1583/1583 places, 1339/1339 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1583 transition count 1321
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 37 place count 1565 transition count 1320
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 1564 transition count 1320
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 38 place count 1564 transition count 1309
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 60 place count 1553 transition count 1309
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 162 place count 1502 transition count 1258
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 178 place count 1494 transition count 1258
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 181 place count 1494 transition count 1255
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 184 place count 1491 transition count 1255
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 191 place count 1491 transition count 1255
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 196 place count 1486 transition count 1250
Applied a total of 196 rules in 854 ms. Remains 1486 /1583 variables (removed 97) and now considering 1250/1339 (removed 89) transitions.
Finished structural reductions, in 1 iterations. Remains : 1486/1583 places, 1250/1339 transitions.
Interrupted random walk after 978042 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen 0
Interrupted Best-First random walk after 518688 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=103 ) properties seen 0
Interrupted Best-First random walk after 519159 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=103 ) properties seen 0
Interrupted Best-First random walk after 573055 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=114 ) properties seen 0
Interrupted Best-First random walk after 539617 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=107 ) properties seen 0
Interrupted Best-First random walk after 552541 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=110 ) properties seen 1
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 581493 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=116 ) properties seen 0
Interrupted Best-First random walk after 609561 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=121 ) properties seen 0
Interrupted Best-First random walk after 609593 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=121 ) properties seen 0
Running SMT prover for 7 properties.
// Phase 1: matrix 1250 rows 1486 cols
[2022-06-03 17:28:26] [INFO ] Computed 551 place invariants in 11 ms
[2022-06-03 17:28:26] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-03 17:28:27] [INFO ] [Nat]Absence check using 551 positive place invariants in 100 ms returned sat
[2022-06-03 17:28:28] [INFO ] After 1131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-06-03 17:28:28] [INFO ] State equation strengthened by 129 read => feed constraints.
[2022-06-03 17:28:29] [INFO ] After 994ms SMT Verify possible using 129 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-06-03 17:28:30] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 0 ms to minimize.
[2022-06-03 17:28:30] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 0 ms to minimize.
[2022-06-03 17:28:30] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 0 ms to minimize.
[2022-06-03 17:28:31] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 1 ms to minimize.
[2022-06-03 17:28:31] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 1 ms to minimize.
[2022-06-03 17:28:31] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 0 ms to minimize.
[2022-06-03 17:28:31] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 0 ms to minimize.
[2022-06-03 17:28:32] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 0 ms to minimize.
[2022-06-03 17:28:32] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2022-06-03 17:28:32] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
[2022-06-03 17:28:32] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2022-06-03 17:28:32] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 1 ms to minimize.
[2022-06-03 17:28:33] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2022-06-03 17:28:33] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2022-06-03 17:28:33] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2022-06-03 17:28:33] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 0 ms to minimize.
[2022-06-03 17:28:34] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 0 ms to minimize.
[2022-06-03 17:28:34] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 1 ms to minimize.
[2022-06-03 17:28:34] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2022-06-03 17:28:34] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 1 ms to minimize.
[2022-06-03 17:28:34] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2022-06-03 17:28:35] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 1 ms to minimize.
[2022-06-03 17:28:35] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5053 ms
[2022-06-03 17:28:35] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 0 ms to minimize.
[2022-06-03 17:28:35] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2022-06-03 17:28:36] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 0 ms to minimize.
[2022-06-03 17:28:36] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 0 ms to minimize.
[2022-06-03 17:28:36] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 1 ms to minimize.
[2022-06-03 17:28:36] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 1 ms to minimize.
[2022-06-03 17:28:37] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 0 ms to minimize.
[2022-06-03 17:28:37] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 0 ms to minimize.
[2022-06-03 17:28:37] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 0 ms to minimize.
[2022-06-03 17:28:37] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 0 ms to minimize.
[2022-06-03 17:28:38] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 1 ms to minimize.
[2022-06-03 17:28:38] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 0 ms to minimize.
[2022-06-03 17:28:38] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 1 ms to minimize.
[2022-06-03 17:28:38] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3338 ms
[2022-06-03 17:28:38] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 1 ms to minimize.
[2022-06-03 17:28:39] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 0 ms to minimize.
[2022-06-03 17:28:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 523 ms
[2022-06-03 17:28:39] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2022-06-03 17:28:40] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 1 ms to minimize.
[2022-06-03 17:28:40] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 1 ms to minimize.
[2022-06-03 17:28:40] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 0 ms to minimize.
[2022-06-03 17:28:40] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 0 ms to minimize.
[2022-06-03 17:28:41] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 1 ms to minimize.
[2022-06-03 17:28:41] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2022-06-03 17:28:41] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2022-06-03 17:28:41] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 1 ms to minimize.
[2022-06-03 17:28:41] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 1 ms to minimize.
[2022-06-03 17:28:42] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 0 ms to minimize.
[2022-06-03 17:28:42] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 1 ms to minimize.
[2022-06-03 17:28:42] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 1 ms to minimize.
[2022-06-03 17:28:42] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 1 ms to minimize.
[2022-06-03 17:28:43] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 0 ms to minimize.
[2022-06-03 17:28:43] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 0 ms to minimize.
[2022-06-03 17:28:43] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 1 ms to minimize.
[2022-06-03 17:28:43] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 1 ms to minimize.
[2022-06-03 17:28:44] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 0 ms to minimize.
[2022-06-03 17:28:44] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4803 ms
[2022-06-03 17:28:44] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
[2022-06-03 17:28:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2022-06-03 17:28:44] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 0 ms to minimize.
[2022-06-03 17:28:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2022-06-03 17:28:45] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 1 ms to minimize.
[2022-06-03 17:28:45] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 0 ms to minimize.
[2022-06-03 17:28:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 462 ms
[2022-06-03 17:28:45] [INFO ] After 16735ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1870 ms.
[2022-06-03 17:28:47] [INFO ] After 20377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 12805 ms.
Support contains 151 out of 1486 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1486/1486 places, 1250/1250 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1486 transition count 1244
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 1480 transition count 1244
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 12 place count 1480 transition count 1237
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 26 place count 1473 transition count 1237
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 60 place count 1456 transition count 1220
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 76 place count 1448 transition count 1219
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 1448 transition count 1219
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 1447 transition count 1218
Applied a total of 79 rules in 208 ms. Remains 1447 /1486 variables (removed 39) and now considering 1218/1250 (removed 32) transitions.
Finished structural reductions, in 1 iterations. Remains : 1447/1486 places, 1218/1250 transitions.
Interrupted random walk after 946375 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=31 ) properties seen 0
Interrupted Best-First random walk after 494509 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen 0
Interrupted Best-First random walk after 529594 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=105 ) properties seen 0
Interrupted Best-First random walk after 598139 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=119 ) properties seen 0
Interrupted Best-First random walk after 549681 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=109 ) properties seen 0
Interrupted Best-First random walk after 590473 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=118 ) properties seen 0
Interrupted Best-First random walk after 634719 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=126 ) properties seen 0
Interrupted Best-First random walk after 636941 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=127 ) properties seen 0
Interrupted probabilistic random walk after 4379484 steps, run timeout after 195001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 4379484 steps, saw 2853031 distinct states, run finished after 195003 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1218 rows 1447 cols
[2022-06-03 17:33:20] [INFO ] Computed 551 place invariants in 3 ms
[2022-06-03 17:33:20] [INFO ] After 380ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-03 17:33:21] [INFO ] [Nat]Absence check using 551 positive place invariants in 89 ms returned sat
[2022-06-03 17:33:22] [INFO ] After 1009ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-06-03 17:33:22] [INFO ] State equation strengthened by 137 read => feed constraints.
[2022-06-03 17:33:23] [INFO ] After 1228ms SMT Verify possible using 137 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-06-03 17:33:24] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2022-06-03 17:33:24] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 1 ms to minimize.
[2022-06-03 17:33:24] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 1 ms to minimize.
[2022-06-03 17:33:25] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2022-06-03 17:33:25] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 1 ms to minimize.
[2022-06-03 17:33:25] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 1 ms to minimize.
[2022-06-03 17:33:25] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2022-06-03 17:33:26] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 0 ms to minimize.
[2022-06-03 17:33:26] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 1 ms to minimize.
[2022-06-03 17:33:26] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 1 ms to minimize.
[2022-06-03 17:33:26] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 1 ms to minimize.
[2022-06-03 17:33:27] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 1 ms to minimize.
[2022-06-03 17:33:27] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 0 ms to minimize.
[2022-06-03 17:33:27] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
[2022-06-03 17:33:27] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 0 ms to minimize.
[2022-06-03 17:33:28] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 0 ms to minimize.
[2022-06-03 17:33:28] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 0 ms to minimize.
[2022-06-03 17:33:28] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 1 ms to minimize.
[2022-06-03 17:33:28] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 0 ms to minimize.
[2022-06-03 17:33:29] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 0 ms to minimize.
[2022-06-03 17:33:29] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 0 ms to minimize.
[2022-06-03 17:33:29] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 0 ms to minimize.
[2022-06-03 17:33:29] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 1 ms to minimize.
[2022-06-03 17:33:29] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 1 ms to minimize.
[2022-06-03 17:33:30] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 0 ms to minimize.
[2022-06-03 17:33:30] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 0 ms to minimize.
[2022-06-03 17:33:30] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 1 ms to minimize.
[2022-06-03 17:33:30] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 0 ms to minimize.
[2022-06-03 17:33:30] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 6930 ms
[2022-06-03 17:33:31] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 0 ms to minimize.
[2022-06-03 17:33:31] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2022-06-03 17:33:31] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 1 ms to minimize.
[2022-06-03 17:33:32] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 1 ms to minimize.
[2022-06-03 17:33:32] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 0 ms to minimize.
[2022-06-03 17:33:32] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 0 ms to minimize.
[2022-06-03 17:33:32] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 0 ms to minimize.
[2022-06-03 17:33:33] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 1 ms to minimize.
[2022-06-03 17:33:33] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 1 ms to minimize.
[2022-06-03 17:33:33] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 0 ms to minimize.
[2022-06-03 17:33:33] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 0 ms to minimize.
[2022-06-03 17:33:34] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 0 ms to minimize.
[2022-06-03 17:33:34] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 0 ms to minimize.
[2022-06-03 17:33:34] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3394 ms
[2022-06-03 17:33:34] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 1 ms to minimize.
[2022-06-03 17:33:35] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 0 ms to minimize.
[2022-06-03 17:33:35] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2022-06-03 17:33:35] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 0 ms to minimize.
[2022-06-03 17:33:35] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 0 ms to minimize.
[2022-06-03 17:33:36] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2022-06-03 17:33:36] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 0 ms to minimize.
[2022-06-03 17:33:36] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 0 ms to minimize.
[2022-06-03 17:33:36] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 1 ms to minimize.
[2022-06-03 17:33:37] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 1 ms to minimize.
[2022-06-03 17:33:37] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 1 ms to minimize.
[2022-06-03 17:33:37] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2882 ms
[2022-06-03 17:33:38] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 1 ms to minimize.
[2022-06-03 17:33:38] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2022-06-03 17:33:38] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 0 ms to minimize.
[2022-06-03 17:33:38] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 1 ms to minimize.
[2022-06-03 17:33:38] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 1 ms to minimize.
[2022-06-03 17:33:39] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 0 ms to minimize.
[2022-06-03 17:33:39] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2022-06-03 17:33:39] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 0 ms to minimize.
[2022-06-03 17:33:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1934 ms
[2022-06-03 17:33:40] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 1 ms to minimize.
[2022-06-03 17:33:40] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 1 ms to minimize.
[2022-06-03 17:33:40] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 1 ms to minimize.
[2022-06-03 17:33:40] [INFO ] Deduced a trap composed of 3 places in 225 ms of which 1 ms to minimize.
[2022-06-03 17:33:41] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2022-06-03 17:33:41] [INFO ] Deduced a trap composed of 3 places in 212 ms of which 0 ms to minimize.
[2022-06-03 17:33:41] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 1 ms to minimize.
[2022-06-03 17:33:42] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 0 ms to minimize.
[2022-06-03 17:33:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2212 ms
[2022-06-03 17:33:42] [INFO ] After 19694ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1613 ms.
[2022-06-03 17:33:43] [INFO ] After 23096ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 8998 ms.
Support contains 151 out of 1447 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1447/1447 places, 1218/1218 transitions.
Applied a total of 0 rules in 33 ms. Remains 1447 /1447 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1447/1447 places, 1218/1218 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1447/1447 places, 1218/1218 transitions.
Applied a total of 0 rules in 37 ms. Remains 1447 /1447 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
// Phase 1: matrix 1218 rows 1447 cols
[2022-06-03 17:33:52] [INFO ] Computed 551 place invariants in 7 ms
[2022-06-03 17:33:53] [INFO ] Implicit Places using invariants in 776 ms returned []
// Phase 1: matrix 1218 rows 1447 cols
[2022-06-03 17:33:53] [INFO ] Computed 551 place invariants in 3 ms
[2022-06-03 17:33:54] [INFO ] State equation strengthened by 137 read => feed constraints.
[2022-06-03 17:33:56] [INFO ] Implicit Places using invariants and state equation in 3288 ms returned []
Implicit Place search using SMT with State Equation took 4068 ms to find 0 implicit places.
[2022-06-03 17:33:57] [INFO ] Redundant transitions in 83 ms returned []
// Phase 1: matrix 1218 rows 1447 cols
[2022-06-03 17:33:57] [INFO ] Computed 551 place invariants in 8 ms
[2022-06-03 17:33:57] [INFO ] Dead Transitions using invariants and state equation in 653 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1447/1447 places, 1218/1218 transitions.
Interrupted random walk after 722236 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen 0
Interrupted Best-First random walk after 366636 steps, including 1 resets, run timeout after 5009 ms. (steps per millisecond=73 ) properties seen 0
Interrupted Best-First random walk after 478822 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 0
Interrupted Best-First random walk after 531109 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=106 ) properties seen 0
Interrupted Best-First random walk after 508787 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=101 ) properties seen 0
Interrupted Best-First random walk after 479412 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 0
Interrupted Best-First random walk after 490501 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen 0
Interrupted Best-First random walk after 607689 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=121 ) properties seen 0
Interrupted probabilistic random walk after 4405100 steps, run timeout after 195001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 4405100 steps, saw 2868703 distinct states, run finished after 195002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1218 rows 1447 cols
[2022-06-03 17:38:17] [INFO ] Computed 551 place invariants in 3 ms
[2022-06-03 17:38:18] [INFO ] After 330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-03 17:38:18] [INFO ] [Nat]Absence check using 551 positive place invariants in 111 ms returned sat
[2022-06-03 17:38:19] [INFO ] After 1103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-06-03 17:38:19] [INFO ] State equation strengthened by 137 read => feed constraints.
[2022-06-03 17:38:21] [INFO ] After 1301ms SMT Verify possible using 137 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-06-03 17:38:21] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2022-06-03 17:38:21] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 1 ms to minimize.
[2022-06-03 17:38:22] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 0 ms to minimize.
[2022-06-03 17:38:22] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 1 ms to minimize.
[2022-06-03 17:38:22] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 0 ms to minimize.
[2022-06-03 17:38:22] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
[2022-06-03 17:38:23] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2022-06-03 17:38:23] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 1 ms to minimize.
[2022-06-03 17:38:23] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 1 ms to minimize.
[2022-06-03 17:38:23] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 0 ms to minimize.
[2022-06-03 17:38:24] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 1 ms to minimize.
[2022-06-03 17:38:24] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 1 ms to minimize.
[2022-06-03 17:38:24] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 0 ms to minimize.
[2022-06-03 17:38:24] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 0 ms to minimize.
[2022-06-03 17:38:24] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 0 ms to minimize.
[2022-06-03 17:38:25] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2022-06-03 17:38:25] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 1 ms to minimize.
[2022-06-03 17:38:25] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 0 ms to minimize.
[2022-06-03 17:38:25] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 1 ms to minimize.
[2022-06-03 17:38:26] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 0 ms to minimize.
[2022-06-03 17:38:26] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2022-06-03 17:38:26] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 0 ms to minimize.
[2022-06-03 17:38:26] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 0 ms to minimize.
[2022-06-03 17:38:27] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 1 ms to minimize.
[2022-06-03 17:38:27] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 0 ms to minimize.
[2022-06-03 17:38:27] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 0 ms to minimize.
[2022-06-03 17:38:27] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 1 ms to minimize.
[2022-06-03 17:38:27] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2022-06-03 17:38:27] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 6470 ms
[2022-06-03 17:38:28] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 0 ms to minimize.
[2022-06-03 17:38:28] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2022-06-03 17:38:28] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 1 ms to minimize.
[2022-06-03 17:38:29] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 1 ms to minimize.
[2022-06-03 17:38:29] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 1 ms to minimize.
[2022-06-03 17:38:29] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 1 ms to minimize.
[2022-06-03 17:38:29] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 0 ms to minimize.
[2022-06-03 17:38:30] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 1 ms to minimize.
[2022-06-03 17:38:30] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 1 ms to minimize.
[2022-06-03 17:38:30] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 1 ms to minimize.
[2022-06-03 17:38:30] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2022-06-03 17:38:31] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 1 ms to minimize.
[2022-06-03 17:38:31] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 1 ms to minimize.
[2022-06-03 17:38:31] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3231 ms
[2022-06-03 17:38:31] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 1 ms to minimize.
[2022-06-03 17:38:31] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 1 ms to minimize.
[2022-06-03 17:38:32] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2022-06-03 17:38:32] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 0 ms to minimize.
[2022-06-03 17:38:32] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 1 ms to minimize.
[2022-06-03 17:38:32] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2022-06-03 17:38:33] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 1 ms to minimize.
[2022-06-03 17:38:33] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 0 ms to minimize.
[2022-06-03 17:38:33] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 1 ms to minimize.
[2022-06-03 17:38:33] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 0 ms to minimize.
[2022-06-03 17:38:34] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 1 ms to minimize.
[2022-06-03 17:38:34] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2827 ms
[2022-06-03 17:38:34] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 1 ms to minimize.
[2022-06-03 17:38:35] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 4 ms to minimize.
[2022-06-03 17:38:35] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 0 ms to minimize.
[2022-06-03 17:38:35] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 0 ms to minimize.
[2022-06-03 17:38:35] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 0 ms to minimize.
[2022-06-03 17:38:35] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 1 ms to minimize.
[2022-06-03 17:38:36] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2022-06-03 17:38:36] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2022-06-03 17:38:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1937 ms
[2022-06-03 17:38:36] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2022-06-03 17:38:37] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 1 ms to minimize.
[2022-06-03 17:38:37] [INFO ] Deduced a trap composed of 3 places in 211 ms of which 0 ms to minimize.
[2022-06-03 17:38:37] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 0 ms to minimize.
[2022-06-03 17:38:37] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 0 ms to minimize.
[2022-06-03 17:38:38] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 1 ms to minimize.
[2022-06-03 17:38:38] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 1 ms to minimize.
[2022-06-03 17:38:38] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 1 ms to minimize.
[2022-06-03 17:38:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2156 ms
[2022-06-03 17:38:38] [INFO ] After 19010ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1725 ms.
[2022-06-03 17:38:40] [INFO ] After 22512ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 13423 ms.
Support contains 151 out of 1447 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1447/1447 places, 1218/1218 transitions.
Applied a total of 0 rules in 40 ms. Remains 1447 /1447 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1447/1447 places, 1218/1218 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1447/1447 places, 1218/1218 transitions.
Applied a total of 0 rules in 39 ms. Remains 1447 /1447 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
// Phase 1: matrix 1218 rows 1447 cols
[2022-06-03 17:38:54] [INFO ] Computed 551 place invariants in 9 ms
[2022-06-03 17:38:54] [INFO ] Implicit Places using invariants in 777 ms returned []
// Phase 1: matrix 1218 rows 1447 cols
[2022-06-03 17:38:54] [INFO ] Computed 551 place invariants in 9 ms
[2022-06-03 17:38:55] [INFO ] State equation strengthened by 137 read => feed constraints.
[2022-06-03 17:38:58] [INFO ] Implicit Places using invariants and state equation in 3134 ms returned []
Implicit Place search using SMT with State Equation took 3923 ms to find 0 implicit places.
[2022-06-03 17:38:58] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 1218 rows 1447 cols
[2022-06-03 17:38:58] [INFO ] Computed 551 place invariants in 6 ms
[2022-06-03 17:38:58] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1447/1447 places, 1218/1218 transitions.
Partial Free-agglomeration rule applied 229 times.
Drop transitions removed 229 transitions
Iterating global reduction 0 with 229 rules applied. Total rules applied 229 place count 1447 transition count 1218
Applied a total of 229 rules in 86 ms. Remains 1447 /1447 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 1218 rows 1447 cols
[2022-06-03 17:38:58] [INFO ] Computed 551 place invariants in 2 ms
[2022-06-03 17:38:59] [INFO ] After 353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-03 17:38:59] [INFO ] [Nat]Absence check using 551 positive place invariants in 102 ms returned sat
[2022-06-03 17:39:00] [INFO ] After 1119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-06-03 17:39:00] [INFO ] State equation strengthened by 196 read => feed constraints.
[2022-06-03 17:39:02] [INFO ] After 1307ms SMT Verify possible using 196 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-06-03 17:39:02] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 0 ms to minimize.
[2022-06-03 17:39:02] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 0 ms to minimize.
[2022-06-03 17:39:03] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 1 ms to minimize.
[2022-06-03 17:39:03] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 0 ms to minimize.
[2022-06-03 17:39:03] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 0 ms to minimize.
[2022-06-03 17:39:04] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 0 ms to minimize.
[2022-06-03 17:39:04] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 1 ms to minimize.
[2022-06-03 17:39:04] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2022-06-03 17:39:04] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 1 ms to minimize.
[2022-06-03 17:39:05] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 0 ms to minimize.
[2022-06-03 17:39:05] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 0 ms to minimize.
[2022-06-03 17:39:05] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
[2022-06-03 17:39:05] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2022-06-03 17:39:06] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 1 ms to minimize.
[2022-06-03 17:39:06] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 1 ms to minimize.
[2022-06-03 17:39:06] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 1 ms to minimize.
[2022-06-03 17:39:06] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 0 ms to minimize.
[2022-06-03 17:39:07] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 0 ms to minimize.
[2022-06-03 17:39:07] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 1 ms to minimize.
[2022-06-03 17:39:07] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 1 ms to minimize.
[2022-06-03 17:39:07] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 1 ms to minimize.
[2022-06-03 17:39:08] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 0 ms to minimize.
[2022-06-03 17:39:08] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 1 ms to minimize.
[2022-06-03 17:39:08] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 1 ms to minimize.
[2022-06-03 17:39:08] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 0 ms to minimize.
[2022-06-03 17:39:09] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2022-06-03 17:39:09] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2022-06-03 17:39:09] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 1 ms to minimize.
[2022-06-03 17:39:09] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2022-06-03 17:39:09] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 1 ms to minimize.
[2022-06-03 17:39:10] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 0 ms to minimize.
[2022-06-03 17:39:10] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 1 ms to minimize.
[2022-06-03 17:39:10] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 0 ms to minimize.
[2022-06-03 17:39:10] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 0 ms to minimize.
[2022-06-03 17:39:10] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 8412 ms
[2022-06-03 17:39:11] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 1 ms to minimize.
[2022-06-03 17:39:11] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 1 ms to minimize.
[2022-06-03 17:39:11] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 0 ms to minimize.
[2022-06-03 17:39:11] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 1 ms to minimize.
[2022-06-03 17:39:12] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2022-06-03 17:39:12] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
[2022-06-03 17:39:12] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 1 ms to minimize.
[2022-06-03 17:39:12] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 1 ms to minimize.
[2022-06-03 17:39:12] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 1 ms to minimize.
[2022-06-03 17:39:13] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 0 ms to minimize.
[2022-06-03 17:39:13] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2022-06-03 17:39:13] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 1 ms to minimize.
[2022-06-03 17:39:13] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2022-06-03 17:39:14] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 1 ms to minimize.
[2022-06-03 17:39:14] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2022-06-03 17:39:14] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2022-06-03 17:39:14] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 0 ms to minimize.
[2022-06-03 17:39:14] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 1 ms to minimize.
[2022-06-03 17:39:15] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 0 ms to minimize.
[2022-06-03 17:39:15] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4224 ms
[2022-06-03 17:39:15] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
[2022-06-03 17:39:15] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 0 ms to minimize.
[2022-06-03 17:39:15] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 1 ms to minimize.
[2022-06-03 17:39:16] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 0 ms to minimize.
[2022-06-03 17:39:16] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 0 ms to minimize.
[2022-06-03 17:39:16] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 1 ms to minimize.
[2022-06-03 17:39:16] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 0 ms to minimize.
[2022-06-03 17:39:16] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 0 ms to minimize.
[2022-06-03 17:39:17] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 0 ms to minimize.
[2022-06-03 17:39:17] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2022-06-03 17:39:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2114 ms
[2022-06-03 17:39:18] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 0 ms to minimize.
[2022-06-03 17:39:19] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 0 ms to minimize.
[2022-06-03 17:39:19] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 1 ms to minimize.
[2022-06-03 17:39:19] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 1 ms to minimize.
[2022-06-03 17:39:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1279 ms
[2022-06-03 17:39:20] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 1 ms to minimize.
[2022-06-03 17:39:20] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 0 ms to minimize.
[2022-06-03 17:39:20] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 0 ms to minimize.
[2022-06-03 17:39:21] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 1 ms to minimize.
[2022-06-03 17:39:21] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 0 ms to minimize.
[2022-06-03 17:39:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1532 ms
[2022-06-03 17:39:21] [INFO ] Deduced a trap composed of 3 places in 230 ms of which 1 ms to minimize.
[2022-06-03 17:39:22] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 1 ms to minimize.
[2022-06-03 17:39:22] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 1 ms to minimize.
[2022-06-03 17:39:22] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 1 ms to minimize.
[2022-06-03 17:39:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1180 ms
[2022-06-03 17:39:22] [INFO ] After 21849ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1419 ms.
[2022-06-03 17:39:24] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2022-06-03 17:39:24] [INFO ] Flatten gal took : 143 ms
[2022-06-03 17:39:24] [INFO ] Flatten gal took : 81 ms
[2022-06-03 17:39:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2100451233384619065.gal : 35 ms
[2022-06-03 17:39:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1067668012192874516.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/ReachabilityCardinality2100451233384619065.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1067668012192874516.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality1067668012192874516.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 11
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :11 after 26
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :26 after 29
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :29 after 83
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :83 after 139970
Detected timeout of ITS tools.
[2022-06-03 17:39:39] [INFO ] Flatten gal took : 95 ms
[2022-06-03 17:39:39] [INFO ] Applying decomposition
[2022-06-03 17:39:39] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6028270906495670472.txt' '-o' '/tmp/graph6028270906495670472.bin' '-w' '/tmp/graph6028270906495670472.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6028270906495670472.bin' '-l' '-1' '-v' '-w' '/tmp/graph6028270906495670472.weights' '-q' '0' '-e' '0.001'
[2022-06-03 17:39:40] [INFO ] Decomposing Gal with order
[2022-06-03 17:39:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 17:39:40] [INFO ] Removed a total of 329 redundant transitions.
[2022-06-03 17:39:40] [INFO ] Flatten gal took : 143 ms
[2022-06-03 17:39:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 192 labels/synchronizations in 21 ms.
[2022-06-03 17:39:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9464537597257102925.gal : 15 ms
[2022-06-03 17:39:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1868255186257243877.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/ReachabilityCardinality9464537597257102925.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1868255186257243877.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
Loading property file /tmp/ReachabilityCardinality1868255186257243877.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :12 after 116
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :116 after 116
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :116 after 116
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :116 after 116
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :116 after 116
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :116 after 2.96288e+09
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :2.96288e+09 after 8.89722e+22
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3308046246287607069
[2022-06-03 17:39:55] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3308046246287607069
Running compilation step : cd /tmp/ltsmin3308046246287607069;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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'
Compilation finished in 2430 ms.
Running link step : cd /tmp/ltsmin3308046246287607069;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 233 ms.
Running LTSmin : cd /tmp/ltsmin3308046246287607069;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldPPPtPT050BReachabilityFireability01==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 17:40:10] [INFO ] Flatten gal took : 88 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1677214366626431024
[2022-06-03 17:40:10] [INFO ] Computing symmetric may disable matrix : 1218 transitions.
[2022-06-03 17:40:10] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 17:40:10] [INFO ] Computing symmetric may enable matrix : 1218 transitions.
[2022-06-03 17:40:10] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 17:40:10] [INFO ] Applying decomposition
[2022-06-03 17:40:10] [INFO ] Flatten gal took : 87 ms
[2022-06-03 17:40:10] [INFO ] Flatten gal took : 88 ms
[2022-06-03 17:40:11] [INFO ] Input system was already deterministic with 1218 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/graph4975709241039691387.txt' '-o' '/tmp/graph4975709241039691387.bin' '-w' '/tmp/graph4975709241039691387.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4975709241039691387.bin' '-l' '-1' '-v' '-w' '/tmp/graph4975709241039691387.weights' '-q' '0' '-e' '0.001'
[2022-06-03 17:40:11] [INFO ] Computing Do-Not-Accords matrix : 1218 transitions.
[2022-06-03 17:40:11] [INFO ] Decomposing Gal with order
[2022-06-03 17:40:11] [INFO ] Computation of Completed DNA matrix. took 67 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 17:40:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 17:40:11] [INFO ] Built C files in 460ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1677214366626431024
Running compilation step : cd /tmp/ltsmin1677214366626431024;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '102' '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:40:11] [INFO ] Removed a total of 622 redundant transitions.
[2022-06-03 17:40:11] [INFO ] Flatten gal took : 97 ms
[2022-06-03 17:40:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 272 labels/synchronizations in 40 ms.
[2022-06-03 17:40:11] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9352585125631581749.gal : 26 ms
[2022-06-03 17:40:11] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5024789638629384426.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/ReachabilityFireability9352585125631581749.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5024789638629384426.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
[2022-06-03 17:40:11] [INFO ] Ran tautology test, simplified 0 / 7 in 811 ms.
[2022-06-03 17:40:11] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-01(UNSAT) depth K=0 took 45 ms
[2022-06-03 17:40:11] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-03(UNSAT) depth K=0 took 1 ms
[2022-06-03 17:40:11] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-05(UNSAT) depth K=0 took 0 ms
[2022-06-03 17:40:11] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-07(UNSAT) depth K=0 took 0 ms
[2022-06-03 17:40:11] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-09(UNSAT) depth K=0 took 1 ms
[2022-06-03 17:40:11] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-12(UNSAT) depth K=0 took 0 ms
[2022-06-03 17:40:11] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-14(UNSAT) depth K=0 took 0 ms
[2022-06-03 17:40:11] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-01(UNSAT) depth K=1 took 23 ms
[2022-06-03 17:40:11] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-03(UNSAT) depth K=1 took 10 ms
[2022-06-03 17:40:11] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-05(UNSAT) depth K=1 took 13 ms
Loading property file /tmp/ReachabilityFireability5024789638629384426.prop.
[2022-06-03 17:40:11] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-07(UNSAT) depth K=1 took 14 ms
[2022-06-03 17:40:12] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-09(UNSAT) depth K=1 took 10 ms
[2022-06-03 17:40:12] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-12(UNSAT) depth K=1 took 9 ms
[2022-06-03 17:40:12] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-14(UNSAT) depth K=1 took 13 ms
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :2 after 12
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :12 after 116
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 1218 rows 1447 cols
[2022-06-03 17:40:12] [INFO ] Computed 551 place invariants in 3 ms
[2022-06-03 17:40:12] [INFO ] Computed 551 place invariants in 4 ms
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :116 after 332
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :332 after 559880
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :559880 after 2.23994e+12
[2022-06-03 17:40:14] [INFO ] Proved 1447 variables to be positive in 2045 ms
[2022-06-03 17:40:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-01
[2022-06-03 17:40:15] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-01(SAT) depth K=0 took 1390 ms
Compilation finished in 4962 ms.
Running link step : cd /tmp/ltsmin1677214366626431024;'gcc' '-shared' '-o' 'gal.so' 'model.o'
[2022-06-03 17:40:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-03
[2022-06-03 17:40:16] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-03(SAT) depth K=0 took 458 ms
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin1677214366626431024;'/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' 'ShieldPPPtPT050BReachabilityFireability01==true'
[2022-06-03 17:40:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-05
[2022-06-03 17:40:17] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-05(SAT) depth K=0 took 1145 ms
[2022-06-03 17:40:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-07
[2022-06-03 17:40:18] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-07(SAT) depth K=0 took 950 ms
[2022-06-03 17:40:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-09
[2022-06-03 17:40:20] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-09(SAT) depth K=0 took 1600 ms
[2022-06-03 17:40:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-12
[2022-06-03 17:40:21] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-12(SAT) depth K=0 took 1802 ms
[2022-06-03 17:40:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-14
[2022-06-03 17:40:24] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-14(SAT) depth K=0 took 3033 ms
[2022-06-03 17:40:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-01
[2022-06-03 17:40:30] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-01(SAT) depth K=1 took 5469 ms
[2022-06-03 17:40:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-03
[2022-06-03 17:40:32] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-03(SAT) depth K=1 took 1920 ms
[2022-06-03 17:40:34] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-05
[2022-06-03 17:40:34] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-05(SAT) depth K=1 took 2051 ms
[2022-06-03 17:40:34] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-01(UNSAT) depth K=2 took 22482 ms
[2022-06-03 17:40:36] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-07
[2022-06-03 17:40:36] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-07(SAT) depth K=1 took 2027 ms
[2022-06-03 17:40:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-09
[2022-06-03 17:40:38] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-09(SAT) depth K=1 took 1847 ms
[2022-06-03 17:40:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-12
[2022-06-03 17:40:40] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-12(SAT) depth K=1 took 1928 ms
[2022-06-03 17:40:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-14
[2022-06-03 17:40:41] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-14(SAT) depth K=1 took 1224 ms
[2022-06-03 17:41:31] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-03(UNSAT) depth K=2 took 57111 ms
[2022-06-03 17:42:08] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-05(UNSAT) depth K=2 took 36383 ms
[2022-06-03 17:43:04] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-07(UNSAT) depth K=2 took 56185 ms
[2022-06-03 17:43:40] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-09(UNSAT) depth K=2 took 36157 ms
[2022-06-03 17:44:36] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-12(UNSAT) depth K=2 took 55733 ms
[2022-06-03 17:45:04] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-01
[2022-06-03 17:45:04] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-01(SAT) depth K=2 took 263389 ms
[2022-06-03 17:45:33] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-14(UNSAT) depth K=2 took 57333 ms
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin1677214366626431024;'/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' 'ShieldPPPtPT050BReachabilityFireability01==true'
Running LTSmin : cd /tmp/ltsmin1677214366626431024;'/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' 'ShieldPPPtPT050BReachabilityFireability03==true'
[2022-06-03 17:55:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-03
[2022-06-03 17:55:40] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-03(SAT) depth K=2 took 635447 ms

BK_STOP 1654279006738

--------------------
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="ShieldPPPt-PT-050B"
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 ShieldPPPt-PT-050B, 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 r222-tall-165286025600687"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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