Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r216-tall-162098205800906.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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-040B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205800906
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 166K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 12:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 12:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 18:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 18:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 762K May 5 16:52 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-040B-00
FORMULA_NAME ShieldPPPt-PT-040B-01
FORMULA_NAME ShieldPPPt-PT-040B-02
FORMULA_NAME ShieldPPPt-PT-040B-03
FORMULA_NAME ShieldPPPt-PT-040B-04
FORMULA_NAME ShieldPPPt-PT-040B-05
FORMULA_NAME ShieldPPPt-PT-040B-06
FORMULA_NAME ShieldPPPt-PT-040B-07
FORMULA_NAME ShieldPPPt-PT-040B-08
FORMULA_NAME ShieldPPPt-PT-040B-09
FORMULA_NAME ShieldPPPt-PT-040B-10
FORMULA_NAME ShieldPPPt-PT-040B-11
FORMULA_NAME ShieldPPPt-PT-040B-12
FORMULA_NAME ShieldPPPt-PT-040B-13
FORMULA_NAME ShieldPPPt-PT-040B-14
FORMULA_NAME ShieldPPPt-PT-040B-15

=== Now, execution of the tool begins

BK_START 1622944689301

Running Version 0
[2021-06-06 01:58:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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]
[2021-06-06 01:58:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 01:58:11] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2021-06-06 01:58:11] [INFO ] Transformed 3123 places.
[2021-06-06 01:58:11] [INFO ] Transformed 2843 transitions.
[2021-06-06 01:58:11] [INFO ] Found NUPN structural information;
[2021-06-06 01:58:11] [INFO ] Parsed PT model containing 3123 places and 2843 transitions in 326 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-06-06 01:58:11] [INFO ] Initial state test concluded for 3 properties.
FORMULA ShieldPPPt-PT-040B-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 3123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Discarding 436 places :
Symmetric choice reduction at 0 with 436 rule applications. Total rules 436 place count 2687 transition count 2407
Iterating global reduction 0 with 436 rules applied. Total rules applied 872 place count 2687 transition count 2407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 873 place count 2686 transition count 2406
Iterating global reduction 0 with 1 rules applied. Total rules applied 874 place count 2686 transition count 2406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 875 place count 2685 transition count 2405
Iterating global reduction 0 with 1 rules applied. Total rules applied 876 place count 2685 transition count 2405
Applied a total of 876 rules in 1296 ms. Remains 2685 /3123 variables (removed 438) and now considering 2405/2843 (removed 438) transitions.
// Phase 1: matrix 2405 rows 2685 cols
[2021-06-06 01:58:13] [INFO ] Computed 441 place invariants in 34 ms
[2021-06-06 01:58:14] [INFO ] Implicit Places using invariants in 1301 ms returned []
// Phase 1: matrix 2405 rows 2685 cols
[2021-06-06 01:58:14] [INFO ] Computed 441 place invariants in 12 ms
[2021-06-06 01:58:16] [INFO ] Implicit Places using invariants and state equation in 2533 ms returned []
Implicit Place search using SMT with State Equation took 3875 ms to find 0 implicit places.
// Phase 1: matrix 2405 rows 2685 cols
[2021-06-06 01:58:16] [INFO ] Computed 441 place invariants in 13 ms
[2021-06-06 01:58:18] [INFO ] Dead Transitions using invariants and state equation in 1456 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2685/3123 places, 2405/2843 transitions.
[2021-06-06 01:58:18] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-06-06 01:58:18] [INFO ] Flatten gal took : 218 ms
FORMULA ShieldPPPt-PT-040B-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-06 01:58:18] [INFO ] Flatten gal took : 125 ms
[2021-06-06 01:58:19] [INFO ] Input system was already deterministic with 2405 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 766 ms. (steps per millisecond=130 ) properties (out of 25) seen :15
Running SMT prover for 10 properties.
// Phase 1: matrix 2405 rows 2685 cols
[2021-06-06 01:58:19] [INFO ] Computed 441 place invariants in 17 ms
[2021-06-06 01:58:20] [INFO ] [Real]Absence check using 441 positive place invariants in 166 ms returned sat
[2021-06-06 01:58:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 01:58:21] [INFO ] [Real]Absence check using state equation in 1144 ms returned sat
[2021-06-06 01:58:22] [INFO ] Deduced a trap composed of 16 places in 552 ms of which 6 ms to minimize.
[2021-06-06 01:58:22] [INFO ] Deduced a trap composed of 18 places in 518 ms of which 2 ms to minimize.
[2021-06-06 01:58:23] [INFO ] Deduced a trap composed of 23 places in 487 ms of which 2 ms to minimize.
[2021-06-06 01:58:24] [INFO ] Deduced a trap composed of 17 places in 445 ms of which 2 ms to minimize.
[2021-06-06 01:58:24] [INFO ] Deduced a trap composed of 21 places in 438 ms of which 2 ms to minimize.
[2021-06-06 01:58:25] [INFO ] Deduced a trap composed of 19 places in 529 ms of which 1 ms to minimize.
[2021-06-06 01:58:25] [INFO ] Deduced a trap composed of 27 places in 429 ms of which 1 ms to minimize.
[2021-06-06 01:58:26] [INFO ] Deduced a trap composed of 25 places in 441 ms of which 2 ms to minimize.
[2021-06-06 01:58:26] [INFO ] Deduced a trap composed of 26 places in 407 ms of which 1 ms to minimize.
[2021-06-06 01:58:27] [INFO ] Deduced a trap composed of 26 places in 395 ms of which 1 ms to minimize.
[2021-06-06 01:58:27] [INFO ] Deduced a trap composed of 18 places in 416 ms of which 1 ms to minimize.
[2021-06-06 01:58:28] [INFO ] Deduced a trap composed of 23 places in 381 ms of which 1 ms to minimize.
[2021-06-06 01:58:28] [INFO ] Deduced a trap composed of 25 places in 394 ms of which 1 ms to minimize.
[2021-06-06 01:58:29] [INFO ] Deduced a trap composed of 27 places in 378 ms of which 1 ms to minimize.
[2021-06-06 01:58:29] [INFO ] Deduced a trap composed of 26 places in 382 ms of which 1 ms to minimize.
[2021-06-06 01:58:30] [INFO ] Deduced a trap composed of 17 places in 350 ms of which 1 ms to minimize.
[2021-06-06 01:58:30] [INFO ] Deduced a trap composed of 28 places in 347 ms of which 1 ms to minimize.
[2021-06-06 01:58:31] [INFO ] Deduced a trap composed of 25 places in 336 ms of which 1 ms to minimize.
[2021-06-06 01:58:31] [INFO ] Deduced a trap composed of 44 places in 343 ms of which 1 ms to minimize.
[2021-06-06 01:58:31] [INFO ] Deduced a trap composed of 38 places in 329 ms of which 1 ms to minimize.
[2021-06-06 01:58:32] [INFO ] Deduced a trap composed of 30 places in 319 ms of which 1 ms to minimize.
[2021-06-06 01:58:32] [INFO ] Deduced a trap composed of 30 places in 361 ms of which 1 ms to minimize.
[2021-06-06 01:58:33] [INFO ] Deduced a trap composed of 25 places in 322 ms of which 1 ms to minimize.
[2021-06-06 01:58:33] [INFO ] Deduced a trap composed of 25 places in 322 ms of which 1 ms to minimize.
[2021-06-06 01:58:34] [INFO ] Deduced a trap composed of 31 places in 312 ms of which 1 ms to minimize.
[2021-06-06 01:58:34] [INFO ] Deduced a trap composed of 26 places in 303 ms of which 1 ms to minimize.
[2021-06-06 01:58:34] [INFO ] Deduced a trap composed of 40 places in 286 ms of which 1 ms to minimize.
[2021-06-06 01:58:35] [INFO ] Deduced a trap composed of 35 places in 286 ms of which 1 ms to minimize.
[2021-06-06 01:58:35] [INFO ] Deduced a trap composed of 35 places in 309 ms of which 1 ms to minimize.
[2021-06-06 01:58:35] [INFO ] Deduced a trap composed of 35 places in 265 ms of which 1 ms to minimize.
[2021-06-06 01:58:36] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 0 ms to minimize.
[2021-06-06 01:58:36] [INFO ] Deduced a trap composed of 37 places in 251 ms of which 1 ms to minimize.
[2021-06-06 01:58:36] [INFO ] Deduced a trap composed of 48 places in 244 ms of which 1 ms to minimize.
[2021-06-06 01:58:37] [INFO ] Deduced a trap composed of 39 places in 246 ms of which 6 ms to minimize.
[2021-06-06 01:58:37] [INFO ] Deduced a trap composed of 47 places in 242 ms of which 0 ms to minimize.
[2021-06-06 01:58:37] [INFO ] Deduced a trap composed of 43 places in 239 ms of which 1 ms to minimize.
[2021-06-06 01:58:38] [INFO ] Deduced a trap composed of 38 places in 266 ms of which 1 ms to minimize.
[2021-06-06 01:58:38] [INFO ] Deduced a trap composed of 45 places in 229 ms of which 1 ms to minimize.
[2021-06-06 01:58:38] [INFO ] Deduced a trap composed of 49 places in 225 ms of which 1 ms to minimize.
[2021-06-06 01:58:39] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 2 ms to minimize.
[2021-06-06 01:58:39] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 1 ms to minimize.
[2021-06-06 01:58:39] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 0 ms to minimize.
[2021-06-06 01:58:41] [INFO ] Deduced a trap composed of 14 places in 1386 ms of which 9 ms to minimize.
[2021-06-06 01:58:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-06-06 01:58:41] [INFO ] [Real]Absence check using 441 positive place invariants in 137 ms returned sat
[2021-06-06 01:58:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 01:58:42] [INFO ] [Real]Absence check using state equation in 1113 ms returned sat
[2021-06-06 01:58:42] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 01:58:43] [INFO ] [Nat]Absence check using 441 positive place invariants in 149 ms returned sat
[2021-06-06 01:58:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 01:58:44] [INFO ] [Nat]Absence check using state equation in 1107 ms returned sat
[2021-06-06 01:58:44] [INFO ] Deduced a trap composed of 19 places in 477 ms of which 1 ms to minimize.
[2021-06-06 01:58:45] [INFO ] Deduced a trap composed of 17 places in 496 ms of which 1 ms to minimize.
[2021-06-06 01:58:46] [INFO ] Deduced a trap composed of 35 places in 477 ms of which 1 ms to minimize.
[2021-06-06 01:58:46] [INFO ] Deduced a trap composed of 36 places in 502 ms of which 2 ms to minimize.
[2021-06-06 01:58:47] [INFO ] Deduced a trap composed of 16 places in 466 ms of which 2 ms to minimize.
[2021-06-06 01:58:47] [INFO ] Deduced a trap composed of 18 places in 441 ms of which 2 ms to minimize.
[2021-06-06 01:58:48] [INFO ] Deduced a trap composed of 16 places in 495 ms of which 1 ms to minimize.
[2021-06-06 01:58:48] [INFO ] Deduced a trap composed of 21 places in 484 ms of which 3 ms to minimize.
[2021-06-06 01:58:49] [INFO ] Deduced a trap composed of 22 places in 457 ms of which 1 ms to minimize.
[2021-06-06 01:58:50] [INFO ] Deduced a trap composed of 25 places in 459 ms of which 1 ms to minimize.
[2021-06-06 01:58:50] [INFO ] Deduced a trap composed of 19 places in 472 ms of which 1 ms to minimize.
[2021-06-06 01:58:51] [INFO ] Deduced a trap composed of 19 places in 422 ms of which 1 ms to minimize.
[2021-06-06 01:58:51] [INFO ] Deduced a trap composed of 28 places in 459 ms of which 6 ms to minimize.
[2021-06-06 01:58:52] [INFO ] Deduced a trap composed of 25 places in 430 ms of which 1 ms to minimize.
[2021-06-06 01:58:52] [INFO ] Deduced a trap composed of 27 places in 442 ms of which 1 ms to minimize.
[2021-06-06 01:58:53] [INFO ] Deduced a trap composed of 34 places in 405 ms of which 5 ms to minimize.
[2021-06-06 01:58:53] [INFO ] Deduced a trap composed of 31 places in 412 ms of which 1 ms to minimize.
[2021-06-06 01:58:54] [INFO ] Deduced a trap composed of 27 places in 376 ms of which 1 ms to minimize.
[2021-06-06 01:58:54] [INFO ] Deduced a trap composed of 30 places in 388 ms of which 1 ms to minimize.
[2021-06-06 01:58:55] [INFO ] Deduced a trap composed of 26 places in 375 ms of which 1 ms to minimize.
[2021-06-06 01:58:55] [INFO ] Deduced a trap composed of 27 places in 374 ms of which 1 ms to minimize.
[2021-06-06 01:58:56] [INFO ] Deduced a trap composed of 35 places in 371 ms of which 1 ms to minimize.
[2021-06-06 01:58:56] [INFO ] Deduced a trap composed of 24 places in 359 ms of which 3 ms to minimize.
[2021-06-06 01:58:56] [INFO ] Deduced a trap composed of 37 places in 350 ms of which 2 ms to minimize.
[2021-06-06 01:58:57] [INFO ] Deduced a trap composed of 26 places in 345 ms of which 1 ms to minimize.
[2021-06-06 01:58:57] [INFO ] Deduced a trap composed of 41 places in 341 ms of which 1 ms to minimize.
[2021-06-06 01:58:58] [INFO ] Deduced a trap composed of 38 places in 328 ms of which 1 ms to minimize.
[2021-06-06 01:58:58] [INFO ] Deduced a trap composed of 41 places in 327 ms of which 1 ms to minimize.
[2021-06-06 01:58:58] [INFO ] Deduced a trap composed of 42 places in 325 ms of which 1 ms to minimize.
[2021-06-06 01:58:59] [INFO ] Deduced a trap composed of 28 places in 318 ms of which 1 ms to minimize.
[2021-06-06 01:58:59] [INFO ] Deduced a trap composed of 27 places in 312 ms of which 1 ms to minimize.
[2021-06-06 01:59:00] [INFO ] Deduced a trap composed of 37 places in 298 ms of which 1 ms to minimize.
[2021-06-06 01:59:00] [INFO ] Deduced a trap composed of 41 places in 284 ms of which 1 ms to minimize.
[2021-06-06 01:59:00] [INFO ] Deduced a trap composed of 37 places in 283 ms of which 0 ms to minimize.
[2021-06-06 01:59:01] [INFO ] Deduced a trap composed of 35 places in 295 ms of which 8 ms to minimize.
[2021-06-06 01:59:01] [INFO ] Deduced a trap composed of 40 places in 250 ms of which 1 ms to minimize.
[2021-06-06 01:59:01] [INFO ] Deduced a trap composed of 45 places in 242 ms of which 0 ms to minimize.
[2021-06-06 01:59:02] [INFO ] Deduced a trap composed of 45 places in 238 ms of which 1 ms to minimize.
[2021-06-06 01:59:02] [INFO ] Deduced a trap composed of 42 places in 237 ms of which 0 ms to minimize.
[2021-06-06 01:59:02] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 1 ms to minimize.
[2021-06-06 01:59:04] [INFO ] Deduced a trap composed of 14 places in 1407 ms of which 9 ms to minimize.
[2021-06-06 01:59:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-06-06 01:59:04] [INFO ] [Real]Absence check using 441 positive place invariants in 164 ms returned sat
[2021-06-06 01:59:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 01:59:05] [INFO ] [Real]Absence check using state equation in 1092 ms returned sat
[2021-06-06 01:59:05] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 01:59:06] [INFO ] [Nat]Absence check using 441 positive place invariants in 142 ms returned sat
[2021-06-06 01:59:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 01:59:07] [INFO ] [Nat]Absence check using state equation in 1055 ms returned sat
[2021-06-06 01:59:07] [INFO ] Deduced a trap composed of 18 places in 511 ms of which 2 ms to minimize.
[2021-06-06 01:59:08] [INFO ] Deduced a trap composed of 33 places in 505 ms of which 1 ms to minimize.
[2021-06-06 01:59:09] [INFO ] Deduced a trap composed of 27 places in 503 ms of which 2 ms to minimize.
[2021-06-06 01:59:09] [INFO ] Deduced a trap composed of 26 places in 498 ms of which 1 ms to minimize.
[2021-06-06 01:59:10] [INFO ] Deduced a trap composed of 30 places in 496 ms of which 2 ms to minimize.
[2021-06-06 01:59:10] [INFO ] Deduced a trap composed of 17 places in 487 ms of which 1 ms to minimize.
[2021-06-06 01:59:11] [INFO ] Deduced a trap composed of 18 places in 492 ms of which 1 ms to minimize.
[2021-06-06 01:59:11] [INFO ] Deduced a trap composed of 24 places in 473 ms of which 1 ms to minimize.
[2021-06-06 01:59:12] [INFO ] Deduced a trap composed of 23 places in 467 ms of which 2 ms to minimize.
[2021-06-06 01:59:13] [INFO ] Deduced a trap composed of 31 places in 465 ms of which 2 ms to minimize.
[2021-06-06 01:59:13] [INFO ] Deduced a trap composed of 21 places in 442 ms of which 1 ms to minimize.
[2021-06-06 01:59:14] [INFO ] Deduced a trap composed of 21 places in 429 ms of which 1 ms to minimize.
[2021-06-06 01:59:14] [INFO ] Deduced a trap composed of 20 places in 432 ms of which 1 ms to minimize.
[2021-06-06 01:59:15] [INFO ] Deduced a trap composed of 25 places in 406 ms of which 1 ms to minimize.
[2021-06-06 01:59:15] [INFO ] Deduced a trap composed of 26 places in 428 ms of which 2 ms to minimize.
[2021-06-06 01:59:16] [INFO ] Deduced a trap composed of 26 places in 402 ms of which 1 ms to minimize.
[2021-06-06 01:59:16] [INFO ] Deduced a trap composed of 29 places in 384 ms of which 1 ms to minimize.
[2021-06-06 01:59:17] [INFO ] Deduced a trap composed of 34 places in 369 ms of which 1 ms to minimize.
[2021-06-06 01:59:17] [INFO ] Deduced a trap composed of 32 places in 365 ms of which 1 ms to minimize.
[2021-06-06 01:59:17] [INFO ] Deduced a trap composed of 32 places in 365 ms of which 1 ms to minimize.
[2021-06-06 01:59:18] [INFO ] Deduced a trap composed of 29 places in 364 ms of which 1 ms to minimize.
[2021-06-06 01:59:18] [INFO ] Deduced a trap composed of 26 places in 370 ms of which 1 ms to minimize.
[2021-06-06 01:59:19] [INFO ] Deduced a trap composed of 36 places in 350 ms of which 1 ms to minimize.
[2021-06-06 01:59:19] [INFO ] Deduced a trap composed of 30 places in 344 ms of which 1 ms to minimize.
[2021-06-06 01:59:20] [INFO ] Deduced a trap composed of 48 places in 369 ms of which 1 ms to minimize.
[2021-06-06 01:59:20] [INFO ] Deduced a trap composed of 46 places in 333 ms of which 1 ms to minimize.
[2021-06-06 01:59:21] [INFO ] Deduced a trap composed of 36 places in 331 ms of which 1 ms to minimize.
[2021-06-06 01:59:21] [INFO ] Deduced a trap composed of 50 places in 327 ms of which 1 ms to minimize.
[2021-06-06 01:59:21] [INFO ] Deduced a trap composed of 42 places in 343 ms of which 1 ms to minimize.
[2021-06-06 01:59:22] [INFO ] Deduced a trap composed of 38 places in 314 ms of which 0 ms to minimize.
[2021-06-06 01:59:22] [INFO ] Deduced a trap composed of 41 places in 310 ms of which 1 ms to minimize.
[2021-06-06 01:59:23] [INFO ] Deduced a trap composed of 39 places in 298 ms of which 1 ms to minimize.
[2021-06-06 01:59:23] [INFO ] Deduced a trap composed of 41 places in 301 ms of which 1 ms to minimize.
[2021-06-06 01:59:23] [INFO ] Deduced a trap composed of 38 places in 302 ms of which 1 ms to minimize.
[2021-06-06 01:59:24] [INFO ] Deduced a trap composed of 35 places in 295 ms of which 1 ms to minimize.
[2021-06-06 01:59:24] [INFO ] Deduced a trap composed of 31 places in 288 ms of which 1 ms to minimize.
[2021-06-06 01:59:24] [INFO ] Deduced a trap composed of 32 places in 279 ms of which 1 ms to minimize.
[2021-06-06 01:59:25] [INFO ] Deduced a trap composed of 42 places in 276 ms of which 1 ms to minimize.
[2021-06-06 01:59:25] [INFO ] Deduced a trap composed of 45 places in 274 ms of which 1 ms to minimize.
[2021-06-06 01:59:25] [INFO ] Deduced a trap composed of 39 places in 275 ms of which 1 ms to minimize.
[2021-06-06 01:59:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-06-06 01:59:26] [INFO ] [Real]Absence check using 441 positive place invariants in 146 ms returned sat
[2021-06-06 01:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 01:59:27] [INFO ] [Real]Absence check using state equation in 1073 ms returned sat
[2021-06-06 01:59:27] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 01:59:27] [INFO ] [Nat]Absence check using 441 positive place invariants in 79 ms returned unsat
[2021-06-06 01:59:28] [INFO ] [Real]Absence check using 441 positive place invariants in 148 ms returned sat
[2021-06-06 01:59:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 01:59:29] [INFO ] [Real]Absence check using state equation in 1069 ms returned sat
[2021-06-06 01:59:29] [INFO ] Deduced a trap composed of 31 places in 459 ms of which 1 ms to minimize.
[2021-06-06 01:59:30] [INFO ] Deduced a trap composed of 19 places in 460 ms of which 1 ms to minimize.
[2021-06-06 01:59:30] [INFO ] Deduced a trap composed of 27 places in 448 ms of which 2 ms to minimize.
[2021-06-06 01:59:31] [INFO ] Deduced a trap composed of 24 places in 444 ms of which 1 ms to minimize.
[2021-06-06 01:59:31] [INFO ] Deduced a trap composed of 17 places in 440 ms of which 1 ms to minimize.
[2021-06-06 01:59:32] [INFO ] Deduced a trap composed of 16 places in 424 ms of which 2 ms to minimize.
[2021-06-06 01:59:32] [INFO ] Deduced a trap composed of 44 places in 413 ms of which 1 ms to minimize.
[2021-06-06 01:59:33] [INFO ] Deduced a trap composed of 32 places in 414 ms of which 1 ms to minimize.
[2021-06-06 01:59:33] [INFO ] Deduced a trap composed of 33 places in 405 ms of which 1 ms to minimize.
[2021-06-06 01:59:34] [INFO ] Deduced a trap composed of 35 places in 392 ms of which 1 ms to minimize.
[2021-06-06 01:59:34] [INFO ] Deduced a trap composed of 31 places in 391 ms of which 1 ms to minimize.
[2021-06-06 01:59:35] [INFO ] Deduced a trap composed of 23 places in 368 ms of which 1 ms to minimize.
[2021-06-06 01:59:35] [INFO ] Deduced a trap composed of 25 places in 361 ms of which 1 ms to minimize.
[2021-06-06 01:59:36] [INFO ] Deduced a trap composed of 26 places in 354 ms of which 1 ms to minimize.
[2021-06-06 01:59:36] [INFO ] Deduced a trap composed of 28 places in 350 ms of which 1 ms to minimize.
[2021-06-06 01:59:37] [INFO ] Deduced a trap composed of 26 places in 334 ms of which 1 ms to minimize.
[2021-06-06 01:59:37] [INFO ] Deduced a trap composed of 20 places in 322 ms of which 1 ms to minimize.
[2021-06-06 01:59:37] [INFO ] Deduced a trap composed of 34 places in 366 ms of which 1 ms to minimize.
[2021-06-06 01:59:38] [INFO ] Deduced a trap composed of 41 places in 315 ms of which 1 ms to minimize.
[2021-06-06 01:59:38] [INFO ] Deduced a trap composed of 24 places in 307 ms of which 1 ms to minimize.
[2021-06-06 01:59:39] [INFO ] Deduced a trap composed of 30 places in 295 ms of which 1 ms to minimize.
[2021-06-06 01:59:39] [INFO ] Deduced a trap composed of 27 places in 299 ms of which 1 ms to minimize.
[2021-06-06 01:59:39] [INFO ] Deduced a trap composed of 36 places in 289 ms of which 1 ms to minimize.
[2021-06-06 01:59:40] [INFO ] Deduced a trap composed of 20 places in 275 ms of which 0 ms to minimize.
[2021-06-06 01:59:40] [INFO ] Deduced a trap composed of 44 places in 297 ms of which 1 ms to minimize.
[2021-06-06 01:59:41] [INFO ] Deduced a trap composed of 44 places in 262 ms of which 1 ms to minimize.
[2021-06-06 01:59:41] [INFO ] Deduced a trap composed of 38 places in 257 ms of which 1 ms to minimize.
[2021-06-06 01:59:41] [INFO ] Deduced a trap composed of 38 places in 255 ms of which 1 ms to minimize.
[2021-06-06 01:59:42] [INFO ] Deduced a trap composed of 51 places in 247 ms of which 0 ms to minimize.
[2021-06-06 01:59:42] [INFO ] Deduced a trap composed of 53 places in 242 ms of which 1 ms to minimize.
[2021-06-06 01:59:42] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 1 ms to minimize.
[2021-06-06 01:59:43] [INFO ] Deduced a trap composed of 42 places in 236 ms of which 0 ms to minimize.
[2021-06-06 01:59:43] [INFO ] Deduced a trap composed of 45 places in 240 ms of which 0 ms to minimize.
[2021-06-06 01:59:43] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 0 ms to minimize.
[2021-06-06 01:59:43] [INFO ] Deduced a trap composed of 37 places in 221 ms of which 0 ms to minimize.
[2021-06-06 01:59:44] [INFO ] Deduced a trap composed of 43 places in 213 ms of which 1 ms to minimize.
[2021-06-06 01:59:44] [INFO ] Deduced a trap composed of 46 places in 204 ms of which 0 ms to minimize.
[2021-06-06 01:59:44] [INFO ] Deduced a trap composed of 47 places in 201 ms of which 1 ms to minimize.
[2021-06-06 01:59:45] [INFO ] Deduced a trap composed of 50 places in 191 ms of which 1 ms to minimize.
[2021-06-06 01:59:45] [INFO ] Deduced a trap composed of 44 places in 201 ms of which 0 ms to minimize.
[2021-06-06 01:59:45] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 0 ms to minimize.
[2021-06-06 01:59:46] [INFO ] Deduced a trap composed of 48 places in 178 ms of which 0 ms to minimize.
[2021-06-06 01:59:46] [INFO ] Deduced a trap composed of 55 places in 183 ms of which 0 ms to minimize.
[2021-06-06 01:59:46] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 0 ms to minimize.
[2021-06-06 01:59:46] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 0 ms to minimize.
[2021-06-06 01:59:47] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 1 ms to minimize.
[2021-06-06 01:59:47] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 0 ms to minimize.
[2021-06-06 01:59:47] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 1 ms to minimize.
[2021-06-06 01:59:47] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 0 ms to minimize.
[2021-06-06 01:59:49] [INFO ] Deduced a trap composed of 14 places in 1398 ms of which 4 ms to minimize.
[2021-06-06 01:59:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2021-06-06 01:59:49] [INFO ] [Real]Absence check using 441 positive place invariants in 153 ms returned sat
[2021-06-06 01:59:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 01:59:50] [INFO ] [Real]Absence check using state equation in 1233 ms returned sat
[2021-06-06 01:59:51] [INFO ] Deduced a trap composed of 19 places in 456 ms of which 3 ms to minimize.
[2021-06-06 01:59:51] [INFO ] Deduced a trap composed of 25 places in 475 ms of which 1 ms to minimize.
[2021-06-06 01:59:52] [INFO ] Deduced a trap composed of 17 places in 448 ms of which 1 ms to minimize.
[2021-06-06 01:59:53] [INFO ] Deduced a trap composed of 37 places in 430 ms of which 2 ms to minimize.
[2021-06-06 01:59:53] [INFO ] Deduced a trap composed of 19 places in 425 ms of which 1 ms to minimize.
[2021-06-06 01:59:54] [INFO ] Deduced a trap composed of 17 places in 425 ms of which 1 ms to minimize.
[2021-06-06 01:59:54] [INFO ] Deduced a trap composed of 27 places in 412 ms of which 1 ms to minimize.
[2021-06-06 01:59:55] [INFO ] Deduced a trap composed of 25 places in 405 ms of which 1 ms to minimize.
[2021-06-06 01:59:55] [INFO ] Deduced a trap composed of 27 places in 396 ms of which 1 ms to minimize.
[2021-06-06 01:59:56] [INFO ] Deduced a trap composed of 27 places in 390 ms of which 2 ms to minimize.
[2021-06-06 01:59:56] [INFO ] Deduced a trap composed of 44 places in 401 ms of which 1 ms to minimize.
[2021-06-06 01:59:57] [INFO ] Deduced a trap composed of 15 places in 379 ms of which 1 ms to minimize.
[2021-06-06 01:59:57] [INFO ] Deduced a trap composed of 25 places in 372 ms of which 1 ms to minimize.
[2021-06-06 01:59:57] [INFO ] Deduced a trap composed of 34 places in 373 ms of which 1 ms to minimize.
[2021-06-06 01:59:58] [INFO ] Deduced a trap composed of 23 places in 361 ms of which 1 ms to minimize.
[2021-06-06 01:59:58] [INFO ] Deduced a trap composed of 33 places in 358 ms of which 1 ms to minimize.
[2021-06-06 01:59:59] [INFO ] Deduced a trap composed of 22 places in 349 ms of which 1 ms to minimize.
[2021-06-06 01:59:59] [INFO ] Deduced a trap composed of 26 places in 343 ms of which 1 ms to minimize.
[2021-06-06 02:00:00] [INFO ] Deduced a trap composed of 24 places in 328 ms of which 1 ms to minimize.
[2021-06-06 02:00:00] [INFO ] Deduced a trap composed of 27 places in 324 ms of which 1 ms to minimize.
[2021-06-06 02:00:00] [INFO ] Deduced a trap composed of 26 places in 297 ms of which 1 ms to minimize.
[2021-06-06 02:00:01] [INFO ] Deduced a trap composed of 30 places in 307 ms of which 1 ms to minimize.
[2021-06-06 02:00:01] [INFO ] Deduced a trap composed of 25 places in 298 ms of which 0 ms to minimize.
[2021-06-06 02:00:02] [INFO ] Deduced a trap composed of 31 places in 282 ms of which 1 ms to minimize.
[2021-06-06 02:00:02] [INFO ] Deduced a trap composed of 42 places in 296 ms of which 0 ms to minimize.
[2021-06-06 02:00:02] [INFO ] Deduced a trap composed of 46 places in 283 ms of which 0 ms to minimize.
[2021-06-06 02:00:03] [INFO ] Deduced a trap composed of 45 places in 278 ms of which 1 ms to minimize.
[2021-06-06 02:00:03] [INFO ] Deduced a trap composed of 44 places in 272 ms of which 1 ms to minimize.
[2021-06-06 02:00:03] [INFO ] Deduced a trap composed of 44 places in 264 ms of which 1 ms to minimize.
[2021-06-06 02:00:04] [INFO ] Deduced a trap composed of 47 places in 267 ms of which 1 ms to minimize.
[2021-06-06 02:00:04] [INFO ] Deduced a trap composed of 45 places in 265 ms of which 1 ms to minimize.
[2021-06-06 02:00:04] [INFO ] Deduced a trap composed of 41 places in 257 ms of which 1 ms to minimize.
[2021-06-06 02:00:05] [INFO ] Deduced a trap composed of 40 places in 255 ms of which 1 ms to minimize.
[2021-06-06 02:00:05] [INFO ] Deduced a trap composed of 36 places in 257 ms of which 0 ms to minimize.
[2021-06-06 02:00:06] [INFO ] Deduced a trap composed of 41 places in 242 ms of which 0 ms to minimize.
[2021-06-06 02:00:06] [INFO ] Deduced a trap composed of 45 places in 246 ms of which 1 ms to minimize.
[2021-06-06 02:00:06] [INFO ] Deduced a trap composed of 41 places in 239 ms of which 0 ms to minimize.
[2021-06-06 02:00:07] [INFO ] Deduced a trap composed of 38 places in 238 ms of which 1 ms to minimize.
[2021-06-06 02:00:07] [INFO ] Deduced a trap composed of 42 places in 235 ms of which 1 ms to minimize.
[2021-06-06 02:00:07] [INFO ] Deduced a trap composed of 43 places in 232 ms of which 1 ms to minimize.
[2021-06-06 02:00:07] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 1 ms to minimize.
[2021-06-06 02:00:08] [INFO ] Deduced a trap composed of 47 places in 213 ms of which 1 ms to minimize.
[2021-06-06 02:00:08] [INFO ] Deduced a trap composed of 42 places in 204 ms of which 1 ms to minimize.
[2021-06-06 02:00:08] [INFO ] Deduced a trap composed of 48 places in 200 ms of which 1 ms to minimize.
[2021-06-06 02:00:09] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 0 ms to minimize.
[2021-06-06 02:00:09] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 0 ms to minimize.
[2021-06-06 02:00:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-06-06 02:00:09] [INFO ] [Real]Absence check using 441 positive place invariants in 150 ms returned sat
[2021-06-06 02:00:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 02:00:10] [INFO ] [Real]Absence check using state equation in 1101 ms returned sat
[2021-06-06 02:00:11] [INFO ] Deduced a trap composed of 28 places in 509 ms of which 1 ms to minimize.
[2021-06-06 02:00:12] [INFO ] Deduced a trap composed of 23 places in 503 ms of which 1 ms to minimize.
[2021-06-06 02:00:12] [INFO ] Deduced a trap composed of 28 places in 496 ms of which 1 ms to minimize.
[2021-06-06 02:00:13] [INFO ] Deduced a trap composed of 30 places in 476 ms of which 1 ms to minimize.
[2021-06-06 02:00:13] [INFO ] Deduced a trap composed of 24 places in 466 ms of which 2 ms to minimize.
[2021-06-06 02:00:14] [INFO ] Deduced a trap composed of 28 places in 472 ms of which 1 ms to minimize.
[2021-06-06 02:00:14] [INFO ] Deduced a trap composed of 24 places in 461 ms of which 1 ms to minimize.
[2021-06-06 02:00:15] [INFO ] Deduced a trap composed of 29 places in 465 ms of which 1 ms to minimize.
[2021-06-06 02:00:16] [INFO ] Deduced a trap composed of 23 places in 429 ms of which 1 ms to minimize.
[2021-06-06 02:00:16] [INFO ] Deduced a trap composed of 30 places in 452 ms of which 2 ms to minimize.
[2021-06-06 02:00:17] [INFO ] Deduced a trap composed of 31 places in 425 ms of which 1 ms to minimize.
[2021-06-06 02:00:17] [INFO ] Deduced a trap composed of 30 places in 421 ms of which 2 ms to minimize.
[2021-06-06 02:00:18] [INFO ] Deduced a trap composed of 25 places in 409 ms of which 1 ms to minimize.
[2021-06-06 02:00:18] [INFO ] Deduced a trap composed of 37 places in 403 ms of which 1 ms to minimize.
[2021-06-06 02:00:19] [INFO ] Deduced a trap composed of 34 places in 392 ms of which 1 ms to minimize.
[2021-06-06 02:00:19] [INFO ] Deduced a trap composed of 38 places in 386 ms of which 1 ms to minimize.
[2021-06-06 02:00:20] [INFO ] Deduced a trap composed of 35 places in 372 ms of which 1 ms to minimize.
[2021-06-06 02:00:20] [INFO ] Deduced a trap composed of 38 places in 368 ms of which 1 ms to minimize.
[2021-06-06 02:00:20] [INFO ] Deduced a trap composed of 33 places in 367 ms of which 1 ms to minimize.
[2021-06-06 02:00:21] [INFO ] Deduced a trap composed of 40 places in 349 ms of which 1 ms to minimize.
[2021-06-06 02:00:21] [INFO ] Deduced a trap composed of 41 places in 359 ms of which 1 ms to minimize.
[2021-06-06 02:00:22] [INFO ] Deduced a trap composed of 41 places in 351 ms of which 1 ms to minimize.
[2021-06-06 02:00:22] [INFO ] Deduced a trap composed of 42 places in 354 ms of which 2 ms to minimize.
[2021-06-06 02:00:23] [INFO ] Deduced a trap composed of 37 places in 348 ms of which 1 ms to minimize.
[2021-06-06 02:00:23] [INFO ] Deduced a trap composed of 44 places in 342 ms of which 1 ms to minimize.
[2021-06-06 02:00:24] [INFO ] Deduced a trap composed of 42 places in 345 ms of which 1 ms to minimize.
[2021-06-06 02:00:24] [INFO ] Deduced a trap composed of 50 places in 340 ms of which 1 ms to minimize.
[2021-06-06 02:00:24] [INFO ] Deduced a trap composed of 42 places in 321 ms of which 1 ms to minimize.
[2021-06-06 02:00:25] [INFO ] Deduced a trap composed of 55 places in 310 ms of which 0 ms to minimize.
[2021-06-06 02:00:25] [INFO ] Deduced a trap composed of 40 places in 303 ms of which 1 ms to minimize.
[2021-06-06 02:00:26] [INFO ] Deduced a trap composed of 40 places in 309 ms of which 1 ms to minimize.
[2021-06-06 02:00:26] [INFO ] Deduced a trap composed of 39 places in 295 ms of which 1 ms to minimize.
[2021-06-06 02:00:26] [INFO ] Deduced a trap composed of 46 places in 287 ms of which 1 ms to minimize.
[2021-06-06 02:00:27] [INFO ] Deduced a trap composed of 38 places in 279 ms of which 1 ms to minimize.
[2021-06-06 02:00:27] [INFO ] Deduced a trap composed of 53 places in 274 ms of which 1 ms to minimize.
[2021-06-06 02:00:27] [INFO ] Deduced a trap composed of 39 places in 278 ms of which 4 ms to minimize.
[2021-06-06 02:00:28] [INFO ] Deduced a trap composed of 41 places in 267 ms of which 0 ms to minimize.
[2021-06-06 02:00:28] [INFO ] Deduced a trap composed of 46 places in 264 ms of which 1 ms to minimize.
[2021-06-06 02:00:28] [INFO ] Deduced a trap composed of 45 places in 247 ms of which 1 ms to minimize.
[2021-06-06 02:00:29] [INFO ] Deduced a trap composed of 46 places in 253 ms of which 0 ms to minimize.
[2021-06-06 02:00:29] [INFO ] Deduced a trap composed of 51 places in 237 ms of which 0 ms to minimize.
[2021-06-06 02:00:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2021-06-06 02:00:29] [INFO ] [Real]Absence check using 441 positive place invariants in 146 ms returned sat
[2021-06-06 02:00:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 02:00:31] [INFO ] [Real]Absence check using state equation in 1057 ms returned sat
[2021-06-06 02:00:31] [INFO ] Deduced a trap composed of 26 places in 461 ms of which 1 ms to minimize.
[2021-06-06 02:00:32] [INFO ] Deduced a trap composed of 19 places in 441 ms of which 1 ms to minimize.
[2021-06-06 02:00:32] [INFO ] Deduced a trap composed of 16 places in 454 ms of which 1 ms to minimize.
[2021-06-06 02:00:33] [INFO ] Deduced a trap composed of 16 places in 457 ms of which 1 ms to minimize.
[2021-06-06 02:00:33] [INFO ] Deduced a trap composed of 17 places in 445 ms of which 1 ms to minimize.
[2021-06-06 02:00:34] [INFO ] Deduced a trap composed of 19 places in 430 ms of which 1 ms to minimize.
[2021-06-06 02:00:34] [INFO ] Deduced a trap composed of 29 places in 424 ms of which 1 ms to minimize.
[2021-06-06 02:00:35] [INFO ] Deduced a trap composed of 23 places in 419 ms of which 1 ms to minimize.
[2021-06-06 02:00:35] [INFO ] Deduced a trap composed of 27 places in 413 ms of which 1 ms to minimize.
[2021-06-06 02:00:36] [INFO ] Deduced a trap composed of 27 places in 412 ms of which 1 ms to minimize.
[2021-06-06 02:00:36] [INFO ] Deduced a trap composed of 23 places in 413 ms of which 1 ms to minimize.
[2021-06-06 02:00:37] [INFO ] Deduced a trap composed of 24 places in 390 ms of which 1 ms to minimize.
[2021-06-06 02:00:37] [INFO ] Deduced a trap composed of 26 places in 376 ms of which 1 ms to minimize.
[2021-06-06 02:00:38] [INFO ] Deduced a trap composed of 29 places in 369 ms of which 2 ms to minimize.
[2021-06-06 02:00:38] [INFO ] Deduced a trap composed of 29 places in 359 ms of which 1 ms to minimize.
[2021-06-06 02:00:39] [INFO ] Deduced a trap composed of 30 places in 359 ms of which 1 ms to minimize.
[2021-06-06 02:00:39] [INFO ] Deduced a trap composed of 29 places in 359 ms of which 1 ms to minimize.
[2021-06-06 02:00:40] [INFO ] Deduced a trap composed of 27 places in 341 ms of which 1 ms to minimize.
[2021-06-06 02:00:40] [INFO ] Deduced a trap composed of 39 places in 342 ms of which 1 ms to minimize.
[2021-06-06 02:00:40] [INFO ] Deduced a trap composed of 31 places in 325 ms of which 1 ms to minimize.
[2021-06-06 02:00:41] [INFO ] Deduced a trap composed of 38 places in 318 ms of which 1 ms to minimize.
[2021-06-06 02:00:41] [INFO ] Deduced a trap composed of 32 places in 318 ms of which 1 ms to minimize.
[2021-06-06 02:00:42] [INFO ] Deduced a trap composed of 37 places in 308 ms of which 0 ms to minimize.
[2021-06-06 02:00:42] [INFO ] Deduced a trap composed of 36 places in 316 ms of which 0 ms to minimize.
[2021-06-06 02:00:42] [INFO ] Deduced a trap composed of 38 places in 306 ms of which 1 ms to minimize.
[2021-06-06 02:00:43] [INFO ] Deduced a trap composed of 37 places in 294 ms of which 1 ms to minimize.
[2021-06-06 02:00:43] [INFO ] Deduced a trap composed of 46 places in 293 ms of which 1 ms to minimize.
[2021-06-06 02:00:44] [INFO ] Deduced a trap composed of 44 places in 279 ms of which 0 ms to minimize.
[2021-06-06 02:00:44] [INFO ] Deduced a trap composed of 37 places in 273 ms of which 0 ms to minimize.
[2021-06-06 02:00:44] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 0 ms to minimize.
[2021-06-06 02:00:45] [INFO ] Deduced a trap composed of 40 places in 263 ms of which 0 ms to minimize.
[2021-06-06 02:00:45] [INFO ] Deduced a trap composed of 36 places in 248 ms of which 1 ms to minimize.
[2021-06-06 02:00:45] [INFO ] Deduced a trap composed of 47 places in 244 ms of which 1 ms to minimize.
[2021-06-06 02:00:46] [INFO ] Deduced a trap composed of 42 places in 244 ms of which 1 ms to minimize.
[2021-06-06 02:00:46] [INFO ] Deduced a trap composed of 45 places in 235 ms of which 1 ms to minimize.
[2021-06-06 02:00:46] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 1 ms to minimize.
[2021-06-06 02:00:47] [INFO ] Deduced a trap composed of 45 places in 231 ms of which 0 ms to minimize.
[2021-06-06 02:00:47] [INFO ] Deduced a trap composed of 33 places in 235 ms of which 0 ms to minimize.
[2021-06-06 02:00:47] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 1 ms to minimize.
[2021-06-06 02:00:48] [INFO ] Deduced a trap composed of 44 places in 211 ms of which 1 ms to minimize.
[2021-06-06 02:00:48] [INFO ] Deduced a trap composed of 43 places in 212 ms of which 0 ms to minimize.
[2021-06-06 02:00:48] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 1 ms to minimize.
[2021-06-06 02:00:48] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 0 ms to minimize.
[2021-06-06 02:00:49] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 1 ms to minimize.
[2021-06-06 02:00:49] [INFO ] Deduced a trap composed of 61 places in 197 ms of which 0 ms to minimize.
[2021-06-06 02:00:49] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 1 ms to minimize.
[2021-06-06 02:00:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2021-06-06 02:00:50] [INFO ] [Real]Absence check using 441 positive place invariants in 146 ms returned sat
[2021-06-06 02:00:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 02:00:51] [INFO ] [Real]Absence check using state equation in 1052 ms returned sat
[2021-06-06 02:00:51] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 02:00:51] [INFO ] [Nat]Absence check using 441 positive place invariants in 152 ms returned sat
[2021-06-06 02:00:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 02:00:52] [INFO ] [Nat]Absence check using state equation in 1126 ms returned sat
[2021-06-06 02:00:53] [INFO ] Deduced a trap composed of 23 places in 542 ms of which 1 ms to minimize.
[2021-06-06 02:00:54] [INFO ] Deduced a trap composed of 26 places in 518 ms of which 2 ms to minimize.
[2021-06-06 02:00:54] [INFO ] Deduced a trap composed of 25 places in 510 ms of which 1 ms to minimize.
[2021-06-06 02:00:55] [INFO ] Deduced a trap composed of 16 places in 476 ms of which 1 ms to minimize.
[2021-06-06 02:00:55] [INFO ] Deduced a trap composed of 18 places in 458 ms of which 1 ms to minimize.
[2021-06-06 02:00:56] [INFO ] Deduced a trap composed of 23 places in 454 ms of which 1 ms to minimize.
[2021-06-06 02:00:56] [INFO ] Deduced a trap composed of 40 places in 457 ms of which 1 ms to minimize.
[2021-06-06 02:00:57] [INFO ] Deduced a trap composed of 33 places in 452 ms of which 1 ms to minimize.
[2021-06-06 02:00:57] [INFO ] Deduced a trap composed of 17 places in 453 ms of which 2 ms to minimize.
[2021-06-06 02:00:58] [INFO ] Deduced a trap composed of 25 places in 487 ms of which 2 ms to minimize.
[2021-06-06 02:00:59] [INFO ] Deduced a trap composed of 30 places in 460 ms of which 1 ms to minimize.
[2021-06-06 02:00:59] [INFO ] Deduced a trap composed of 27 places in 424 ms of which 1 ms to minimize.
[2021-06-06 02:01:00] [INFO ] Deduced a trap composed of 28 places in 416 ms of which 1 ms to minimize.
[2021-06-06 02:01:00] [INFO ] Deduced a trap composed of 27 places in 409 ms of which 1 ms to minimize.
[2021-06-06 02:01:01] [INFO ] Deduced a trap composed of 36 places in 393 ms of which 1 ms to minimize.
[2021-06-06 02:01:01] [INFO ] Deduced a trap composed of 33 places in 401 ms of which 1 ms to minimize.
[2021-06-06 02:01:01] [INFO ] Deduced a trap composed of 34 places in 381 ms of which 1 ms to minimize.
[2021-06-06 02:01:02] [INFO ] Deduced a trap composed of 36 places in 420 ms of which 2 ms to minimize.
[2021-06-06 02:01:02] [INFO ] Deduced a trap composed of 28 places in 372 ms of which 1 ms to minimize.
[2021-06-06 02:01:03] [INFO ] Deduced a trap composed of 38 places in 369 ms of which 1 ms to minimize.
[2021-06-06 02:01:03] [INFO ] Deduced a trap composed of 32 places in 363 ms of which 1 ms to minimize.
[2021-06-06 02:01:04] [INFO ] Deduced a trap composed of 44 places in 342 ms of which 1 ms to minimize.
[2021-06-06 02:01:04] [INFO ] Deduced a trap composed of 41 places in 385 ms of which 1 ms to minimize.
[2021-06-06 02:01:05] [INFO ] Deduced a trap composed of 35 places in 337 ms of which 1 ms to minimize.
[2021-06-06 02:01:05] [INFO ] Deduced a trap composed of 52 places in 328 ms of which 1 ms to minimize.
[2021-06-06 02:01:05] [INFO ] Deduced a trap composed of 47 places in 356 ms of which 1 ms to minimize.
[2021-06-06 02:01:06] [INFO ] Deduced a trap composed of 44 places in 335 ms of which 1 ms to minimize.
[2021-06-06 02:01:06] [INFO ] Deduced a trap composed of 46 places in 326 ms of which 1 ms to minimize.
[2021-06-06 02:01:07] [INFO ] Deduced a trap composed of 44 places in 335 ms of which 1 ms to minimize.
[2021-06-06 02:01:07] [INFO ] Deduced a trap composed of 36 places in 325 ms of which 0 ms to minimize.
[2021-06-06 02:01:08] [INFO ] Deduced a trap composed of 38 places in 311 ms of which 1 ms to minimize.
[2021-06-06 02:01:08] [INFO ] Deduced a trap composed of 50 places in 312 ms of which 1 ms to minimize.
[2021-06-06 02:01:08] [INFO ] Deduced a trap composed of 35 places in 301 ms of which 1 ms to minimize.
[2021-06-06 02:01:09] [INFO ] Deduced a trap composed of 42 places in 288 ms of which 1 ms to minimize.
[2021-06-06 02:01:09] [INFO ] Deduced a trap composed of 32 places in 288 ms of which 1 ms to minimize.
[2021-06-06 02:01:09] [INFO ] Deduced a trap composed of 39 places in 285 ms of which 1 ms to minimize.
[2021-06-06 02:01:10] [INFO ] Deduced a trap composed of 37 places in 280 ms of which 1 ms to minimize.
[2021-06-06 02:01:10] [INFO ] Deduced a trap composed of 38 places in 275 ms of which 1 ms to minimize.
[2021-06-06 02:01:10] [INFO ] Deduced a trap composed of 42 places in 262 ms of which 0 ms to minimize.
[2021-06-06 02:01:11] [INFO ] Deduced a trap composed of 43 places in 258 ms of which 0 ms to minimize.
[2021-06-06 02:01:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
[2021-06-06 02:01:11] [INFO ] [Real]Absence check using 441 positive place invariants in 153 ms returned sat
[2021-06-06 02:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 02:01:12] [INFO ] [Real]Absence check using state equation in 1078 ms returned sat
[2021-06-06 02:01:12] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 02:01:13] [INFO ] [Nat]Absence check using 441 positive place invariants in 153 ms returned sat
[2021-06-06 02:01:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 02:01:14] [INFO ] [Nat]Absence check using state equation in 1055 ms returned sat
[2021-06-06 02:01:14] [INFO ] Deduced a trap composed of 25 places in 489 ms of which 2 ms to minimize.
[2021-06-06 02:01:15] [INFO ] Deduced a trap composed of 26 places in 463 ms of which 1 ms to minimize.
[2021-06-06 02:01:15] [INFO ] Deduced a trap composed of 17 places in 472 ms of which 2 ms to minimize.
[2021-06-06 02:01:16] [INFO ] Deduced a trap composed of 26 places in 468 ms of which 1 ms to minimize.
[2021-06-06 02:01:17] [INFO ] Deduced a trap composed of 17 places in 457 ms of which 1 ms to minimize.
[2021-06-06 02:01:17] [INFO ] Deduced a trap composed of 28 places in 455 ms of which 1 ms to minimize.
[2021-06-06 02:01:18] [INFO ] Deduced a trap composed of 29 places in 439 ms of which 1 ms to minimize.
[2021-06-06 02:01:18] [INFO ] Deduced a trap composed of 21 places in 441 ms of which 1 ms to minimize.
[2021-06-06 02:01:19] [INFO ] Deduced a trap composed of 25 places in 429 ms of which 2 ms to minimize.
[2021-06-06 02:01:19] [INFO ] Deduced a trap composed of 26 places in 423 ms of which 2 ms to minimize.
[2021-06-06 02:01:20] [INFO ] Deduced a trap composed of 23 places in 415 ms of which 1 ms to minimize.
[2021-06-06 02:01:20] [INFO ] Deduced a trap composed of 21 places in 406 ms of which 1 ms to minimize.
[2021-06-06 02:01:21] [INFO ] Deduced a trap composed of 27 places in 403 ms of which 2 ms to minimize.
[2021-06-06 02:01:21] [INFO ] Deduced a trap composed of 31 places in 395 ms of which 1 ms to minimize.
[2021-06-06 02:01:22] [INFO ] Deduced a trap composed of 24 places in 390 ms of which 2 ms to minimize.
[2021-06-06 02:01:22] [INFO ] Deduced a trap composed of 37 places in 390 ms of which 1 ms to minimize.
[2021-06-06 02:01:23] [INFO ] Deduced a trap composed of 32 places in 363 ms of which 1 ms to minimize.
[2021-06-06 02:01:23] [INFO ] Deduced a trap composed of 38 places in 380 ms of which 1 ms to minimize.
[2021-06-06 02:01:23] [INFO ] Deduced a trap composed of 36 places in 366 ms of which 1 ms to minimize.
[2021-06-06 02:01:24] [INFO ] Deduced a trap composed of 37 places in 371 ms of which 1 ms to minimize.
[2021-06-06 02:01:24] [INFO ] Deduced a trap composed of 34 places in 360 ms of which 1 ms to minimize.
[2021-06-06 02:01:25] [INFO ] Deduced a trap composed of 38 places in 351 ms of which 1 ms to minimize.
[2021-06-06 02:01:25] [INFO ] Deduced a trap composed of 29 places in 341 ms of which 1 ms to minimize.
[2021-06-06 02:01:26] [INFO ] Deduced a trap composed of 38 places in 355 ms of which 1 ms to minimize.
[2021-06-06 02:01:26] [INFO ] Deduced a trap composed of 41 places in 334 ms of which 1 ms to minimize.
[2021-06-06 02:01:27] [INFO ] Deduced a trap composed of 48 places in 324 ms of which 1 ms to minimize.
[2021-06-06 02:01:27] [INFO ] Deduced a trap composed of 42 places in 344 ms of which 1 ms to minimize.
[2021-06-06 02:01:27] [INFO ] Deduced a trap composed of 42 places in 325 ms of which 0 ms to minimize.
[2021-06-06 02:01:28] [INFO ] Deduced a trap composed of 42 places in 318 ms of which 0 ms to minimize.
[2021-06-06 02:01:28] [INFO ] Deduced a trap composed of 40 places in 312 ms of which 1 ms to minimize.
[2021-06-06 02:01:29] [INFO ] Deduced a trap composed of 40 places in 317 ms of which 1 ms to minimize.
[2021-06-06 02:01:29] [INFO ] Deduced a trap composed of 48 places in 299 ms of which 1 ms to minimize.
[2021-06-06 02:01:29] [INFO ] Deduced a trap composed of 40 places in 292 ms of which 0 ms to minimize.
[2021-06-06 02:01:30] [INFO ] Deduced a trap composed of 42 places in 286 ms of which 1 ms to minimize.
[2021-06-06 02:01:30] [INFO ] Deduced a trap composed of 42 places in 290 ms of which 1 ms to minimize.
[2021-06-06 02:01:30] [INFO ] Deduced a trap composed of 51 places in 272 ms of which 1 ms to minimize.
[2021-06-06 02:01:31] [INFO ] Deduced a trap composed of 46 places in 263 ms of which 0 ms to minimize.
[2021-06-06 02:01:31] [INFO ] Deduced a trap composed of 31 places in 291 ms of which 1 ms to minimize.
[2021-06-06 02:01:31] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 1 ms to minimize.
[2021-06-06 02:01:32] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 1 ms to minimize.
[2021-06-06 02:01:32] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 0 ms to minimize.
[2021-06-06 02:01:32] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 0 ms to minimize.
[2021-06-06 02:01:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 2685 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2685/2685 places, 2405/2405 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2681 transition count 2401
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2681 transition count 2401
Applied a total of 8 rules in 267 ms. Remains 2681 /2685 variables (removed 4) and now considering 2401/2405 (removed 4) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:01:33] [INFO ] Computed 441 place invariants in 13 ms
[2021-06-06 02:01:34] [INFO ] Implicit Places using invariants in 819 ms returned []
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:01:34] [INFO ] Computed 441 place invariants in 7 ms
[2021-06-06 02:01:36] [INFO ] Implicit Places using invariants and state equation in 2445 ms returned []
Implicit Place search using SMT with State Equation took 3266 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:01:36] [INFO ] Computed 441 place invariants in 11 ms
[2021-06-06 02:01:37] [INFO ] Dead Transitions using invariants and state equation in 1433 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2681/2685 places, 2401/2405 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1515 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldPPPt-PT-040B-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-00 finished in 5201 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||(p1&&X(X(G(p2))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 2685 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2685/2685 places, 2405/2405 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2681 transition count 2401
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2681 transition count 2401
Applied a total of 8 rules in 284 ms. Remains 2681 /2685 variables (removed 4) and now considering 2401/2405 (removed 4) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:01:38] [INFO ] Computed 441 place invariants in 11 ms
[2021-06-06 02:01:39] [INFO ] Implicit Places using invariants in 810 ms returned []
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:01:39] [INFO ] Computed 441 place invariants in 6 ms
[2021-06-06 02:01:41] [INFO ] Implicit Places using invariants and state equation in 2476 ms returned []
Implicit Place search using SMT with State Equation took 3288 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:01:41] [INFO ] Computed 441 place invariants in 7 ms
[2021-06-06 02:01:43] [INFO ] Dead Transitions using invariants and state equation in 1432 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2681/2685 places, 2401/2405 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-040B-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s964 0), p0:(EQ s964 1), p2:(NEQ s2664 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 750 ms.
Stack based approach found an accepted trace after 2558 steps with 0 reset with depth 2559 and stack size 382 in 25 ms.
FORMULA ShieldPPPt-PT-040B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-01 finished in 6007 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((X(p0)&&(G(p1) U p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2685 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2685/2685 places, 2405/2405 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2682 transition count 2402
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2682 transition count 2402
Applied a total of 6 rules in 271 ms. Remains 2682 /2685 variables (removed 3) and now considering 2402/2405 (removed 3) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2021-06-06 02:01:44] [INFO ] Computed 441 place invariants in 23 ms
[2021-06-06 02:01:45] [INFO ] Implicit Places using invariants in 824 ms returned []
// Phase 1: matrix 2402 rows 2682 cols
[2021-06-06 02:01:45] [INFO ] Computed 441 place invariants in 6 ms
[2021-06-06 02:01:47] [INFO ] Implicit Places using invariants and state equation in 2501 ms returned []
Implicit Place search using SMT with State Equation took 3327 ms to find 0 implicit places.
// Phase 1: matrix 2402 rows 2682 cols
[2021-06-06 02:01:47] [INFO ] Computed 441 place invariants in 6 ms
[2021-06-06 02:01:49] [INFO ] Dead Transitions using invariants and state equation in 1443 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2682/2685 places, 2402/2405 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-040B-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(OR p2 p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s1656 1) (EQ s1693 1)), p1:(NEQ s1429 1), p0:(EQ s348 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-040B-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-04 finished in 5300 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G((p1||X(p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2685 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2685/2685 places, 2405/2405 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2682 transition count 2402
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2682 transition count 2402
Applied a total of 6 rules in 292 ms. Remains 2682 /2685 variables (removed 3) and now considering 2402/2405 (removed 3) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2021-06-06 02:01:49] [INFO ] Computed 441 place invariants in 10 ms
[2021-06-06 02:01:50] [INFO ] Implicit Places using invariants in 850 ms returned []
// Phase 1: matrix 2402 rows 2682 cols
[2021-06-06 02:01:50] [INFO ] Computed 441 place invariants in 7 ms
[2021-06-06 02:01:53] [INFO ] Implicit Places using invariants and state equation in 2534 ms returned []
Implicit Place search using SMT with State Equation took 3385 ms to find 0 implicit places.
// Phase 1: matrix 2402 rows 2682 cols
[2021-06-06 02:01:53] [INFO ] Computed 441 place invariants in 6 ms
[2021-06-06 02:01:54] [INFO ] Dead Transitions using invariants and state equation in 1427 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2682/2685 places, 2402/2405 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-040B-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s1992 1), p1:(NEQ s2292 1), p2:(OR (NEQ s1855 1) (NEQ s1881 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 79 reset in 696 ms.
Product exploration explored 100000 steps with 95 reset in 877 ms.
Knowledge obtained : [p0, p1, p2]
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 80 reset in 618 ms.
Product exploration explored 100000 steps with 59 reset in 884 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 2682 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2682/2682 places, 2402/2402 transitions.
Performed 560 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 2682 transition count 2402
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 198 Pre rules applied. Total rules applied 560 place count 2682 transition count 2560
Deduced a syphon composed of 758 places in 5 ms
Iterating global reduction 1 with 198 rules applied. Total rules applied 758 place count 2682 transition count 2560
Performed 758 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1516 places in 16 ms
Iterating global reduction 1 with 758 rules applied. Total rules applied 1516 place count 2682 transition count 2560
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1517 place count 2682 transition count 2559
Renaming transitions due to excessive name length > 1024 char.
Discarding 283 places :
Symmetric choice reduction at 2 with 283 rule applications. Total rules 1800 place count 2399 transition count 2276
Deduced a syphon composed of 1233 places in 12 ms
Iterating global reduction 2 with 283 rules applied. Total rules applied 2083 place count 2399 transition count 2276
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1234 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2084 place count 2399 transition count 2276
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2086 place count 2397 transition count 2274
Deduced a syphon composed of 1232 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2088 place count 2397 transition count 2274
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 1333 places in 4 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2189 place count 2397 transition count 2704
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2290 place count 2296 transition count 2502
Deduced a syphon composed of 1232 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2391 place count 2296 transition count 2502
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -241
Deduced a syphon composed of 1290 places in 12 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2449 place count 2296 transition count 2743
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 2507 place count 2238 transition count 2627
Deduced a syphon composed of 1232 places in 3 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2565 place count 2238 transition count 2627
Deduced a syphon composed of 1232 places in 3 ms
Applied a total of 2565 rules in 2360 ms. Remains 2238 /2682 variables (removed 444) and now considering 2627/2402 (removed -225) transitions.
[2021-06-06 02:02:00] [INFO ] Redundant transitions in 187 ms returned []
// Phase 1: matrix 2627 rows 2238 cols
[2021-06-06 02:02:00] [INFO ] Computed 441 place invariants in 23 ms
[2021-06-06 02:02:02] [INFO ] Dead Transitions using invariants and state equation in 1386 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2238/2682 places, 2627/2402 transitions.
Product exploration explored 100000 steps with 22 reset in 769 ms.
Product exploration explored 100000 steps with 51 reset in 891 ms.
[2021-06-06 02:02:04] [INFO ] Flatten gal took : 111 ms
[2021-06-06 02:02:04] [INFO ] Flatten gal took : 68 ms
[2021-06-06 02:02:04] [INFO ] Time to serialize gal into /tmp/LTL3763772051378788105.gal : 43 ms
[2021-06-06 02:02:04] [INFO ] Time to serialize properties into /tmp/LTL2512440291098052370.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3763772051378788105.gal, -t, CGAL, -LTL, /tmp/LTL2512440291098052370.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3763772051378788105.gal -t CGAL -LTL /tmp/LTL2512440291098052370.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("(p2311!=1)"))&&(F(G(("(p2665!=1)")||(X("((p2152!=1)||(p2185!=1))"))))))))
Formula 0 simplified : !G(F"(p2311!=1)" & FG("(p2665!=1)" | X"((p2152!=1)||(p2185!=1))"))
Detected timeout of ITS tools.
[2021-06-06 02:02:19] [INFO ] Flatten gal took : 66 ms
[2021-06-06 02:02:19] [INFO ] Applying decomposition
[2021-06-06 02:02:19] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10403841001061980741.txt, -o, /tmp/graph10403841001061980741.bin, -w, /tmp/graph10403841001061980741.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10403841001061980741.bin, -l, -1, -v, -w, /tmp/graph10403841001061980741.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-06 02:02:19] [INFO ] Decomposing Gal with order
[2021-06-06 02:02:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 02:02:20] [INFO ] Removed a total of 399 redundant transitions.
[2021-06-06 02:02:20] [INFO ] Flatten gal took : 232 ms
[2021-06-06 02:02:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 36 ms.
[2021-06-06 02:02:20] [INFO ] Time to serialize gal into /tmp/LTL7716464622972936071.gal : 58 ms
[2021-06-06 02:02:20] [INFO ] Time to serialize properties into /tmp/LTL9815344771120273073.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7716464622972936071.gal, -t, CGAL, -LTL, /tmp/LTL9815344771120273073.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7716464622972936071.gal -t CGAL -LTL /tmp/LTL9815344771120273073.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((F("(i29.u716.p2311!=1)"))&&(F(G(("(i34.u825.p2665!=1)")||(X("((i27.i2.i1.u664.p2152!=1)||(i27.i2.i2.u674.p2185!=1))"))))))))
Formula 0 simplified : !G(F"(i29.u716.p2311!=1)" & FG("(i34.u825.p2665!=1)" | X"((i27.i2.i1.u664.p2152!=1)||(i27.i2.i2.u674.p2185!=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13057550271397502577
[2021-06-06 02:02:35] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13057550271397502577
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13057550271397502577]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13057550271397502577] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13057550271397502577] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldPPPt-PT-040B-05 finished in 47166 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(X(G(p0)))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 2685 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2685/2685 places, 2405/2405 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2681 transition count 2401
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2681 transition count 2401
Applied a total of 8 rules in 382 ms. Remains 2681 /2685 variables (removed 4) and now considering 2401/2405 (removed 4) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:02:37] [INFO ] Computed 441 place invariants in 5 ms
[2021-06-06 02:02:37] [INFO ] Implicit Places using invariants in 995 ms returned []
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:02:38] [INFO ] Computed 441 place invariants in 6 ms
[2021-06-06 02:02:40] [INFO ] Implicit Places using invariants and state equation in 2472 ms returned []
Implicit Place search using SMT with State Equation took 3485 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:02:40] [INFO ] Computed 441 place invariants in 6 ms
[2021-06-06 02:02:41] [INFO ] Dead Transitions using invariants and state equation in 1484 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2681/2685 places, 2401/2405 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(EQ s1293 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-040B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-06 finished in 5572 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 2685 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2685/2685 places, 2405/2405 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2684 transition count 1846
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 2126 transition count 1846
Performed 317 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 317 Pre rules applied. Total rules applied 1116 place count 2126 transition count 1529
Deduced a syphon composed of 317 places in 2 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 2 with 634 rules applied. Total rules applied 1750 place count 1809 transition count 1529
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1754 place count 1805 transition count 1525
Iterating global reduction 2 with 4 rules applied. Total rules applied 1758 place count 1805 transition count 1525
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1758 place count 1805 transition count 1521
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1766 place count 1801 transition count 1521
Performed 678 Post agglomeration using F-continuation condition.Transition count delta: 678
Deduced a syphon composed of 678 places in 1 ms
Reduce places removed 678 places and 0 transitions.
Iterating global reduction 2 with 1356 rules applied. Total rules applied 3122 place count 1123 transition count 843
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3123 place count 1123 transition count 842
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3125 place count 1122 transition count 841
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3327 place count 1021 transition count 841
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3361 place count 1004 transition count 841
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3362 place count 1003 transition count 840
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3363 place count 1002 transition count 840
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3363 place count 1002 transition count 838
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3367 place count 1000 transition count 838
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3368 place count 999 transition count 837
Applied a total of 3368 rules in 568 ms. Remains 999 /2685 variables (removed 1686) and now considering 837/2405 (removed 1568) transitions.
// Phase 1: matrix 837 rows 999 cols
[2021-06-06 02:02:42] [INFO ] Computed 440 place invariants in 1 ms
[2021-06-06 02:02:43] [INFO ] Implicit Places using invariants in 690 ms returned [982, 986]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 693 ms to find 2 implicit places.
[2021-06-06 02:02:43] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 837 rows 997 cols
[2021-06-06 02:02:43] [INFO ] Computed 438 place invariants in 2 ms
[2021-06-06 02:02:43] [INFO ] Dead Transitions using invariants and state equation in 466 ms returned []
Starting structural reductions, iteration 1 : 997/2685 places, 837/2405 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 995 transition count 835
Applied a total of 4 rules in 43 ms. Remains 995 /997 variables (removed 2) and now considering 835/837 (removed 2) transitions.
// Phase 1: matrix 835 rows 995 cols
[2021-06-06 02:02:44] [INFO ] Computed 438 place invariants in 1 ms
[2021-06-06 02:02:44] [INFO ] Implicit Places using invariants in 628 ms returned []
// Phase 1: matrix 835 rows 995 cols
[2021-06-06 02:02:44] [INFO ] Computed 438 place invariants in 2 ms
[2021-06-06 02:02:45] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1569 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 995/2685 places, 835/2405 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s651 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 717 ms.
Stack based approach found an accepted trace after 25344 steps with 0 reset with depth 25345 and stack size 21683 in 209 ms.
FORMULA ShieldPPPt-PT-040B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-07 finished in 4359 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 2685 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2685/2685 places, 2405/2405 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2681 transition count 2401
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2681 transition count 2401
Applied a total of 8 rules in 425 ms. Remains 2681 /2685 variables (removed 4) and now considering 2401/2405 (removed 4) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:02:46] [INFO ] Computed 441 place invariants in 16 ms
[2021-06-06 02:02:47] [INFO ] Implicit Places using invariants in 853 ms returned []
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:02:47] [INFO ] Computed 441 place invariants in 5 ms
[2021-06-06 02:02:50] [INFO ] Implicit Places using invariants and state equation in 2340 ms returned []
Implicit Place search using SMT with State Equation took 3196 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:02:50] [INFO ] Computed 441 place invariants in 6 ms
[2021-06-06 02:02:51] [INFO ] Dead Transitions using invariants and state equation in 1511 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2681/2685 places, 2401/2405 transitions.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s1102 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 456 steps with 0 reset in 2 ms.
FORMULA ShieldPPPt-PT-040B-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-08 finished in 5228 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 5 out of 2685 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2685/2685 places, 2405/2405 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 557 rules applied. Total rules applied 557 place count 2684 transition count 1847
Reduce places removed 557 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 559 rules applied. Total rules applied 1116 place count 2127 transition count 1845
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1118 place count 2125 transition count 1845
Performed 318 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 318 Pre rules applied. Total rules applied 1118 place count 2125 transition count 1527
Deduced a syphon composed of 318 places in 2 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 3 with 636 rules applied. Total rules applied 1754 place count 1807 transition count 1527
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1758 place count 1803 transition count 1523
Iterating global reduction 3 with 4 rules applied. Total rules applied 1762 place count 1803 transition count 1523
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1762 place count 1803 transition count 1519
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1770 place count 1799 transition count 1519
Performed 676 Post agglomeration using F-continuation condition.Transition count delta: 676
Deduced a syphon composed of 676 places in 1 ms
Reduce places removed 676 places and 0 transitions.
Iterating global reduction 3 with 1352 rules applied. Total rules applied 3122 place count 1123 transition count 843
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3123 place count 1123 transition count 842
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3125 place count 1122 transition count 841
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3327 place count 1021 transition count 841
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3363 place count 1003 transition count 841
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3364 place count 1002 transition count 840
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3365 place count 1001 transition count 840
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3365 place count 1001 transition count 838
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3369 place count 999 transition count 838
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3370 place count 998 transition count 837
Applied a total of 3370 rules in 632 ms. Remains 998 /2685 variables (removed 1687) and now considering 837/2405 (removed 1568) transitions.
// Phase 1: matrix 837 rows 998 cols
[2021-06-06 02:02:52] [INFO ] Computed 440 place invariants in 1 ms
[2021-06-06 02:02:53] [INFO ] Implicit Places using invariants in 681 ms returned [981, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 695 ms to find 2 implicit places.
[2021-06-06 02:02:53] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 837 rows 996 cols
[2021-06-06 02:02:53] [INFO ] Computed 438 place invariants in 2 ms
[2021-06-06 02:02:53] [INFO ] Dead Transitions using invariants and state equation in 414 ms returned []
Starting structural reductions, iteration 1 : 996/2685 places, 837/2405 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 994 transition count 835
Applied a total of 4 rules in 41 ms. Remains 994 /996 variables (removed 2) and now considering 835/837 (removed 2) transitions.
// Phase 1: matrix 835 rows 994 cols
[2021-06-06 02:02:53] [INFO ] Computed 438 place invariants in 1 ms
[2021-06-06 02:02:54] [INFO ] Implicit Places using invariants in 537 ms returned []
// Phase 1: matrix 835 rows 994 cols
[2021-06-06 02:02:54] [INFO ] Computed 438 place invariants in 1 ms
[2021-06-06 02:02:55] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1491 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 994/2685 places, 835/2405 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s453 1) (AND (EQ s166 1) (EQ s168 1)) (AND (EQ s86 1) (EQ s88 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 707 ms.
Stack based approach found an accepted trace after 46 steps with 0 reset with depth 47 and stack size 47 in 1 ms.
FORMULA ShieldPPPt-PT-040B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-09 finished in 4054 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 2685 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2685/2685 places, 2405/2405 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 557 rules applied. Total rules applied 557 place count 2684 transition count 1847
Reduce places removed 557 places and 0 transitions.
Iterating post reduction 1 with 557 rules applied. Total rules applied 1114 place count 2127 transition count 1847
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 1114 place count 2127 transition count 1528
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1752 place count 1808 transition count 1528
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1756 place count 1804 transition count 1524
Iterating global reduction 2 with 4 rules applied. Total rules applied 1760 place count 1804 transition count 1524
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1760 place count 1804 transition count 1520
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1768 place count 1800 transition count 1520
Performed 676 Post agglomeration using F-continuation condition.Transition count delta: 676
Deduced a syphon composed of 676 places in 1 ms
Reduce places removed 676 places and 0 transitions.
Iterating global reduction 2 with 1352 rules applied. Total rules applied 3120 place count 1124 transition count 844
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3121 place count 1124 transition count 843
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3123 place count 1123 transition count 842
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3325 place count 1022 transition count 842
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3361 place count 1004 transition count 842
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3362 place count 1003 transition count 841
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3363 place count 1002 transition count 841
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3363 place count 1002 transition count 839
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3367 place count 1000 transition count 839
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3368 place count 999 transition count 838
Applied a total of 3368 rules in 498 ms. Remains 999 /2685 variables (removed 1686) and now considering 838/2405 (removed 1567) transitions.
// Phase 1: matrix 838 rows 999 cols
[2021-06-06 02:02:56] [INFO ] Computed 440 place invariants in 3 ms
[2021-06-06 02:02:56] [INFO ] Implicit Places using invariants in 541 ms returned [982, 986]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 552 ms to find 2 implicit places.
[2021-06-06 02:02:56] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 838 rows 997 cols
[2021-06-06 02:02:56] [INFO ] Computed 438 place invariants in 1 ms
[2021-06-06 02:02:57] [INFO ] Dead Transitions using invariants and state equation in 428 ms returned []
Starting structural reductions, iteration 1 : 997/2685 places, 838/2405 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 995 transition count 836
Applied a total of 4 rules in 39 ms. Remains 995 /997 variables (removed 2) and now considering 836/838 (removed 2) transitions.
// Phase 1: matrix 836 rows 995 cols
[2021-06-06 02:02:57] [INFO ] Computed 438 place invariants in 3 ms
[2021-06-06 02:02:57] [INFO ] Implicit Places using invariants in 551 ms returned []
// Phase 1: matrix 836 rows 995 cols
[2021-06-06 02:02:57] [INFO ] Computed 438 place invariants in 2 ms
[2021-06-06 02:02:58] [INFO ] Implicit Places using invariants and state equation in 983 ms returned []
Implicit Place search using SMT with State Equation took 1555 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 995/2685 places, 836/2405 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s280 1) (NEQ s298 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 691 ms.
Product exploration explored 100000 steps with 0 reset in 857 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 695 ms.
Product exploration explored 100000 steps with 0 reset in 906 ms.
[2021-06-06 02:03:02] [INFO ] Flatten gal took : 32 ms
[2021-06-06 02:03:02] [INFO ] Flatten gal took : 29 ms
[2021-06-06 02:03:02] [INFO ] Time to serialize gal into /tmp/LTL10247462521650684191.gal : 3 ms
[2021-06-06 02:03:02] [INFO ] Time to serialize properties into /tmp/LTL12775996200249872044.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10247462521650684191.gal, -t, CGAL, -LTL, /tmp/LTL12775996200249872044.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10247462521650684191.gal -t CGAL -LTL /tmp/LTL12775996200249872044.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("((p901!=1)||(p937!=1))"))))
Formula 0 simplified : !FG"((p901!=1)||(p937!=1))"
Detected timeout of ITS tools.
[2021-06-06 02:03:17] [INFO ] Flatten gal took : 25 ms
[2021-06-06 02:03:17] [INFO ] Applying decomposition
[2021-06-06 02:03:17] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10271055781922908262.txt, -o, /tmp/graph10271055781922908262.bin, -w, /tmp/graph10271055781922908262.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10271055781922908262.bin, -l, -1, -v, -w, /tmp/graph10271055781922908262.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-06 02:03:17] [INFO ] Decomposing Gal with order
[2021-06-06 02:03:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 02:03:17] [INFO ] Removed a total of 245 redundant transitions.
[2021-06-06 02:03:17] [INFO ] Flatten gal took : 48 ms
[2021-06-06 02:03:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 238 labels/synchronizations in 7 ms.
[2021-06-06 02:03:17] [INFO ] Time to serialize gal into /tmp/LTL14790592359242485241.gal : 6 ms
[2021-06-06 02:03:17] [INFO ] Time to serialize properties into /tmp/LTL7859650993869748987.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14790592359242485241.gal, -t, CGAL, -LTL, /tmp/LTL7859650993869748987.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14790592359242485241.gal -t CGAL -LTL /tmp/LTL7859650993869748987.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("((i11.u91.p901!=1)||(i11.u97.p937!=1))"))))
Formula 0 simplified : !FG"((i11.u91.p901!=1)||(i11.u97.p937!=1))"
Reverse transition relation is NOT exact ! Due to transitions i11.t119, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/674/1/675
Computing Next relation with stutter on 6.79862e+65 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
324 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.34139,138820,1,0,273772,228,5481,650097,555,777,278695
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-040B-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldPPPt-PT-040B-10 finished in 25736 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 2685 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2685/2685 places, 2405/2405 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2684 transition count 1846
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 2126 transition count 1846
Performed 318 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 318 Pre rules applied. Total rules applied 1116 place count 2126 transition count 1528
Deduced a syphon composed of 318 places in 2 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 2 with 636 rules applied. Total rules applied 1752 place count 1808 transition count 1528
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1756 place count 1804 transition count 1524
Iterating global reduction 2 with 4 rules applied. Total rules applied 1760 place count 1804 transition count 1524
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1760 place count 1804 transition count 1520
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1768 place count 1800 transition count 1520
Performed 675 Post agglomeration using F-continuation condition.Transition count delta: 675
Deduced a syphon composed of 675 places in 0 ms
Reduce places removed 675 places and 0 transitions.
Iterating global reduction 2 with 1350 rules applied. Total rules applied 3118 place count 1125 transition count 845
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3119 place count 1125 transition count 844
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3121 place count 1124 transition count 843
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3323 place count 1023 transition count 843
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3359 place count 1005 transition count 843
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3360 place count 1004 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3361 place count 1003 transition count 842
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3361 place count 1003 transition count 840
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3365 place count 1001 transition count 840
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3366 place count 1000 transition count 839
Applied a total of 3366 rules in 533 ms. Remains 1000 /2685 variables (removed 1685) and now considering 839/2405 (removed 1566) transitions.
// Phase 1: matrix 839 rows 1000 cols
[2021-06-06 02:03:22] [INFO ] Computed 440 place invariants in 15 ms
[2021-06-06 02:03:22] [INFO ] Implicit Places using invariants in 520 ms returned [983, 987]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 522 ms to find 2 implicit places.
[2021-06-06 02:03:22] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 839 rows 998 cols
[2021-06-06 02:03:22] [INFO ] Computed 438 place invariants in 2 ms
[2021-06-06 02:03:23] [INFO ] Dead Transitions using invariants and state equation in 443 ms returned []
Starting structural reductions, iteration 1 : 998/2685 places, 839/2405 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 996 transition count 837
Applied a total of 4 rules in 40 ms. Remains 996 /998 variables (removed 2) and now considering 837/839 (removed 2) transitions.
// Phase 1: matrix 837 rows 996 cols
[2021-06-06 02:03:23] [INFO ] Computed 438 place invariants in 7 ms
[2021-06-06 02:03:23] [INFO ] Implicit Places using invariants in 483 ms returned []
// Phase 1: matrix 837 rows 996 cols
[2021-06-06 02:03:23] [INFO ] Computed 438 place invariants in 7 ms
[2021-06-06 02:03:24] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1436 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 996/2685 places, 837/2405 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s803 1) (EQ s828 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 126 reset in 687 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA ShieldPPPt-PT-040B-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-11 finished in 3722 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0) U p1)&&G(p2)))], workingDir=/home/mcc/execution]
Support contains 2 out of 2685 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2685/2685 places, 2405/2405 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2684 transition count 1845
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 2125 transition count 1845
Performed 318 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 318 Pre rules applied. Total rules applied 1118 place count 2125 transition count 1527
Deduced a syphon composed of 318 places in 1 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 2 with 636 rules applied. Total rules applied 1754 place count 1807 transition count 1527
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1758 place count 1803 transition count 1523
Iterating global reduction 2 with 4 rules applied. Total rules applied 1762 place count 1803 transition count 1523
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1762 place count 1803 transition count 1519
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1770 place count 1799 transition count 1519
Performed 674 Post agglomeration using F-continuation condition.Transition count delta: 674
Deduced a syphon composed of 674 places in 0 ms
Reduce places removed 674 places and 0 transitions.
Iterating global reduction 2 with 1348 rules applied. Total rules applied 3118 place count 1125 transition count 845
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3119 place count 1125 transition count 844
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3121 place count 1124 transition count 843
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3323 place count 1023 transition count 843
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3359 place count 1005 transition count 843
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3360 place count 1004 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3361 place count 1003 transition count 842
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3361 place count 1003 transition count 840
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3365 place count 1001 transition count 840
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3366 place count 1000 transition count 839
Applied a total of 3366 rules in 504 ms. Remains 1000 /2685 variables (removed 1685) and now considering 839/2405 (removed 1566) transitions.
// Phase 1: matrix 839 rows 1000 cols
[2021-06-06 02:03:25] [INFO ] Computed 440 place invariants in 5 ms
[2021-06-06 02:03:26] [INFO ] Implicit Places using invariants in 493 ms returned [983, 987]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 494 ms to find 2 implicit places.
[2021-06-06 02:03:26] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 839 rows 998 cols
[2021-06-06 02:03:26] [INFO ] Computed 438 place invariants in 2 ms
[2021-06-06 02:03:26] [INFO ] Dead Transitions using invariants and state equation in 419 ms returned []
Starting structural reductions, iteration 1 : 998/2685 places, 839/2405 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 996 transition count 837
Applied a total of 4 rules in 39 ms. Remains 996 /998 variables (removed 2) and now considering 837/839 (removed 2) transitions.
// Phase 1: matrix 837 rows 996 cols
[2021-06-06 02:03:26] [INFO ] Computed 438 place invariants in 3 ms
[2021-06-06 02:03:27] [INFO ] Implicit Places using invariants in 479 ms returned []
// Phase 1: matrix 837 rows 996 cols
[2021-06-06 02:03:27] [INFO ] Computed 438 place invariants in 3 ms
[2021-06-06 02:03:27] [INFO ] State equation strengthened by 154 read => feed constraints.
[2021-06-06 02:03:29] [INFO ] Implicit Places using invariants and state equation in 2295 ms returned []
Implicit Place search using SMT with State Equation took 2775 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 996/2685 places, 837/2405 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p2)), true]
Running random walk in product with property : ShieldPPPt-PT-040B-13 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0 p2), acceptance={0} source=1 dest: 3}, { cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s807 0), p0:(EQ s807 1), p2:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-040B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-13 finished in 4438 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 2685 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2685/2685 places, 2405/2405 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2684 transition count 1846
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 2126 transition count 1846
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 1116 place count 2126 transition count 1527
Deduced a syphon composed of 319 places in 1 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1754 place count 1807 transition count 1527
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1757 place count 1804 transition count 1524
Iterating global reduction 2 with 3 rules applied. Total rules applied 1760 place count 1804 transition count 1524
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1760 place count 1804 transition count 1521
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1766 place count 1801 transition count 1521
Performed 676 Post agglomeration using F-continuation condition.Transition count delta: 676
Deduced a syphon composed of 676 places in 1 ms
Reduce places removed 676 places and 0 transitions.
Iterating global reduction 2 with 1352 rules applied. Total rules applied 3118 place count 1125 transition count 845
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3119 place count 1125 transition count 844
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3121 place count 1124 transition count 843
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3323 place count 1023 transition count 843
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3359 place count 1005 transition count 843
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3360 place count 1004 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3361 place count 1003 transition count 842
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3361 place count 1003 transition count 840
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3365 place count 1001 transition count 840
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3366 place count 1000 transition count 839
Applied a total of 3366 rules in 477 ms. Remains 1000 /2685 variables (removed 1685) and now considering 839/2405 (removed 1566) transitions.
// Phase 1: matrix 839 rows 1000 cols
[2021-06-06 02:03:30] [INFO ] Computed 440 place invariants in 3 ms
[2021-06-06 02:03:30] [INFO ] Implicit Places using invariants in 479 ms returned [983, 987]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 481 ms to find 2 implicit places.
[2021-06-06 02:03:30] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 839 rows 998 cols
[2021-06-06 02:03:30] [INFO ] Computed 438 place invariants in 1 ms
[2021-06-06 02:03:31] [INFO ] Dead Transitions using invariants and state equation in 405 ms returned []
Starting structural reductions, iteration 1 : 998/2685 places, 839/2405 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 996 transition count 837
Applied a total of 4 rules in 38 ms. Remains 996 /998 variables (removed 2) and now considering 837/839 (removed 2) transitions.
// Phase 1: matrix 837 rows 996 cols
[2021-06-06 02:03:31] [INFO ] Computed 438 place invariants in 3 ms
[2021-06-06 02:03:31] [INFO ] Implicit Places using invariants in 471 ms returned []
// Phase 1: matrix 837 rows 996 cols
[2021-06-06 02:03:31] [INFO ] Computed 438 place invariants in 1 ms
[2021-06-06 02:03:32] [INFO ] State equation strengthened by 7 read => feed constraints.
[2021-06-06 02:03:32] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1568 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 996/2685 places, 837/2405 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-040B-14 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s302 1), p1:(NEQ s126 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 700 ms.
Product exploration explored 100000 steps with 0 reset in 908 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 712 ms.
Product exploration explored 100000 steps with 0 reset in 884 ms.
[2021-06-06 02:03:36] [INFO ] Flatten gal took : 27 ms
[2021-06-06 02:03:36] [INFO ] Flatten gal took : 25 ms
[2021-06-06 02:03:36] [INFO ] Time to serialize gal into /tmp/LTL7112373601982503692.gal : 3 ms
[2021-06-06 02:03:36] [INFO ] Time to serialize properties into /tmp/LTL12286440407105281561.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7112373601982503692.gal, -t, CGAL, -LTL, /tmp/LTL12286440407105281561.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7112373601982503692.gal -t CGAL -LTL /tmp/LTL12286440407105281561.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("(p952!=1)"))||(G("(p417!=1)")))))
Formula 0 simplified : !F(G"(p952!=1)" | G"(p417!=1)")
Detected timeout of ITS tools.
[2021-06-06 02:03:51] [INFO ] Flatten gal took : 27 ms
[2021-06-06 02:03:51] [INFO ] Applying decomposition
[2021-06-06 02:03:51] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3277566877451378319.txt, -o, /tmp/graph3277566877451378319.bin, -w, /tmp/graph3277566877451378319.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3277566877451378319.bin, -l, -1, -v, -w, /tmp/graph3277566877451378319.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-06 02:03:51] [INFO ] Decomposing Gal with order
[2021-06-06 02:03:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 02:03:51] [INFO ] Removed a total of 245 redundant transitions.
[2021-06-06 02:03:51] [INFO ] Flatten gal took : 43 ms
[2021-06-06 02:03:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 238 labels/synchronizations in 6 ms.
[2021-06-06 02:03:51] [INFO ] Time to serialize gal into /tmp/LTL17879529725233943442.gal : 5 ms
[2021-06-06 02:03:51] [INFO ] Time to serialize properties into /tmp/LTL17157619247638907227.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17879529725233943442.gal, -t, CGAL, -LTL, /tmp/LTL17157619247638907227.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17879529725233943442.gal -t CGAL -LTL /tmp/LTL17157619247638907227.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G("(i11.u97.p952!=1)"))||(G("(i4.u41.p417!=1)")))))
Formula 0 simplified : !F(G"(i11.u97.p952!=1)" | G"(i4.u41.p417!=1)")
Reverse transition relation is NOT exact ! Due to transitions i0.t2, i0.t1, i0.t0, i0.u1.t643, i1.t5, i1.t4, i1.t3, i1.u10.t648, i2.t8, i2.t7, i2.t6, i2.u18.t653, i3.t208_t207, i3.t205_t202, i3.t11, i3.t10, i3.t9, i3.u26.t658, i4.t213_t210, i4.t14, i4.t13, i4.t12, i4.u40.t217.t215, i4.u34.t663, i4.u41.t120, i5.t16, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/650/26/676
Computing Next relation with stutter on 6.79862e+65 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin916345996019715561
[2021-06-06 02:04:06] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin916345996019715561
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin916345996019715561]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin916345996019715561] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin916345996019715561] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldPPPt-PT-040B-14 finished in 37784 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0&&(p1||X(F(p2))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 2685 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2685/2685 places, 2405/2405 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2681 transition count 2401
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2681 transition count 2401
Applied a total of 8 rules in 410 ms. Remains 2681 /2685 variables (removed 4) and now considering 2401/2405 (removed 4) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:04:07] [INFO ] Computed 441 place invariants in 9 ms
[2021-06-06 02:04:08] [INFO ] Implicit Places using invariants in 873 ms returned []
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:04:08] [INFO ] Computed 441 place invariants in 5 ms
[2021-06-06 02:04:11] [INFO ] Implicit Places using invariants and state equation in 2504 ms returned []
Implicit Place search using SMT with State Equation took 3378 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:04:11] [INFO ] Computed 441 place invariants in 11 ms
[2021-06-06 02:04:12] [INFO ] Dead Transitions using invariants and state equation in 1621 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2681/2685 places, 2401/2405 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-040B-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s664 1), p1:(EQ s664 0), p2:(EQ s373 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-040B-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-15 finished in 5709 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14097067395134429686
[2021-06-06 02:04:13] [INFO ] Too many transitions (2405) to apply POR reductions. Disabling POR matrices.
[2021-06-06 02:04:13] [INFO ] Applying decomposition
[2021-06-06 02:04:13] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14097067395134429686
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14097067395134429686]
[2021-06-06 02:04:13] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10047076006889101493.txt, -o, /tmp/graph10047076006889101493.bin, -w, /tmp/graph10047076006889101493.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10047076006889101493.bin, -l, -1, -v, -w, /tmp/graph10047076006889101493.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-06 02:04:13] [INFO ] Decomposing Gal with order
[2021-06-06 02:04:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 02:04:13] [INFO ] Removed a total of 396 redundant transitions.
[2021-06-06 02:04:13] [INFO ] Flatten gal took : 105 ms
[2021-06-06 02:04:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2021-06-06 02:04:13] [INFO ] Time to serialize gal into /tmp/LTLFireability12671463900074247998.gal : 16 ms
[2021-06-06 02:04:13] [INFO ] Time to serialize properties into /tmp/LTLFireability13661642879107790634.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability12671463900074247998.gal, -t, CGAL, -LTL, /tmp/LTLFireability13661642879107790634.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability12671463900074247998.gal -t CGAL -LTL /tmp/LTLFireability13661642879107790634.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((G((F("(i30.i1.i2.u716.p2311!=1)"))&&(F(G(("(i34.u822.p2665!=1)")||(X(!("((i28.u665.p2152==1)&&(i28.u674.p2185==1))")))))))))
Formula 0 simplified : !G(F"(i30.i1.i2.u716.p2311!=1)" & FG("(i34.u822.p2665!=1)" | X!"((i28.u665.p2152==1)&&(i28.u674.p2185==1))"))
Compilation finished in 24545 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14097067395134429686]
Link finished in 68 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, []((<>((LTLAPp0==true))&&<>([](((LTLAPp1==true)||X((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14097067395134429686]
WARNING : LTSmin timed out (>276 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, []((<>((LTLAPp0==true))&&<>([](((LTLAPp1==true)||X((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14097067395134429686]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(([]((LTLAPp3==true))||[]((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin14097067395134429686]
WARNING : LTSmin timed out (>276 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(([]((LTLAPp3==true))||[]((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin14097067395134429686]
Retrying LTSmin with larger timeout 2208 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, []((<>((LTLAPp0==true))&&<>([](((LTLAPp1==true)||X((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14097067395134429686]
Detected timeout of ITS tools.
[2021-06-06 02:26:14] [INFO ] Applying decomposition
[2021-06-06 02:26:14] [INFO ] Flatten gal took : 101 ms
[2021-06-06 02:26:14] [INFO ] Decomposing Gal with order
[2021-06-06 02:26:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 02:26:15] [INFO ] Removed a total of 118 redundant transitions.
[2021-06-06 02:26:15] [INFO ] Flatten gal took : 266 ms
[2021-06-06 02:26:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 470 labels/synchronizations in 164 ms.
[2021-06-06 02:26:16] [INFO ] Time to serialize gal into /tmp/LTLFireability7504533022589661799.gal : 71 ms
[2021-06-06 02:26:16] [INFO ] Time to serialize properties into /tmp/LTLFireability13054042473639818401.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability7504533022589661799.gal, -t, CGAL, -LTL, /tmp/LTLFireability13054042473639818401.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability7504533022589661799.gal -t CGAL -LTL /tmp/LTLFireability13054042473639818401.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((G((F("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u667.p2311!=1)"))&&(F(G(("(i0.i0.i0.i0.i0.i1.i0.i0.i0.u1092.p2665!=1)")||(X(!("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i1.u624.p2152==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u627.p2185==1))")))))))))
Formula 0 simplified : !G(F"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u667.p2311!=1)" & FG("(i0.i0.i0.i0.i0.i1.i0.i0.i0.u1092.p2665!=1)" | X!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i1.u624.p2152==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u627.p2185==1))"))
Detected timeout of ITS tools.
[2021-06-06 02:48:17] [INFO ] Flatten gal took : 170 ms
[2021-06-06 02:48:17] [INFO ] Input system was already deterministic with 2405 transitions.
[2021-06-06 02:48:17] [INFO ] Transformed 2685 places.
[2021-06-06 02:48:17] [INFO ] Transformed 2405 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-06-06 02:48:18] [INFO ] Time to serialize gal into /tmp/LTLFireability10208154602627938158.gal : 6 ms
[2021-06-06 02:48:19] [INFO ] Time to serialize properties into /tmp/LTLFireability9493366249339187623.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability10208154602627938158.gal, -t, CGAL, -LTL, /tmp/LTLFireability9493366249339187623.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability10208154602627938158.gal -t CGAL -LTL /tmp/LTLFireability9493366249339187623.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F("(p2311!=1)"))&&(F(G(("(p2665!=1)")||(X(!("((p2152==1)&&(p2185==1))")))))))))
Formula 0 simplified : !G(F"(p2311!=1)" & FG("(p2665!=1)" | X!"((p2152==1)&&(p2185==1))"))
WARNING : LTSmin timed out (>2208 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, []((<>((LTLAPp0==true))&&<>([](((LTLAPp1==true)||X((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14097067395134429686]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(([]((LTLAPp3==true))||[]((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin14097067395134429686]

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-040B"
export BK_EXAMINATION="LTLFireability"
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-040B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r216-tall-162098205800906"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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