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.r235-smll-162106564800317.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 ShieldRVt-PT-040B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-smll-162106564800317
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K 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 100K 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.3K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 19:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 19:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 489K 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 ShieldRVt-PT-040B-00
FORMULA_NAME ShieldRVt-PT-040B-01
FORMULA_NAME ShieldRVt-PT-040B-02
FORMULA_NAME ShieldRVt-PT-040B-03
FORMULA_NAME ShieldRVt-PT-040B-04
FORMULA_NAME ShieldRVt-PT-040B-05
FORMULA_NAME ShieldRVt-PT-040B-06
FORMULA_NAME ShieldRVt-PT-040B-07
FORMULA_NAME ShieldRVt-PT-040B-08
FORMULA_NAME ShieldRVt-PT-040B-09
FORMULA_NAME ShieldRVt-PT-040B-10
FORMULA_NAME ShieldRVt-PT-040B-11
FORMULA_NAME ShieldRVt-PT-040B-12
FORMULA_NAME ShieldRVt-PT-040B-13
FORMULA_NAME ShieldRVt-PT-040B-14
FORMULA_NAME ShieldRVt-PT-040B-15

=== Now, execution of the tool begins

BK_START 1621279504979

Running Version 0
[2021-05-17 19:25:08] [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-05-17 19:25:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 19:25:08] [INFO ] Load time of PNML (sax parser for PT used): 341 ms
[2021-05-17 19:25:08] [INFO ] Transformed 2003 places.
[2021-05-17 19:25:08] [INFO ] Transformed 2003 transitions.
[2021-05-17 19:25:08] [INFO ] Found NUPN structural information;
[2021-05-17 19:25:08] [INFO ] Parsed PT model containing 2003 places and 2003 transitions in 494 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 19:25:08] [INFO ] Initial state test concluded for 4 properties.
FORMULA ShieldRVt-PT-040B-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 2003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Discarding 433 places :
Symmetric choice reduction at 0 with 433 rule applications. Total rules 433 place count 1570 transition count 1570
Iterating global reduction 0 with 433 rules applied. Total rules applied 866 place count 1570 transition count 1570
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 867 place count 1569 transition count 1569
Iterating global reduction 0 with 1 rules applied. Total rules applied 868 place count 1569 transition count 1569
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 869 place count 1568 transition count 1568
Iterating global reduction 0 with 1 rules applied. Total rules applied 870 place count 1568 transition count 1568
Applied a total of 870 rules in 1064 ms. Remains 1568 /2003 variables (removed 435) and now considering 1568/2003 (removed 435) transitions.
// Phase 1: matrix 1568 rows 1568 cols
[2021-05-17 19:25:10] [INFO ] Computed 161 place invariants in 53 ms
[2021-05-17 19:25:11] [INFO ] Implicit Places using invariants in 1353 ms returned []
// Phase 1: matrix 1568 rows 1568 cols
[2021-05-17 19:25:11] [INFO ] Computed 161 place invariants in 18 ms
[2021-05-17 19:25:13] [INFO ] Implicit Places using invariants and state equation in 2251 ms returned []
Implicit Place search using SMT with State Equation took 3647 ms to find 0 implicit places.
// Phase 1: matrix 1568 rows 1568 cols
[2021-05-17 19:25:13] [INFO ] Computed 161 place invariants in 18 ms
[2021-05-17 19:25:15] [INFO ] Dead Transitions using invariants and state equation in 1803 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1568/2003 places, 1568/2003 transitions.
[2021-05-17 19:25:16] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 19:25:16] [INFO ] Flatten gal took : 252 ms
FORMULA ShieldRVt-PT-040B-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 19:25:16] [INFO ] Flatten gal took : 168 ms
[2021-05-17 19:25:16] [INFO ] Input system was already deterministic with 1568 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 792 ms. (steps per millisecond=126 ) properties (out of 21) seen :11
Running SMT prover for 10 properties.
// Phase 1: matrix 1568 rows 1568 cols
[2021-05-17 19:25:17] [INFO ] Computed 161 place invariants in 6 ms
[2021-05-17 19:25:17] [INFO ] [Real]Absence check using 161 positive place invariants in 130 ms returned sat
[2021-05-17 19:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:25:18] [INFO ] [Real]Absence check using state equation in 975 ms returned sat
[2021-05-17 19:25:20] [INFO ] Deduced a trap composed of 21 places in 1226 ms of which 8 ms to minimize.
[2021-05-17 19:25:21] [INFO ] Deduced a trap composed of 44 places in 938 ms of which 4 ms to minimize.
[2021-05-17 19:25:22] [INFO ] Deduced a trap composed of 26 places in 849 ms of which 3 ms to minimize.
[2021-05-17 19:25:23] [INFO ] Deduced a trap composed of 29 places in 848 ms of which 2 ms to minimize.
[2021-05-17 19:25:24] [INFO ] Deduced a trap composed of 28 places in 720 ms of which 17 ms to minimize.
[2021-05-17 19:25:25] [INFO ] Deduced a trap composed of 23 places in 713 ms of which 2 ms to minimize.
[2021-05-17 19:25:26] [INFO ] Deduced a trap composed of 33 places in 877 ms of which 2 ms to minimize.
[2021-05-17 19:25:26] [INFO ] Deduced a trap composed of 56 places in 772 ms of which 1 ms to minimize.
[2021-05-17 19:25:27] [INFO ] Deduced a trap composed of 37 places in 731 ms of which 2 ms to minimize.
[2021-05-17 19:25:28] [INFO ] Deduced a trap composed of 22 places in 590 ms of which 1 ms to minimize.
[2021-05-17 19:25:29] [INFO ] Deduced a trap composed of 23 places in 781 ms of which 2 ms to minimize.
[2021-05-17 19:25:30] [INFO ] Deduced a trap composed of 21 places in 753 ms of which 2 ms to minimize.
[2021-05-17 19:25:31] [INFO ] Deduced a trap composed of 28 places in 739 ms of which 2 ms to minimize.
[2021-05-17 19:25:31] [INFO ] Deduced a trap composed of 23 places in 757 ms of which 2 ms to minimize.
[2021-05-17 19:25:32] [INFO ] Deduced a trap composed of 48 places in 761 ms of which 1 ms to minimize.
[2021-05-17 19:25:33] [INFO ] Deduced a trap composed of 30 places in 669 ms of which 1 ms to minimize.
[2021-05-17 19:25:34] [INFO ] Deduced a trap composed of 48 places in 462 ms of which 1 ms to minimize.
[2021-05-17 19:25:34] [INFO ] Deduced a trap composed of 35 places in 454 ms of which 1 ms to minimize.
[2021-05-17 19:25:35] [INFO ] Deduced a trap composed of 22 places in 728 ms of which 1 ms to minimize.
[2021-05-17 19:25:36] [INFO ] Deduced a trap composed of 45 places in 629 ms of which 2 ms to minimize.
[2021-05-17 19:25:37] [INFO ] Deduced a trap composed of 57 places in 647 ms of which 2 ms to minimize.
[2021-05-17 19:25:37] [INFO ] Deduced a trap composed of 40 places in 696 ms of which 2 ms to minimize.
[2021-05-17 19:25:37] [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-05-17 19:25:38] [INFO ] [Real]Absence check using 161 positive place invariants in 128 ms returned sat
[2021-05-17 19:25:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:25:39] [INFO ] [Real]Absence check using state equation in 1093 ms returned sat
[2021-05-17 19:25:40] [INFO ] Deduced a trap composed of 20 places in 793 ms of which 2 ms to minimize.
[2021-05-17 19:25:41] [INFO ] Deduced a trap composed of 35 places in 761 ms of which 2 ms to minimize.
[2021-05-17 19:25:41] [INFO ] Deduced a trap composed of 57 places in 516 ms of which 2 ms to minimize.
[2021-05-17 19:25:42] [INFO ] Deduced a trap composed of 49 places in 867 ms of which 2 ms to minimize.
[2021-05-17 19:25:43] [INFO ] Deduced a trap composed of 37 places in 826 ms of which 1 ms to minimize.
[2021-05-17 19:25:44] [INFO ] Deduced a trap composed of 48 places in 555 ms of which 1 ms to minimize.
[2021-05-17 19:25:45] [INFO ] Deduced a trap composed of 50 places in 674 ms of which 1 ms to minimize.
[2021-05-17 19:25:45] [INFO ] Deduced a trap composed of 27 places in 844 ms of which 2 ms to minimize.
[2021-05-17 19:25:46] [INFO ] Deduced a trap composed of 35 places in 763 ms of which 1 ms to minimize.
[2021-05-17 19:25:47] [INFO ] Deduced a trap composed of 40 places in 644 ms of which 2 ms to minimize.
[2021-05-17 19:25:48] [INFO ] Deduced a trap composed of 50 places in 508 ms of which 2 ms to minimize.
[2021-05-17 19:25:49] [INFO ] Deduced a trap composed of 37 places in 797 ms of which 1 ms to minimize.
[2021-05-17 19:25:49] [INFO ] Deduced a trap composed of 31 places in 565 ms of which 2 ms to minimize.
[2021-05-17 19:25:50] [INFO ] Deduced a trap composed of 25 places in 753 ms of which 2 ms to minimize.
[2021-05-17 19:25:51] [INFO ] Deduced a trap composed of 28 places in 471 ms of which 1 ms to minimize.
[2021-05-17 19:25:51] [INFO ] Deduced a trap composed of 38 places in 534 ms of which 1 ms to minimize.
[2021-05-17 19:25:52] [INFO ] Deduced a trap composed of 38 places in 585 ms of which 1 ms to minimize.
[2021-05-17 19:25:53] [INFO ] Deduced a trap composed of 36 places in 666 ms of which 3 ms to minimize.
[2021-05-17 19:25:54] [INFO ] Deduced a trap composed of 39 places in 686 ms of which 2 ms to minimize.
[2021-05-17 19:25:54] [INFO ] Deduced a trap composed of 26 places in 647 ms of which 2 ms to minimize.
[2021-05-17 19:25:55] [INFO ] Deduced a trap composed of 48 places in 673 ms of which 2 ms to minimize.
[2021-05-17 19:25:56] [INFO ] Deduced a trap composed of 32 places in 660 ms of which 2 ms to minimize.
[2021-05-17 19:25:57] [INFO ] Deduced a trap composed of 48 places in 668 ms of which 1 ms to minimize.
[2021-05-17 19:25:57] [INFO ] Deduced a trap composed of 25 places in 634 ms of which 1 ms to minimize.
[2021-05-17 19:25:59] [INFO ] Deduced a trap composed of 14 places in 1329 ms of which 3 ms to minimize.
[2021-05-17 19:25:59] [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-05-17 19:25:59] [INFO ] [Real]Absence check using 161 positive place invariants in 87 ms returned sat
[2021-05-17 19:25:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:26:00] [INFO ] [Real]Absence check using state equation in 1043 ms returned sat
[2021-05-17 19:26:01] [INFO ] Deduced a trap composed of 31 places in 682 ms of which 2 ms to minimize.
[2021-05-17 19:26:02] [INFO ] Deduced a trap composed of 21 places in 799 ms of which 1 ms to minimize.
[2021-05-17 19:26:02] [INFO ] Deduced a trap composed of 34 places in 599 ms of which 2 ms to minimize.
[2021-05-17 19:26:03] [INFO ] Deduced a trap composed of 30 places in 618 ms of which 3 ms to minimize.
[2021-05-17 19:26:04] [INFO ] Deduced a trap composed of 23 places in 666 ms of which 2 ms to minimize.
[2021-05-17 19:26:05] [INFO ] Deduced a trap composed of 39 places in 750 ms of which 1 ms to minimize.
[2021-05-17 19:26:05] [INFO ] Deduced a trap composed of 28 places in 613 ms of which 2 ms to minimize.
[2021-05-17 19:26:06] [INFO ] Deduced a trap composed of 20 places in 713 ms of which 1 ms to minimize.
[2021-05-17 19:26:07] [INFO ] Deduced a trap composed of 27 places in 518 ms of which 2 ms to minimize.
[2021-05-17 19:26:07] [INFO ] Deduced a trap composed of 40 places in 562 ms of which 2 ms to minimize.
[2021-05-17 19:26:08] [INFO ] Deduced a trap composed of 47 places in 575 ms of which 1 ms to minimize.
[2021-05-17 19:26:09] [INFO ] Deduced a trap composed of 47 places in 699 ms of which 2 ms to minimize.
[2021-05-17 19:26:10] [INFO ] Deduced a trap composed of 49 places in 704 ms of which 1 ms to minimize.
[2021-05-17 19:26:10] [INFO ] Deduced a trap composed of 57 places in 620 ms of which 2 ms to minimize.
[2021-05-17 19:26:11] [INFO ] Deduced a trap composed of 66 places in 764 ms of which 2 ms to minimize.
[2021-05-17 19:26:12] [INFO ] Deduced a trap composed of 29 places in 660 ms of which 1 ms to minimize.
[2021-05-17 19:26:13] [INFO ] Deduced a trap composed of 43 places in 444 ms of which 1 ms to minimize.
[2021-05-17 19:26:13] [INFO ] Deduced a trap composed of 34 places in 431 ms of which 1 ms to minimize.
[2021-05-17 19:26:14] [INFO ] Deduced a trap composed of 31 places in 484 ms of which 4 ms to minimize.
[2021-05-17 19:26:14] [INFO ] Deduced a trap composed of 39 places in 573 ms of which 4 ms to minimize.
[2021-05-17 19:26:15] [INFO ] Deduced a trap composed of 37 places in 620 ms of which 14 ms to minimize.
[2021-05-17 19:26:16] [INFO ] Deduced a trap composed of 44 places in 599 ms of which 2 ms to minimize.
[2021-05-17 19:26:16] [INFO ] Deduced a trap composed of 32 places in 604 ms of which 2 ms to minimize.
[2021-05-17 19:26:17] [INFO ] Deduced a trap composed of 43 places in 652 ms of which 2 ms to minimize.
[2021-05-17 19:26:18] [INFO ] Deduced a trap composed of 22 places in 637 ms of which 1 ms to minimize.
[2021-05-17 19:26:19] [INFO ] Deduced a trap composed of 22 places in 647 ms of which 2 ms to minimize.
[2021-05-17 19:26:19] [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-05-17 19:26:19] [INFO ] [Real]Absence check using 161 positive place invariants in 130 ms returned sat
[2021-05-17 19:26:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:26:20] [INFO ] [Real]Absence check using state equation in 1097 ms returned sat
[2021-05-17 19:26:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:26:21] [INFO ] [Nat]Absence check using 161 positive place invariants in 135 ms returned sat
[2021-05-17 19:26:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:26:22] [INFO ] [Nat]Absence check using state equation in 1109 ms returned sat
[2021-05-17 19:26:22] [INFO ] Deduced a trap composed of 28 places in 452 ms of which 1 ms to minimize.
[2021-05-17 19:26:23] [INFO ] Deduced a trap composed of 22 places in 674 ms of which 1 ms to minimize.
[2021-05-17 19:26:24] [INFO ] Deduced a trap composed of 23 places in 479 ms of which 2 ms to minimize.
[2021-05-17 19:26:25] [INFO ] Deduced a trap composed of 38 places in 828 ms of which 1 ms to minimize.
[2021-05-17 19:26:25] [INFO ] Deduced a trap composed of 44 places in 542 ms of which 1 ms to minimize.
[2021-05-17 19:26:26] [INFO ] Deduced a trap composed of 30 places in 651 ms of which 2 ms to minimize.
[2021-05-17 19:26:27] [INFO ] Deduced a trap composed of 45 places in 778 ms of which 1 ms to minimize.
[2021-05-17 19:26:28] [INFO ] Deduced a trap composed of 30 places in 716 ms of which 1 ms to minimize.
[2021-05-17 19:26:28] [INFO ] Deduced a trap composed of 19 places in 505 ms of which 1 ms to minimize.
[2021-05-17 19:26:29] [INFO ] Deduced a trap composed of 26 places in 638 ms of which 1 ms to minimize.
[2021-05-17 19:26:30] [INFO ] Deduced a trap composed of 23 places in 673 ms of which 1 ms to minimize.
[2021-05-17 19:26:30] [INFO ] Deduced a trap composed of 47 places in 478 ms of which 1 ms to minimize.
[2021-05-17 19:26:31] [INFO ] Deduced a trap composed of 53 places in 590 ms of which 2 ms to minimize.
[2021-05-17 19:26:32] [INFO ] Deduced a trap composed of 31 places in 618 ms of which 1 ms to minimize.
[2021-05-17 19:26:32] [INFO ] Deduced a trap composed of 38 places in 475 ms of which 2 ms to minimize.
[2021-05-17 19:26:33] [INFO ] Deduced a trap composed of 34 places in 585 ms of which 2 ms to minimize.
[2021-05-17 19:26:34] [INFO ] Deduced a trap composed of 25 places in 593 ms of which 1 ms to minimize.
[2021-05-17 19:26:34] [INFO ] Deduced a trap composed of 69 places in 606 ms of which 1 ms to minimize.
[2021-05-17 19:26:35] [INFO ] Deduced a trap composed of 57 places in 632 ms of which 1 ms to minimize.
[2021-05-17 19:26:36] [INFO ] Deduced a trap composed of 46 places in 665 ms of which 1 ms to minimize.
[2021-05-17 19:26:36] [INFO ] Deduced a trap composed of 52 places in 637 ms of which 2 ms to minimize.
[2021-05-17 19:26:37] [INFO ] Deduced a trap composed of 35 places in 582 ms of which 1 ms to minimize.
[2021-05-17 19:26:38] [INFO ] Deduced a trap composed of 23 places in 405 ms of which 2 ms to minimize.
[2021-05-17 19:26:38] [INFO ] Deduced a trap composed of 21 places in 595 ms of which 1 ms to minimize.
[2021-05-17 19:26:39] [INFO ] Deduced a trap composed of 36 places in 593 ms of which 2 ms to minimize.
[2021-05-17 19:26:40] [INFO ] Deduced a trap composed of 52 places in 588 ms of which 2 ms to minimize.
[2021-05-17 19:26:41] [INFO ] Deduced a trap composed of 53 places in 672 ms of which 2 ms to minimize.
[2021-05-17 19:26: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 3
[2021-05-17 19:26:41] [INFO ] [Real]Absence check using 161 positive place invariants in 141 ms returned sat
[2021-05-17 19:26:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:26:42] [INFO ] [Real]Absence check using state equation in 1034 ms returned sat
[2021-05-17 19:26:43] [INFO ] Deduced a trap composed of 34 places in 555 ms of which 1 ms to minimize.
[2021-05-17 19:26:43] [INFO ] Deduced a trap composed of 37 places in 587 ms of which 2 ms to minimize.
[2021-05-17 19:26:44] [INFO ] Deduced a trap composed of 52 places in 613 ms of which 1 ms to minimize.
[2021-05-17 19:26:45] [INFO ] Deduced a trap composed of 36 places in 628 ms of which 1 ms to minimize.
[2021-05-17 19:26:46] [INFO ] Deduced a trap composed of 38 places in 698 ms of which 2 ms to minimize.
[2021-05-17 19:26:46] [INFO ] Deduced a trap composed of 31 places in 729 ms of which 2 ms to minimize.
[2021-05-17 19:26:47] [INFO ] Deduced a trap composed of 32 places in 785 ms of which 1 ms to minimize.
[2021-05-17 19:26:48] [INFO ] Deduced a trap composed of 52 places in 815 ms of which 1 ms to minimize.
[2021-05-17 19:26:49] [INFO ] Deduced a trap composed of 27 places in 571 ms of which 2 ms to minimize.
[2021-05-17 19:26:50] [INFO ] Deduced a trap composed of 52 places in 744 ms of which 1 ms to minimize.
[2021-05-17 19:26:50] [INFO ] Deduced a trap composed of 22 places in 553 ms of which 2 ms to minimize.
[2021-05-17 19:26:51] [INFO ] Deduced a trap composed of 34 places in 623 ms of which 1 ms to minimize.
[2021-05-17 19:26:52] [INFO ] Deduced a trap composed of 36 places in 588 ms of which 1 ms to minimize.
[2021-05-17 19:26:52] [INFO ] Deduced a trap composed of 35 places in 568 ms of which 2 ms to minimize.
[2021-05-17 19:26:53] [INFO ] Deduced a trap composed of 27 places in 687 ms of which 1 ms to minimize.
[2021-05-17 19:26:54] [INFO ] Deduced a trap composed of 48 places in 735 ms of which 2 ms to minimize.
[2021-05-17 19:26:55] [INFO ] Deduced a trap composed of 28 places in 736 ms of which 1 ms to minimize.
[2021-05-17 19:26:55] [INFO ] Deduced a trap composed of 47 places in 644 ms of which 1 ms to minimize.
[2021-05-17 19:26:56] [INFO ] Deduced a trap composed of 48 places in 711 ms of which 1 ms to minimize.
[2021-05-17 19:26:57] [INFO ] Deduced a trap composed of 35 places in 637 ms of which 2 ms to minimize.
[2021-05-17 19:26:58] [INFO ] Deduced a trap composed of 28 places in 721 ms of which 2 ms to minimize.
[2021-05-17 19:26:59] [INFO ] Deduced a trap composed of 45 places in 705 ms of which 1 ms to minimize.
[2021-05-17 19:26:59] [INFO ] Deduced a trap composed of 52 places in 522 ms of which 2 ms to minimize.
[2021-05-17 19:27:00] [INFO ] Deduced a trap composed of 43 places in 718 ms of which 1 ms to minimize.
[2021-05-17 19:27:01] [INFO ] Deduced a trap composed of 37 places in 645 ms of which 1 ms to minimize.
[2021-05-17 19:27:01] [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-05-17 19:27:01] [INFO ] [Real]Absence check using 161 positive place invariants in 121 ms returned sat
[2021-05-17 19:27:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:27:02] [INFO ] [Real]Absence check using state equation in 1043 ms returned sat
[2021-05-17 19:27:03] [INFO ] Deduced a trap composed of 41 places in 778 ms of which 2 ms to minimize.
[2021-05-17 19:27:04] [INFO ] Deduced a trap composed of 28 places in 875 ms of which 2 ms to minimize.
[2021-05-17 19:27:05] [INFO ] Deduced a trap composed of 25 places in 854 ms of which 1 ms to minimize.
[2021-05-17 19:27:06] [INFO ] Deduced a trap composed of 38 places in 554 ms of which 2 ms to minimize.
[2021-05-17 19:27:07] [INFO ] Deduced a trap composed of 23 places in 687 ms of which 1 ms to minimize.
[2021-05-17 19:27:07] [INFO ] Deduced a trap composed of 28 places in 666 ms of which 2 ms to minimize.
[2021-05-17 19:27:08] [INFO ] Deduced a trap composed of 30 places in 673 ms of which 1 ms to minimize.
[2021-05-17 19:27:09] [INFO ] Deduced a trap composed of 29 places in 662 ms of which 2 ms to minimize.
[2021-05-17 19:27:09] [INFO ] Deduced a trap composed of 37 places in 648 ms of which 1 ms to minimize.
[2021-05-17 19:27:10] [INFO ] Deduced a trap composed of 33 places in 668 ms of which 1 ms to minimize.
[2021-05-17 19:27:11] [INFO ] Deduced a trap composed of 30 places in 685 ms of which 2 ms to minimize.
[2021-05-17 19:27:12] [INFO ] Deduced a trap composed of 27 places in 670 ms of which 1 ms to minimize.
[2021-05-17 19:27:13] [INFO ] Deduced a trap composed of 38 places in 706 ms of which 1 ms to minimize.
[2021-05-17 19:27:13] [INFO ] Deduced a trap composed of 43 places in 497 ms of which 2 ms to minimize.
[2021-05-17 19:27:14] [INFO ] Deduced a trap composed of 38 places in 705 ms of which 2 ms to minimize.
[2021-05-17 19:27:15] [INFO ] Deduced a trap composed of 23 places in 697 ms of which 2 ms to minimize.
[2021-05-17 19:27:16] [INFO ] Deduced a trap composed of 21 places in 685 ms of which 2 ms to minimize.
[2021-05-17 19:27:16] [INFO ] Deduced a trap composed of 34 places in 688 ms of which 1 ms to minimize.
[2021-05-17 19:27:17] [INFO ] Deduced a trap composed of 26 places in 636 ms of which 1 ms to minimize.
[2021-05-17 19:27:18] [INFO ] Deduced a trap composed of 22 places in 444 ms of which 2 ms to minimize.
[2021-05-17 19:27:18] [INFO ] Deduced a trap composed of 30 places in 507 ms of which 1 ms to minimize.
[2021-05-17 19:27:19] [INFO ] Deduced a trap composed of 47 places in 543 ms of which 1 ms to minimize.
[2021-05-17 19:27:20] [INFO ] Deduced a trap composed of 56 places in 562 ms of which 1 ms to minimize.
[2021-05-17 19:27:20] [INFO ] Deduced a trap composed of 32 places in 496 ms of which 1 ms to minimize.
[2021-05-17 19:27:21] [INFO ] Deduced a trap composed of 46 places in 512 ms of which 2 ms to minimize.
[2021-05-17 19:27:21] [INFO ] Deduced a trap composed of 47 places in 582 ms of which 1 ms to minimize.
[2021-05-17 19:27:21] [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-05-17 19:27:22] [INFO ] [Real]Absence check using 161 positive place invariants in 137 ms returned sat
[2021-05-17 19:27:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:27:23] [INFO ] [Real]Absence check using state equation in 1068 ms returned sat
[2021-05-17 19:27:24] [INFO ] Deduced a trap composed of 22 places in 603 ms of which 1 ms to minimize.
[2021-05-17 19:27:24] [INFO ] Deduced a trap composed of 25 places in 694 ms of which 2 ms to minimize.
[2021-05-17 19:27:25] [INFO ] Deduced a trap composed of 31 places in 771 ms of which 1 ms to minimize.
[2021-05-17 19:27:26] [INFO ] Deduced a trap composed of 23 places in 600 ms of which 2 ms to minimize.
[2021-05-17 19:27:27] [INFO ] Deduced a trap composed of 27 places in 641 ms of which 1 ms to minimize.
[2021-05-17 19:27:27] [INFO ] Deduced a trap composed of 40 places in 573 ms of which 1 ms to minimize.
[2021-05-17 19:27:28] [INFO ] Deduced a trap composed of 33 places in 731 ms of which 1 ms to minimize.
[2021-05-17 19:27:29] [INFO ] Deduced a trap composed of 28 places in 610 ms of which 2 ms to minimize.
[2021-05-17 19:27:30] [INFO ] Deduced a trap composed of 29 places in 733 ms of which 1 ms to minimize.
[2021-05-17 19:27:30] [INFO ] Deduced a trap composed of 46 places in 559 ms of which 2 ms to minimize.
[2021-05-17 19:27:31] [INFO ] Deduced a trap composed of 43 places in 718 ms of which 1 ms to minimize.
[2021-05-17 19:27:32] [INFO ] Deduced a trap composed of 35 places in 484 ms of which 1 ms to minimize.
[2021-05-17 19:27:32] [INFO ] Deduced a trap composed of 53 places in 570 ms of which 2 ms to minimize.
[2021-05-17 19:27:33] [INFO ] Deduced a trap composed of 38 places in 693 ms of which 1 ms to minimize.
[2021-05-17 19:27:34] [INFO ] Deduced a trap composed of 38 places in 513 ms of which 1 ms to minimize.
[2021-05-17 19:27:34] [INFO ] Deduced a trap composed of 48 places in 533 ms of which 1 ms to minimize.
[2021-05-17 19:27:35] [INFO ] Deduced a trap composed of 34 places in 604 ms of which 2 ms to minimize.
[2021-05-17 19:27:36] [INFO ] Deduced a trap composed of 45 places in 586 ms of which 2 ms to minimize.
[2021-05-17 19:27:36] [INFO ] Deduced a trap composed of 32 places in 603 ms of which 1 ms to minimize.
[2021-05-17 19:27:37] [INFO ] Deduced a trap composed of 44 places in 370 ms of which 0 ms to minimize.
[2021-05-17 19:27:37] [INFO ] Deduced a trap composed of 54 places in 440 ms of which 2 ms to minimize.
[2021-05-17 19:27:38] [INFO ] Deduced a trap composed of 57 places in 545 ms of which 1 ms to minimize.
[2021-05-17 19:27:39] [INFO ] Deduced a trap composed of 47 places in 527 ms of which 1 ms to minimize.
[2021-05-17 19:27:39] [INFO ] Deduced a trap composed of 46 places in 538 ms of which 2 ms to minimize.
[2021-05-17 19:27:40] [INFO ] Deduced a trap composed of 57 places in 513 ms of which 2 ms to minimize.
[2021-05-17 19:27:41] [INFO ] Deduced a trap composed of 63 places in 485 ms of which 1 ms to minimize.
[2021-05-17 19:27:41] [INFO ] Deduced a trap composed of 59 places in 441 ms of which 1 ms to minimize.
[2021-05-17 19:27:41] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 18278 ms
[2021-05-17 19:27:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:27:42] [INFO ] [Nat]Absence check using 161 positive place invariants in 92 ms returned sat
[2021-05-17 19:27:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:27:43] [INFO ] [Nat]Absence check using state equation in 1004 ms returned sat
[2021-05-17 19:27:43] [INFO ] Deduced a trap composed of 22 places in 710 ms of which 2 ms to minimize.
[2021-05-17 19:27:44] [INFO ] Deduced a trap composed of 25 places in 890 ms of which 2 ms to minimize.
[2021-05-17 19:27:45] [INFO ] Deduced a trap composed of 31 places in 735 ms of which 1 ms to minimize.
[2021-05-17 19:27:46] [INFO ] Deduced a trap composed of 23 places in 728 ms of which 2 ms to minimize.
[2021-05-17 19:27:47] [INFO ] Deduced a trap composed of 27 places in 561 ms of which 1 ms to minimize.
[2021-05-17 19:27:47] [INFO ] Deduced a trap composed of 40 places in 693 ms of which 2 ms to minimize.
[2021-05-17 19:27:48] [INFO ] Deduced a trap composed of 33 places in 841 ms of which 1 ms to minimize.
[2021-05-17 19:27:49] [INFO ] Deduced a trap composed of 28 places in 715 ms of which 1 ms to minimize.
[2021-05-17 19:27:50] [INFO ] Deduced a trap composed of 29 places in 508 ms of which 1 ms to minimize.
[2021-05-17 19:27:50] [INFO ] Deduced a trap composed of 46 places in 595 ms of which 2 ms to minimize.
[2021-05-17 19:27:51] [INFO ] Deduced a trap composed of 43 places in 667 ms of which 1 ms to minimize.
[2021-05-17 19:27:52] [INFO ] Deduced a trap composed of 35 places in 560 ms of which 2 ms to minimize.
[2021-05-17 19:27:53] [INFO ] Deduced a trap composed of 53 places in 684 ms of which 1 ms to minimize.
[2021-05-17 19:27:53] [INFO ] Deduced a trap composed of 38 places in 495 ms of which 1 ms to minimize.
[2021-05-17 19:27:54] [INFO ] Deduced a trap composed of 38 places in 688 ms of which 1 ms to minimize.
[2021-05-17 19:27:55] [INFO ] Deduced a trap composed of 48 places in 666 ms of which 2 ms to minimize.
[2021-05-17 19:27:55] [INFO ] Deduced a trap composed of 34 places in 600 ms of which 2 ms to minimize.
[2021-05-17 19:27:56] [INFO ] Deduced a trap composed of 45 places in 589 ms of which 1 ms to minimize.
[2021-05-17 19:27:57] [INFO ] Deduced a trap composed of 32 places in 392 ms of which 2 ms to minimize.
[2021-05-17 19:27:57] [INFO ] Deduced a trap composed of 44 places in 585 ms of which 1 ms to minimize.
[2021-05-17 19:27:58] [INFO ] Deduced a trap composed of 54 places in 587 ms of which 1 ms to minimize.
[2021-05-17 19:27:59] [INFO ] Deduced a trap composed of 57 places in 515 ms of which 1 ms to minimize.
[2021-05-17 19:27:59] [INFO ] Deduced a trap composed of 47 places in 482 ms of which 1 ms to minimize.
[2021-05-17 19:28:00] [INFO ] Deduced a trap composed of 46 places in 482 ms of which 1 ms to minimize.
[2021-05-17 19:28:00] [INFO ] Deduced a trap composed of 57 places in 501 ms of which 1 ms to minimize.
[2021-05-17 19:28:01] [INFO ] Deduced a trap composed of 63 places in 482 ms of which 2 ms to minimize.
[2021-05-17 19:28:02] [INFO ] Deduced a trap composed of 59 places in 448 ms of which 2 ms to minimize.
[2021-05-17 19:28:02] [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-05-17 19:28:02] [INFO ] [Real]Absence check using 161 positive place invariants in 137 ms returned sat
[2021-05-17 19:28:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:28:03] [INFO ] [Real]Absence check using state equation in 1043 ms returned sat
[2021-05-17 19:28:04] [INFO ] Deduced a trap composed of 28 places in 517 ms of which 2 ms to minimize.
[2021-05-17 19:28:04] [INFO ] Deduced a trap composed of 34 places in 615 ms of which 1 ms to minimize.
[2021-05-17 19:28:05] [INFO ] Deduced a trap composed of 43 places in 481 ms of which 1 ms to minimize.
[2021-05-17 19:28:05] [INFO ] Deduced a trap composed of 28 places in 464 ms of which 1 ms to minimize.
[2021-05-17 19:28:06] [INFO ] Deduced a trap composed of 22 places in 471 ms of which 1 ms to minimize.
[2021-05-17 19:28:07] [INFO ] Deduced a trap composed of 31 places in 716 ms of which 2 ms to minimize.
[2021-05-17 19:28:08] [INFO ] Deduced a trap composed of 21 places in 712 ms of which 1 ms to minimize.
[2021-05-17 19:28:08] [INFO ] Deduced a trap composed of 22 places in 482 ms of which 2 ms to minimize.
[2021-05-17 19:28:09] [INFO ] Deduced a trap composed of 23 places in 736 ms of which 2 ms to minimize.
[2021-05-17 19:28:10] [INFO ] Deduced a trap composed of 26 places in 711 ms of which 1 ms to minimize.
[2021-05-17 19:28:11] [INFO ] Deduced a trap composed of 37 places in 687 ms of which 1 ms to minimize.
[2021-05-17 19:28:11] [INFO ] Deduced a trap composed of 37 places in 450 ms of which 2 ms to minimize.
[2021-05-17 19:28:12] [INFO ] Deduced a trap composed of 30 places in 676 ms of which 2 ms to minimize.
[2021-05-17 19:28:13] [INFO ] Deduced a trap composed of 37 places in 590 ms of which 1 ms to minimize.
[2021-05-17 19:28:13] [INFO ] Deduced a trap composed of 57 places in 399 ms of which 2 ms to minimize.
[2021-05-17 19:28:14] [INFO ] Deduced a trap composed of 45 places in 609 ms of which 2 ms to minimize.
[2021-05-17 19:28:15] [INFO ] Deduced a trap composed of 68 places in 581 ms of which 1 ms to minimize.
[2021-05-17 19:28:15] [INFO ] Deduced a trap composed of 38 places in 564 ms of which 1 ms to minimize.
[2021-05-17 19:28:16] [INFO ] Deduced a trap composed of 49 places in 578 ms of which 1 ms to minimize.
[2021-05-17 19:28:17] [INFO ] Deduced a trap composed of 49 places in 556 ms of which 1 ms to minimize.
[2021-05-17 19:28:17] [INFO ] Deduced a trap composed of 47 places in 353 ms of which 1 ms to minimize.
[2021-05-17 19:28:18] [INFO ] Deduced a trap composed of 50 places in 400 ms of which 1 ms to minimize.
[2021-05-17 19:28:18] [INFO ] Deduced a trap composed of 56 places in 475 ms of which 2 ms to minimize.
[2021-05-17 19:28:19] [INFO ] Deduced a trap composed of 55 places in 404 ms of which 1 ms to minimize.
[2021-05-17 19:28:19] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 15606 ms
[2021-05-17 19:28:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:28:19] [INFO ] [Nat]Absence check using 161 positive place invariants in 113 ms returned sat
[2021-05-17 19:28:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:28:20] [INFO ] [Nat]Absence check using state equation in 1040 ms returned sat
[2021-05-17 19:28:21] [INFO ] Deduced a trap composed of 28 places in 516 ms of which 1 ms to minimize.
[2021-05-17 19:28:21] [INFO ] Deduced a trap composed of 34 places in 621 ms of which 2 ms to minimize.
[2021-05-17 19:28:22] [INFO ] Deduced a trap composed of 43 places in 767 ms of which 1 ms to minimize.
[2021-05-17 19:28:23] [INFO ] Deduced a trap composed of 28 places in 727 ms of which 2 ms to minimize.
[2021-05-17 19:28:24] [INFO ] Deduced a trap composed of 22 places in 477 ms of which 1 ms to minimize.
[2021-05-17 19:28:24] [INFO ] Deduced a trap composed of 31 places in 508 ms of which 1 ms to minimize.
[2021-05-17 19:28:25] [INFO ] Deduced a trap composed of 21 places in 494 ms of which 1 ms to minimize.
[2021-05-17 19:28:25] [INFO ] Deduced a trap composed of 22 places in 558 ms of which 1 ms to minimize.
[2021-05-17 19:28:26] [INFO ] Deduced a trap composed of 23 places in 495 ms of which 1 ms to minimize.
[2021-05-17 19:28:27] [INFO ] Deduced a trap composed of 26 places in 651 ms of which 2 ms to minimize.
[2021-05-17 19:28:28] [INFO ] Deduced a trap composed of 37 places in 689 ms of which 12 ms to minimize.
[2021-05-17 19:28:28] [INFO ] Deduced a trap composed of 37 places in 677 ms of which 2 ms to minimize.
[2021-05-17 19:28:29] [INFO ] Deduced a trap composed of 30 places in 657 ms of which 2 ms to minimize.
[2021-05-17 19:28:30] [INFO ] Deduced a trap composed of 37 places in 584 ms of which 1 ms to minimize.
[2021-05-17 19:28:30] [INFO ] Deduced a trap composed of 38 places in 600 ms of which 2 ms to minimize.
[2021-05-17 19:28:31] [INFO ] Deduced a trap composed of 48 places in 423 ms of which 1 ms to minimize.
[2021-05-17 19:28:32] [INFO ] Deduced a trap composed of 45 places in 556 ms of which 1 ms to minimize.
[2021-05-17 19:28:32] [INFO ] Deduced a trap composed of 47 places in 349 ms of which 1 ms to minimize.
[2021-05-17 19:28:32] [INFO ] Deduced a trap composed of 44 places in 408 ms of which 1 ms to minimize.
[2021-05-17 19:28:33] [INFO ] Deduced a trap composed of 40 places in 410 ms of which 2 ms to minimize.
[2021-05-17 19:28:33] [INFO ] Deduced a trap composed of 65 places in 391 ms of which 1 ms to minimize.
[2021-05-17 19:28:34] [INFO ] Deduced a trap composed of 46 places in 376 ms of which 1 ms to minimize.
[2021-05-17 19:28:34] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 13882 ms
[2021-05-17 19:28:34] [INFO ] Computed and/alt/rep : 1567/2290/1567 causal constraints (skipped 0 transitions) in 127 ms.
[2021-05-17 19:28:40] [INFO ] Deduced a trap composed of 14 places in 1568 ms of which 2 ms to minimize.
[2021-05-17 19:28:40] [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-05-17 19:28:41] [INFO ] [Real]Absence check using 161 positive place invariants in 142 ms returned sat
[2021-05-17 19:28:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:28:42] [INFO ] [Real]Absence check using state equation in 1174 ms returned sat
[2021-05-17 19:28:43] [INFO ] Deduced a trap composed of 26 places in 796 ms of which 1 ms to minimize.
[2021-05-17 19:28:44] [INFO ] Deduced a trap composed of 27 places in 742 ms of which 1 ms to minimize.
[2021-05-17 19:28:44] [INFO ] Deduced a trap composed of 53 places in 619 ms of which 1 ms to minimize.
[2021-05-17 19:28:45] [INFO ] Deduced a trap composed of 40 places in 715 ms of which 5 ms to minimize.
[2021-05-17 19:28:46] [INFO ] Deduced a trap composed of 28 places in 603 ms of which 1 ms to minimize.
[2021-05-17 19:28:47] [INFO ] Deduced a trap composed of 35 places in 804 ms of which 2 ms to minimize.
[2021-05-17 19:28:47] [INFO ] Deduced a trap composed of 27 places in 566 ms of which 1 ms to minimize.
[2021-05-17 19:28:48] [INFO ] Deduced a trap composed of 23 places in 709 ms of which 1 ms to minimize.
[2021-05-17 19:28:49] [INFO ] Deduced a trap composed of 37 places in 557 ms of which 2 ms to minimize.
[2021-05-17 19:28:49] [INFO ] Deduced a trap composed of 28 places in 639 ms of which 1 ms to minimize.
[2021-05-17 19:28:50] [INFO ] Deduced a trap composed of 28 places in 695 ms of which 1 ms to minimize.
[2021-05-17 19:28:51] [INFO ] Deduced a trap composed of 30 places in 620 ms of which 2 ms to minimize.
[2021-05-17 19:28:52] [INFO ] Deduced a trap composed of 37 places in 629 ms of which 1 ms to minimize.
[2021-05-17 19:28:52] [INFO ] Deduced a trap composed of 36 places in 523 ms of which 2 ms to minimize.
[2021-05-17 19:28:53] [INFO ] Deduced a trap composed of 46 places in 525 ms of which 2 ms to minimize.
[2021-05-17 19:28:54] [INFO ] Deduced a trap composed of 57 places in 644 ms of which 1 ms to minimize.
[2021-05-17 19:28:54] [INFO ] Deduced a trap composed of 42 places in 428 ms of which 2 ms to minimize.
[2021-05-17 19:28:55] [INFO ] Deduced a trap composed of 25 places in 506 ms of which 1 ms to minimize.
[2021-05-17 19:28:55] [INFO ] Deduced a trap composed of 51 places in 430 ms of which 1 ms to minimize.
[2021-05-17 19:28:56] [INFO ] Deduced a trap composed of 45 places in 365 ms of which 1 ms to minimize.
[2021-05-17 19:28:56] [INFO ] Deduced a trap composed of 53 places in 360 ms of which 1 ms to minimize.
[2021-05-17 19:28:57] [INFO ] Deduced a trap composed of 57 places in 364 ms of which 1 ms to minimize.
[2021-05-17 19:28:57] [INFO ] Deduced a trap composed of 46 places in 347 ms of which 1 ms to minimize.
[2021-05-17 19:28:57] [INFO ] Deduced a trap composed of 36 places in 330 ms of which 1 ms to minimize.
[2021-05-17 19:28:58] [INFO ] Deduced a trap composed of 35 places in 338 ms of which 1 ms to minimize.
[2021-05-17 19:28:58] [INFO ] Deduced a trap composed of 54 places in 326 ms of which 1 ms to minimize.
[2021-05-17 19:28:59] [INFO ] Deduced a trap composed of 54 places in 330 ms of which 1 ms to minimize.
[2021-05-17 19:28:59] [INFO ] Deduced a trap composed of 68 places in 319 ms of which 1 ms to minimize.
[2021-05-17 19:28:59] [INFO ] Deduced a trap composed of 57 places in 287 ms of which 1 ms to minimize.
[2021-05-17 19:29:00] [INFO ] Deduced a trap composed of 56 places in 283 ms of which 1 ms to minimize.
[2021-05-17 19:29:00] [INFO ] Deduced a trap composed of 48 places in 297 ms of which 1 ms to minimize.
[2021-05-17 19:29:00] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 18202 ms
[2021-05-17 19:29:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:29:00] [INFO ] [Nat]Absence check using 161 positive place invariants in 91 ms returned sat
[2021-05-17 19:29:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:29:01] [INFO ] [Nat]Absence check using state equation in 842 ms returned sat
[2021-05-17 19:29:02] [INFO ] Deduced a trap composed of 26 places in 622 ms of which 1 ms to minimize.
[2021-05-17 19:29:03] [INFO ] Deduced a trap composed of 27 places in 638 ms of which 2 ms to minimize.
[2021-05-17 19:29:04] [INFO ] Deduced a trap composed of 53 places in 754 ms of which 2 ms to minimize.
[2021-05-17 19:29:04] [INFO ] Deduced a trap composed of 40 places in 724 ms of which 1 ms to minimize.
[2021-05-17 19:29:05] [INFO ] Deduced a trap composed of 28 places in 537 ms of which 1 ms to minimize.
[2021-05-17 19:29:06] [INFO ] Deduced a trap composed of 35 places in 546 ms of which 1 ms to minimize.
[2021-05-17 19:29:06] [INFO ] Deduced a trap composed of 27 places in 784 ms of which 2 ms to minimize.
[2021-05-17 19:29:07] [INFO ] Deduced a trap composed of 23 places in 728 ms of which 1 ms to minimize.
[2021-05-17 19:29:08] [INFO ] Deduced a trap composed of 22 places in 535 ms of which 1 ms to minimize.
[2021-05-17 19:29:08] [INFO ] Deduced a trap composed of 21 places in 613 ms of which 2 ms to minimize.
[2021-05-17 19:29:09] [INFO ] Deduced a trap composed of 32 places in 648 ms of which 2 ms to minimize.
[2021-05-17 19:29:10] [INFO ] Deduced a trap composed of 18 places in 544 ms of which 1 ms to minimize.
[2021-05-17 19:29:11] [INFO ] Deduced a trap composed of 33 places in 642 ms of which 1 ms to minimize.
[2021-05-17 19:29:11] [INFO ] Deduced a trap composed of 28 places in 537 ms of which 2 ms to minimize.
[2021-05-17 19:29:12] [INFO ] Deduced a trap composed of 30 places in 475 ms of which 2 ms to minimize.
[2021-05-17 19:29:12] [INFO ] Deduced a trap composed of 23 places in 439 ms of which 1 ms to minimize.
[2021-05-17 19:29:13] [INFO ] Deduced a trap composed of 37 places in 454 ms of which 1 ms to minimize.
[2021-05-17 19:29:13] [INFO ] Deduced a trap composed of 42 places in 438 ms of which 1 ms to minimize.
[2021-05-17 19:29:14] [INFO ] Deduced a trap composed of 46 places in 429 ms of which 1 ms to minimize.
[2021-05-17 19:29:14] [INFO ] Deduced a trap composed of 56 places in 421 ms of which 1 ms to minimize.
[2021-05-17 19:29:15] [INFO ] Deduced a trap composed of 30 places in 312 ms of which 1 ms to minimize.
[2021-05-17 19:29:15] [INFO ] Deduced a trap composed of 54 places in 396 ms of which 1 ms to minimize.
[2021-05-17 19:29:16] [INFO ] Deduced a trap composed of 66 places in 534 ms of which 1 ms to minimize.
[2021-05-17 19:29:16] [INFO ] Deduced a trap composed of 36 places in 363 ms of which 0 ms to minimize.
[2021-05-17 19:29:16] [INFO ] Deduced a trap composed of 57 places in 344 ms of which 1 ms to minimize.
[2021-05-17 19:29:17] [INFO ] Deduced a trap composed of 54 places in 505 ms of which 1 ms to minimize.
[2021-05-17 19:29:18] [INFO ] Deduced a trap composed of 58 places in 529 ms of which 1 ms to minimize.
[2021-05-17 19:29:18] [INFO ] Deduced a trap composed of 57 places in 318 ms of which 1 ms to minimize.
[2021-05-17 19:29:18] [INFO ] Deduced a trap composed of 44 places in 307 ms of which 1 ms to minimize.
[2021-05-17 19:29:19] [INFO ] Deduced a trap composed of 54 places in 287 ms of which 1 ms to minimize.
[2021-05-17 19:29:19] [INFO ] Deduced a trap composed of 58 places in 281 ms of which 1 ms to minimize.
[2021-05-17 19:29:19] [INFO ] Deduced a trap composed of 57 places in 294 ms of which 1 ms to minimize.
[2021-05-17 19:29:20] [INFO ] Deduced a trap composed of 56 places in 283 ms of which 1 ms to minimize.
[2021-05-17 19:29:20] [INFO ] Deduced a trap composed of 48 places in 267 ms of which 1 ms to minimize.
[2021-05-17 19:29:20] [INFO ] Deduced a trap composed of 58 places in 278 ms of which 1 ms to minimize.
[2021-05-17 19:29:20] [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-05-17 19:29:21] [INFO ] [Real]Absence check using 161 positive place invariants in 88 ms returned sat
[2021-05-17 19:29:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:29:22] [INFO ] [Real]Absence check using state equation in 829 ms returned sat
[2021-05-17 19:29:22] [INFO ] Deduced a trap composed of 27 places in 583 ms of which 1 ms to minimize.
[2021-05-17 19:29:23] [INFO ] Deduced a trap composed of 23 places in 552 ms of which 2 ms to minimize.
[2021-05-17 19:29:23] [INFO ] Deduced a trap composed of 35 places in 538 ms of which 1 ms to minimize.
[2021-05-17 19:29:24] [INFO ] Deduced a trap composed of 25 places in 517 ms of which 1 ms to minimize.
[2021-05-17 19:29:25] [INFO ] Deduced a trap composed of 30 places in 510 ms of which 1 ms to minimize.
[2021-05-17 19:29:25] [INFO ] Deduced a trap composed of 41 places in 541 ms of which 2 ms to minimize.
[2021-05-17 19:29:26] [INFO ] Deduced a trap composed of 52 places in 589 ms of which 2 ms to minimize.
[2021-05-17 19:29:27] [INFO ] Deduced a trap composed of 46 places in 493 ms of which 1 ms to minimize.
[2021-05-17 19:29:27] [INFO ] Deduced a trap composed of 22 places in 471 ms of which 1 ms to minimize.
[2021-05-17 19:29:28] [INFO ] Deduced a trap composed of 38 places in 466 ms of which 1 ms to minimize.
[2021-05-17 19:29:28] [INFO ] Deduced a trap composed of 28 places in 442 ms of which 1 ms to minimize.
[2021-05-17 19:29:29] [INFO ] Deduced a trap composed of 23 places in 500 ms of which 1 ms to minimize.
[2021-05-17 19:29:30] [INFO ] Deduced a trap composed of 27 places in 667 ms of which 1 ms to minimize.
[2021-05-17 19:29:30] [INFO ] Deduced a trap composed of 57 places in 421 ms of which 1 ms to minimize.
[2021-05-17 19:29:31] [INFO ] Deduced a trap composed of 45 places in 428 ms of which 1 ms to minimize.
[2021-05-17 19:29:31] [INFO ] Deduced a trap composed of 38 places in 422 ms of which 2 ms to minimize.
[2021-05-17 19:29:32] [INFO ] Deduced a trap composed of 38 places in 414 ms of which 1 ms to minimize.
[2021-05-17 19:29:32] [INFO ] Deduced a trap composed of 44 places in 406 ms of which 1 ms to minimize.
[2021-05-17 19:29:32] [INFO ] Deduced a trap composed of 57 places in 408 ms of which 1 ms to minimize.
[2021-05-17 19:29:33] [INFO ] Deduced a trap composed of 47 places in 400 ms of which 1 ms to minimize.
[2021-05-17 19:29:33] [INFO ] Deduced a trap composed of 46 places in 395 ms of which 1 ms to minimize.
[2021-05-17 19:29:34] [INFO ] Deduced a trap composed of 44 places in 556 ms of which 2 ms to minimize.
[2021-05-17 19:29:35] [INFO ] Deduced a trap composed of 50 places in 611 ms of which 2 ms to minimize.
[2021-05-17 19:29:35] [INFO ] Deduced a trap composed of 57 places in 595 ms of which 2 ms to minimize.
[2021-05-17 19:29:36] [INFO ] Deduced a trap composed of 55 places in 520 ms of which 1 ms to minimize.
[2021-05-17 19:29:37] [INFO ] Deduced a trap composed of 63 places in 507 ms of which 2 ms to minimize.
[2021-05-17 19:29:37] [INFO ] Deduced a trap composed of 59 places in 556 ms of which 1 ms to minimize.
[2021-05-17 19:29:38] [INFO ] Deduced a trap composed of 67 places in 525 ms of which 1 ms to minimize.
[2021-05-17 19:29:39] [INFO ] Deduced a trap composed of 59 places in 493 ms of which 1 ms to minimize.
[2021-05-17 19:29:39] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 17135 ms
[2021-05-17 19:29:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:29:39] [INFO ] [Nat]Absence check using 161 positive place invariants in 92 ms returned sat
[2021-05-17 19:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:29:40] [INFO ] [Nat]Absence check using state equation in 855 ms returned sat
[2021-05-17 19:29:41] [INFO ] Deduced a trap composed of 27 places in 567 ms of which 1 ms to minimize.
[2021-05-17 19:29:41] [INFO ] Deduced a trap composed of 23 places in 534 ms of which 1 ms to minimize.
[2021-05-17 19:29:42] [INFO ] Deduced a trap composed of 35 places in 538 ms of which 1 ms to minimize.
[2021-05-17 19:29:42] [INFO ] Deduced a trap composed of 25 places in 512 ms of which 1 ms to minimize.
[2021-05-17 19:29:43] [INFO ] Deduced a trap composed of 30 places in 518 ms of which 2 ms to minimize.
[2021-05-17 19:29:43] [INFO ] Deduced a trap composed of 41 places in 476 ms of which 1 ms to minimize.
[2021-05-17 19:29:44] [INFO ] Deduced a trap composed of 52 places in 476 ms of which 1 ms to minimize.
[2021-05-17 19:29:45] [INFO ] Deduced a trap composed of 46 places in 453 ms of which 1 ms to minimize.
[2021-05-17 19:29:45] [INFO ] Deduced a trap composed of 22 places in 456 ms of which 1 ms to minimize.
[2021-05-17 19:29:46] [INFO ] Deduced a trap composed of 38 places in 470 ms of which 1 ms to minimize.
[2021-05-17 19:29:46] [INFO ] Deduced a trap composed of 28 places in 432 ms of which 1 ms to minimize.
[2021-05-17 19:29:47] [INFO ] Deduced a trap composed of 23 places in 433 ms of which 1 ms to minimize.
[2021-05-17 19:29:47] [INFO ] Deduced a trap composed of 27 places in 423 ms of which 1 ms to minimize.
[2021-05-17 19:29:48] [INFO ] Deduced a trap composed of 57 places in 396 ms of which 1 ms to minimize.
[2021-05-17 19:29:48] [INFO ] Deduced a trap composed of 45 places in 685 ms of which 2 ms to minimize.
[2021-05-17 19:29:49] [INFO ] Deduced a trap composed of 38 places in 648 ms of which 1 ms to minimize.
[2021-05-17 19:29:50] [INFO ] Deduced a trap composed of 38 places in 637 ms of which 1 ms to minimize.
[2021-05-17 19:29:50] [INFO ] Deduced a trap composed of 44 places in 618 ms of which 2 ms to minimize.
[2021-05-17 19:29:51] [INFO ] Deduced a trap composed of 57 places in 605 ms of which 1 ms to minimize.
[2021-05-17 19:29:52] [INFO ] Deduced a trap composed of 47 places in 613 ms of which 2 ms to minimize.
[2021-05-17 19:29:53] [INFO ] Deduced a trap composed of 46 places in 626 ms of which 2 ms to minimize.
[2021-05-17 19:29:53] [INFO ] Deduced a trap composed of 44 places in 596 ms of which 2 ms to minimize.
[2021-05-17 19:29:54] [INFO ] Deduced a trap composed of 50 places in 625 ms of which 2 ms to minimize.
[2021-05-17 19:29:55] [INFO ] Deduced a trap composed of 57 places in 608 ms of which 2 ms to minimize.
[2021-05-17 19:29:55] [INFO ] Deduced a trap composed of 55 places in 599 ms of which 2 ms to minimize.
[2021-05-17 19:29:56] [INFO ] Deduced a trap composed of 63 places in 508 ms of which 1 ms to minimize.
[2021-05-17 19:29:57] [INFO ] Deduced a trap composed of 59 places in 343 ms of which 0 ms to minimize.
[2021-05-17 19:29:57] [INFO ] Deduced a trap composed of 67 places in 343 ms of which 1 ms to minimize.
[2021-05-17 19:29:57] [INFO ] Deduced a trap composed of 59 places in 491 ms of which 2 ms to minimize.
[2021-05-17 19:29:58] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 17675 ms
[2021-05-17 19:29:58] [INFO ] Computed and/alt/rep : 1567/2290/1567 causal constraints (skipped 0 transitions) in 174 ms.
[2021-05-17 19:30:00] [INFO ] Deduced a trap composed of 14 places in 1386 ms of which 6 ms to minimize.
[2021-05-17 19:30:00] [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
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1568 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1568/1568 places, 1568/1568 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 438 transitions
Trivial Post-agglo rules discarded 438 transitions
Performed 438 trivial Post agglomeration. Transition count delta: 438
Iterating post reduction 0 with 438 rules applied. Total rules applied 438 place count 1567 transition count 1129
Reduce places removed 438 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 439 rules applied. Total rules applied 877 place count 1129 transition count 1128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 878 place count 1128 transition count 1128
Performed 317 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 317 Pre rules applied. Total rules applied 878 place count 1128 transition count 811
Deduced a syphon composed of 317 places in 4 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 3 with 634 rules applied. Total rules applied 1512 place count 811 transition count 811
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1516 place count 807 transition count 807
Iterating global reduction 3 with 4 rules applied. Total rules applied 1520 place count 807 transition count 807
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1520 place count 807 transition count 805
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1524 place count 805 transition count 805
Performed 359 Post agglomeration using F-continuation condition.Transition count delta: 359
Deduced a syphon composed of 359 places in 0 ms
Reduce places removed 359 places and 0 transitions.
Iterating global reduction 3 with 718 rules applied. Total rules applied 2242 place count 446 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2243 place count 446 transition count 445
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 4 with 2 rules applied. Total rules applied 2245 place count 445 transition count 444
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
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 2447 place count 344 transition count 544
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 2481 place count 327 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2482 place count 326 transition count 559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2483 place count 325 transition count 559
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2484 place count 324 transition count 558
Applied a total of 2484 rules in 806 ms. Remains 324 /1568 variables (removed 1244) and now considering 558/1568 (removed 1010) transitions.
// Phase 1: matrix 558 rows 324 cols
[2021-05-17 19:30:01] [INFO ] Computed 160 place invariants in 3 ms
[2021-05-17 19:30:01] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 558 rows 324 cols
[2021-05-17 19:30:01] [INFO ] Computed 160 place invariants in 2 ms
[2021-05-17 19:30:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-17 19:30:02] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
[2021-05-17 19:30:02] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 558 rows 324 cols
[2021-05-17 19:30:02] [INFO ] Computed 160 place invariants in 3 ms
[2021-05-17 19:30:03] [INFO ] Dead Transitions using invariants and state equation in 606 ms returned []
Finished structural reductions, in 1 iterations. Remains : 324/1568 places, 558/1568 transitions.
Stuttering acceptance computed with spot in 336 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-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 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s11 1) (NEQ s299 1)), p0:(NEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA ShieldRVt-PT-040B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-01 finished in 2776 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1568 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1568/1568 places, 1568/1568 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1561 transition count 1561
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1561 transition count 1561
Applied a total of 14 rules in 211 ms. Remains 1561 /1568 variables (removed 7) and now considering 1561/1568 (removed 7) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2021-05-17 19:30:03] [INFO ] Computed 161 place invariants in 9 ms
[2021-05-17 19:30:04] [INFO ] Implicit Places using invariants in 580 ms returned []
// Phase 1: matrix 1561 rows 1561 cols
[2021-05-17 19:30:04] [INFO ] Computed 161 place invariants in 9 ms
[2021-05-17 19:30:06] [INFO ] Implicit Places using invariants and state equation in 2206 ms returned []
Implicit Place search using SMT with State Equation took 2788 ms to find 0 implicit places.
// Phase 1: matrix 1561 rows 1561 cols
[2021-05-17 19:30:06] [INFO ] Computed 161 place invariants in 8 ms
[2021-05-17 19:30:08] [INFO ] Dead Transitions using invariants and state equation in 2027 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1561/1568 places, 1561/1568 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-040B-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s852 1) (EQ s856 1) (EQ s869 1)), p0:(NEQ s1014 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 16798 steps with 0 reset in 364 ms.
FORMULA ShieldRVt-PT-040B-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-04 finished in 5660 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X(F((p0&&F(p1))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1568 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1568/1568 places, 1568/1568 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 440 transitions
Trivial Post-agglo rules discarded 440 transitions
Performed 440 trivial Post agglomeration. Transition count delta: 440
Iterating post reduction 0 with 440 rules applied. Total rules applied 440 place count 1567 transition count 1127
Reduce places removed 440 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 441 rules applied. Total rules applied 881 place count 1127 transition count 1126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 882 place count 1126 transition count 1126
Performed 317 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 317 Pre rules applied. Total rules applied 882 place count 1126 transition count 809
Deduced a syphon composed of 317 places in 2 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 3 with 634 rules applied. Total rules applied 1516 place count 809 transition count 809
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1520 place count 805 transition count 805
Iterating global reduction 3 with 4 rules applied. Total rules applied 1524 place count 805 transition count 805
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1524 place count 805 transition count 803
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1528 place count 803 transition count 803
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 0 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 3 with 714 rules applied. Total rules applied 2242 place count 446 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2243 place count 446 transition count 445
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 4 with 2 rules applied. Total rules applied 2245 place count 445 transition count 444
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
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 2447 place count 344 transition count 543
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 2483 place count 326 transition count 561
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2484 place count 325 transition count 560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2485 place count 324 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2486 place count 323 transition count 559
Applied a total of 2486 rules in 463 ms. Remains 323 /1568 variables (removed 1245) and now considering 559/1568 (removed 1009) transitions.
// Phase 1: matrix 559 rows 323 cols
[2021-05-17 19:30:09] [INFO ] Computed 160 place invariants in 7 ms
[2021-05-17 19:30:10] [INFO ] Implicit Places using invariants in 451 ms returned []
// Phase 1: matrix 559 rows 323 cols
[2021-05-17 19:30:10] [INFO ] Computed 160 place invariants in 5 ms
[2021-05-17 19:30:10] [INFO ] State equation strengthened by 228 read => feed constraints.
[2021-05-17 19:30:12] [INFO ] Implicit Places using invariants and state equation in 2841 ms returned []
Implicit Place search using SMT with State Equation took 3295 ms to find 0 implicit places.
[2021-05-17 19:30:13] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 559 rows 323 cols
[2021-05-17 19:30:13] [INFO ] Computed 160 place invariants in 2 ms
[2021-05-17 19:30:13] [INFO ] Dead Transitions using invariants and state equation in 625 ms returned []
Finished structural reductions, in 1 iterations. Remains : 323/1568 places, 559/1568 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s91 1), p0:(EQ s180 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-040B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-05 finished in 4536 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 1568 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1568/1568 places, 1568/1568 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1562 transition count 1562
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1562 transition count 1562
Applied a total of 12 rules in 201 ms. Remains 1562 /1568 variables (removed 6) and now considering 1562/1568 (removed 6) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2021-05-17 19:30:13] [INFO ] Computed 161 place invariants in 4 ms
[2021-05-17 19:30:14] [INFO ] Implicit Places using invariants in 728 ms returned []
// Phase 1: matrix 1562 rows 1562 cols
[2021-05-17 19:30:14] [INFO ] Computed 161 place invariants in 4 ms
[2021-05-17 19:30:17] [INFO ] Implicit Places using invariants and state equation in 2686 ms returned []
Implicit Place search using SMT with State Equation took 3433 ms to find 0 implicit places.
// Phase 1: matrix 1562 rows 1562 cols
[2021-05-17 19:30:17] [INFO ] Computed 161 place invariants in 4 ms
[2021-05-17 19:30:19] [INFO ] Dead Transitions using invariants and state equation in 1752 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1562/1568 places, 1562/1568 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-06 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 s899 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 316 steps with 0 reset in 2 ms.
FORMULA ShieldRVt-PT-040B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-06 finished in 5490 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0 U (G(p0)||(F(p2)&&p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1568 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1568/1568 places, 1568/1568 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 438 transitions
Trivial Post-agglo rules discarded 438 transitions
Performed 438 trivial Post agglomeration. Transition count delta: 438
Iterating post reduction 0 with 438 rules applied. Total rules applied 438 place count 1567 transition count 1129
Reduce places removed 438 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 439 rules applied. Total rules applied 877 place count 1129 transition count 1128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 878 place count 1128 transition count 1128
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 315 Pre rules applied. Total rules applied 878 place count 1128 transition count 813
Deduced a syphon composed of 315 places in 2 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 3 with 630 rules applied. Total rules applied 1508 place count 813 transition count 813
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1513 place count 808 transition count 808
Iterating global reduction 3 with 5 rules applied. Total rules applied 1518 place count 808 transition count 808
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1518 place count 808 transition count 805
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1524 place count 805 transition count 805
Performed 358 Post agglomeration using F-continuation condition.Transition count delta: 358
Deduced a syphon composed of 358 places in 0 ms
Reduce places removed 358 places and 0 transitions.
Iterating global reduction 3 with 716 rules applied. Total rules applied 2240 place count 447 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2241 place count 447 transition count 446
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 2243 place count 446 transition count 445
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
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 2445 place count 345 transition count 545
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 2479 place count 328 transition count 561
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2480 place count 327 transition count 560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2481 place count 326 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2482 place count 325 transition count 559
Applied a total of 2482 rules in 281 ms. Remains 325 /1568 variables (removed 1243) and now considering 559/1568 (removed 1009) transitions.
// Phase 1: matrix 559 rows 325 cols
[2021-05-17 19:30:19] [INFO ] Computed 160 place invariants in 1 ms
[2021-05-17 19:30:19] [INFO ] Implicit Places using invariants in 373 ms returned []
// Phase 1: matrix 559 rows 325 cols
[2021-05-17 19:30:19] [INFO ] Computed 160 place invariants in 3 ms
[2021-05-17 19:30:20] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 940 ms to find 0 implicit places.
[2021-05-17 19:30:20] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 559 rows 325 cols
[2021-05-17 19:30:20] [INFO ] Computed 160 place invariants in 1 ms
[2021-05-17 19:30:21] [INFO ] Dead Transitions using invariants and state equation in 602 ms returned []
Finished structural reductions, in 1 iterations. Remains : 325/1568 places, 559/1568 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-040B-07 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s220 1) (OR (NEQ s108 1) (NEQ s110 1) (NEQ s114 1))), p0:(AND (NEQ s220 1) (OR (NEQ s108 1) (NEQ s110 1) (NEQ s114 1))), p2:(AND (EQ s108 1) (EQ s110 1) (EQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13023 steps with 4 reset in 131 ms.
FORMULA ShieldRVt-PT-040B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-07 finished in 2057 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 1568 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1568/1568 places, 1568/1568 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1561 transition count 1561
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1561 transition count 1561
Applied a total of 14 rules in 197 ms. Remains 1561 /1568 variables (removed 7) and now considering 1561/1568 (removed 7) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2021-05-17 19:30:21] [INFO ] Computed 161 place invariants in 5 ms
[2021-05-17 19:30:22] [INFO ] Implicit Places using invariants in 638 ms returned []
// Phase 1: matrix 1561 rows 1561 cols
[2021-05-17 19:30:22] [INFO ] Computed 161 place invariants in 4 ms
[2021-05-17 19:30:24] [INFO ] Implicit Places using invariants and state equation in 1934 ms returned []
Implicit Place search using SMT with State Equation took 2574 ms to find 0 implicit places.
// Phase 1: matrix 1561 rows 1561 cols
[2021-05-17 19:30:24] [INFO ] Computed 161 place invariants in 7 ms
[2021-05-17 19:30:25] [INFO ] Dead Transitions using invariants and state equation in 1734 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1561/1568 places, 1561/1568 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-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:(EQ s920 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 0 ms.
FORMULA ShieldRVt-PT-040B-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-08 finished in 4633 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)||X(p2)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1568 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1568/1568 places, 1568/1568 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1562 transition count 1562
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1562 transition count 1562
Applied a total of 12 rules in 306 ms. Remains 1562 /1568 variables (removed 6) and now considering 1562/1568 (removed 6) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2021-05-17 19:30:26] [INFO ] Computed 161 place invariants in 6 ms
[2021-05-17 19:30:27] [INFO ] Implicit Places using invariants in 855 ms returned []
// Phase 1: matrix 1562 rows 1562 cols
[2021-05-17 19:30:27] [INFO ] Computed 161 place invariants in 4 ms
[2021-05-17 19:30:28] [INFO ] Implicit Places using invariants and state equation in 1829 ms returned []
Implicit Place search using SMT with State Equation took 2686 ms to find 0 implicit places.
// Phase 1: matrix 1562 rows 1562 cols
[2021-05-17 19:30:28] [INFO ] Computed 161 place invariants in 5 ms
[2021-05-17 19:30:30] [INFO ] Dead Transitions using invariants and state equation in 1603 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1562/1568 places, 1562/1568 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040B-09 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(EQ s707 1), p1:(EQ s265 1), p0:(EQ s707 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 900 ms.
Stack based approach found an accepted trace after 1290 steps with 0 reset with depth 1291 and stack size 1291 in 14 ms.
FORMULA ShieldRVt-PT-040B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-09 finished in 5719 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1568 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1568/1568 places, 1568/1568 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1562 transition count 1562
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1562 transition count 1562
Applied a total of 12 rules in 297 ms. Remains 1562 /1568 variables (removed 6) and now considering 1562/1568 (removed 6) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2021-05-17 19:30:31] [INFO ] Computed 161 place invariants in 6 ms
[2021-05-17 19:30:32] [INFO ] Implicit Places using invariants in 734 ms returned []
// Phase 1: matrix 1562 rows 1562 cols
[2021-05-17 19:30:32] [INFO ] Computed 161 place invariants in 4 ms
[2021-05-17 19:30:35] [INFO ] Implicit Places using invariants and state equation in 3015 ms returned []
Implicit Place search using SMT with State Equation took 3752 ms to find 0 implicit places.
// Phase 1: matrix 1562 rows 1562 cols
[2021-05-17 19:30:35] [INFO ] Computed 161 place invariants in 4 ms
[2021-05-17 19:30:37] [INFO ] Dead Transitions using invariants and state equation in 1596 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1562/1568 places, 1562/1568 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s893 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 22708 steps with 0 reset in 113 ms.
FORMULA ShieldRVt-PT-040B-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-11 finished in 5844 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1568 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1568/1568 places, 1568/1568 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1561 transition count 1561
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1561 transition count 1561
Applied a total of 14 rules in 289 ms. Remains 1561 /1568 variables (removed 7) and now considering 1561/1568 (removed 7) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2021-05-17 19:30:37] [INFO ] Computed 161 place invariants in 9 ms
[2021-05-17 19:30:38] [INFO ] Implicit Places using invariants in 819 ms returned []
// Phase 1: matrix 1561 rows 1561 cols
[2021-05-17 19:30:38] [INFO ] Computed 161 place invariants in 4 ms
[2021-05-17 19:30:40] [INFO ] Implicit Places using invariants and state equation in 2314 ms returned []
Implicit Place search using SMT with State Equation took 3138 ms to find 0 implicit places.
// Phase 1: matrix 1561 rows 1561 cols
[2021-05-17 19:30:40] [INFO ] Computed 161 place invariants in 6 ms
[2021-05-17 19:30:42] [INFO ] Dead Transitions using invariants and state equation in 1916 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1561/1568 places, 1561/1568 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1048 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 93110 steps with 3 reset in 465 ms.
FORMULA ShieldRVt-PT-040B-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-12 finished in 5896 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 1568 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1568/1568 places, 1568/1568 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1562 transition count 1562
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1562 transition count 1562
Applied a total of 12 rules in 193 ms. Remains 1562 /1568 variables (removed 6) and now considering 1562/1568 (removed 6) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2021-05-17 19:30:43] [INFO ] Computed 161 place invariants in 4 ms
[2021-05-17 19:30:44] [INFO ] Implicit Places using invariants in 591 ms returned []
// Phase 1: matrix 1562 rows 1562 cols
[2021-05-17 19:30:44] [INFO ] Computed 161 place invariants in 9 ms
[2021-05-17 19:30:46] [INFO ] Implicit Places using invariants and state equation in 2571 ms returned []
Implicit Place search using SMT with State Equation took 3167 ms to find 0 implicit places.
// Phase 1: matrix 1562 rows 1562 cols
[2021-05-17 19:30:46] [INFO ] Computed 161 place invariants in 6 ms
[2021-05-17 19:30:48] [INFO ] Dead Transitions using invariants and state equation in 1950 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1562/1568 places, 1562/1568 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-13 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}]], initial=3, aps=[p0:(EQ s1160 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-13 finished in 5435 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((X(p0)||(!p0 U (p1||G(!p0)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1568 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1568/1568 places, 1568/1568 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1561 transition count 1561
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1561 transition count 1561
Applied a total of 14 rules in 194 ms. Remains 1561 /1568 variables (removed 7) and now considering 1561/1568 (removed 7) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2021-05-17 19:30:49] [INFO ] Computed 161 place invariants in 4 ms
[2021-05-17 19:30:49] [INFO ] Implicit Places using invariants in 733 ms returned []
// Phase 1: matrix 1561 rows 1561 cols
[2021-05-17 19:30:49] [INFO ] Computed 161 place invariants in 7 ms
[2021-05-17 19:30:51] [INFO ] Implicit Places using invariants and state equation in 2130 ms returned []
Implicit Place search using SMT with State Equation took 2870 ms to find 0 implicit places.
// Phase 1: matrix 1561 rows 1561 cols
[2021-05-17 19:30:51] [INFO ] Computed 161 place invariants in 5 ms
[2021-05-17 19:30:53] [INFO ] Dead Transitions using invariants and state equation in 2098 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1561/1568 places, 1561/1568 transitions.
Stuttering acceptance computed with spot in 123 ms :[false, false, false, false]
Running random walk in product with property : ShieldRVt-PT-040B-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 2}]], initial=0, aps=[p1:(AND (NEQ s1251 1) (OR (NEQ s320 1) (NEQ s324 1) (NEQ s337 1))), p0:(AND (EQ s320 1) (EQ s324 1) (EQ s337 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 537 ms.
Product exploration explored 100000 steps with 2 reset in 804 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[false, false, false, false]
Product exploration explored 100000 steps with 1 reset in 561 ms.
Product exploration explored 100000 steps with 1 reset in 699 ms.
[2021-05-17 19:30:57] [INFO ] Flatten gal took : 82 ms
[2021-05-17 19:30:57] [INFO ] Flatten gal took : 75 ms
[2021-05-17 19:30:57] [INFO ] Time to serialize gal into /tmp/LTL2384568754149491137.gal : 38 ms
[2021-05-17 19:30:57] [INFO ] Time to serialize properties into /tmp/LTL7011090496687129283.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/LTL2384568754149491137.gal, -t, CGAL, -LTL, /tmp/LTL7011090496687129283.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/LTL2384568754149491137.gal -t CGAL -LTL /tmp/LTL7011090496687129283.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G((X("(((p399==1)&&(p405==1))&&(p421==1))"))||(("(((p399!=1)||(p405!=1))||(p421!=1))")U(("((p1600!=1)&&(((p399!=1)||(p405!=1))||(p421!=1)))")||(G("(((p399!=1)||(p405!=1))||(p421!=1))"))))))))
Formula 0 simplified : !FG(X"(((p399==1)&&(p405==1))&&(p421==1))" | ("(((p399!=1)||(p405!=1))||(p421!=1))" U ("((p1600!=1)&&(((p399!=1)||(p405!=1))||(p421!=1)))" | G"(((p399!=1)||(p405!=1))||(p421!=1))")))
Detected timeout of ITS tools.
[2021-05-17 19:31:12] [INFO ] Flatten gal took : 66 ms
[2021-05-17 19:31:12] [INFO ] Applying decomposition
[2021-05-17 19:31:12] [INFO ] Flatten gal took : 60 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/graph14298419218278375142.txt, -o, /tmp/graph14298419218278375142.bin, -w, /tmp/graph14298419218278375142.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/graph14298419218278375142.bin, -l, -1, -v, -w, /tmp/graph14298419218278375142.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 19:31:12] [INFO ] Decomposing Gal with order
[2021-05-17 19:31:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 19:31:13] [INFO ] Removed a total of 401 redundant transitions.
[2021-05-17 19:31:13] [INFO ] Flatten gal took : 206 ms
[2021-05-17 19:31:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2021-05-17 19:31:13] [INFO ] Time to serialize gal into /tmp/LTL11279235903569765542.gal : 27 ms
[2021-05-17 19:31:13] [INFO ] Time to serialize properties into /tmp/LTL16455823065314725835.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/LTL11279235903569765542.gal, -t, CGAL, -LTL, /tmp/LTL16455823065314725835.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/LTL11279235903569765542.gal -t CGAL -LTL /tmp/LTL16455823065314725835.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G((X("(((i10.i1.u124.p399==1)&&(i10.i2.u128.p405==1))&&(i10.i3.u132.p421==1))"))||(("(((i10.i1.u124.p399!=1)||(i10.i2.u128.p405!=1))||(i10.i3.u132.p421!=1))")U(("((i29.i4.u494.p1600!=1)&&(((i10.i1.u124.p399!=1)||(i10.i2.u128.p405!=1))||(i10.i3.u132.p421!=1)))")||(G("(((i10.i1.u124.p399!=1)||(i10.i2.u128.p405!=1))||(i10.i3.u132.p421!=1))"))))))))
Formula 0 simplified : !FG(X"(((i10.i1.u124.p399==1)&&(i10.i2.u128.p405==1))&&(i10.i3.u132.p421==1))" | ("(((i10.i1.u124.p399!=1)||(i10.i2.u128.p405!=1))||(i10.i3.u132.p421!=1))" U ("((i29.i4.u494.p1600!=1)&&(((i10.i1.u124.p399!=1)||(i10.i2.u128.p405!=1))||(i10.i3.u132.p421!=1)))" | G"(((i10.i1.u124.p399!=1)||(i10.i2.u128.p405!=1))||(i10.i3.u132.p421!=1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10821456479684492693
[2021-05-17 19:31:28] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10821456479684492693
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/ltsmin10821456479684492693]
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/ltsmin10821456479684492693] 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/ltsmin10821456479684492693] 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 ShieldRVt-PT-040B-14 finished in 40861 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&(p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1568 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1568/1568 places, 1568/1568 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 438 transitions
Trivial Post-agglo rules discarded 438 transitions
Performed 438 trivial Post agglomeration. Transition count delta: 438
Iterating post reduction 0 with 438 rules applied. Total rules applied 438 place count 1567 transition count 1129
Reduce places removed 438 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 439 rules applied. Total rules applied 877 place count 1129 transition count 1128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 878 place count 1128 transition count 1128
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 315 Pre rules applied. Total rules applied 878 place count 1128 transition count 813
Deduced a syphon composed of 315 places in 2 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 3 with 630 rules applied. Total rules applied 1508 place count 813 transition count 813
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1513 place count 808 transition count 808
Iterating global reduction 3 with 5 rules applied. Total rules applied 1518 place count 808 transition count 808
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1518 place count 808 transition count 805
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1524 place count 805 transition count 805
Performed 356 Post agglomeration using F-continuation condition.Transition count delta: 356
Deduced a syphon composed of 356 places in 1 ms
Reduce places removed 356 places and 0 transitions.
Iterating global reduction 3 with 712 rules applied. Total rules applied 2236 place count 449 transition count 449
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2237 place count 449 transition count 448
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 2239 place count 448 transition count 447
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2441 place count 347 transition count 547
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 2477 place count 329 transition count 565
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2478 place count 328 transition count 564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2479 place count 327 transition count 564
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2480 place count 326 transition count 563
Applied a total of 2480 rules in 295 ms. Remains 326 /1568 variables (removed 1242) and now considering 563/1568 (removed 1005) transitions.
// Phase 1: matrix 563 rows 326 cols
[2021-05-17 19:31:29] [INFO ] Computed 160 place invariants in 1 ms
[2021-05-17 19:31:30] [INFO ] Implicit Places using invariants in 368 ms returned []
// Phase 1: matrix 563 rows 326 cols
[2021-05-17 19:31:30] [INFO ] Computed 160 place invariants in 1 ms
[2021-05-17 19:31:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-17 19:31:31] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
[2021-05-17 19:31:31] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 563 rows 326 cols
[2021-05-17 19:31:31] [INFO ] Computed 160 place invariants in 1 ms
[2021-05-17 19:31:31] [INFO ] Dead Transitions using invariants and state equation in 505 ms returned []
Finished structural reductions, in 1 iterations. Remains : 326/1568 places, 563/1568 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-040B-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s281 0), p2:(AND (EQ s78 1) (EQ s82 1)), p1:(EQ s96 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-15 finished in 2045 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin367818525432056760
[2021-05-17 19:31:31] [INFO ] Too many transitions (1568) to apply POR reductions. Disabling POR matrices.
[2021-05-17 19:31:31] [INFO ] Applying decomposition
[2021-05-17 19:31:31] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin367818525432056760
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/ltsmin367818525432056760]
[2021-05-17 19:31:31] [INFO ] Flatten gal took : 118 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/graph5178196363116407274.txt, -o, /tmp/graph5178196363116407274.bin, -w, /tmp/graph5178196363116407274.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/graph5178196363116407274.bin, -l, -1, -v, -w, /tmp/graph5178196363116407274.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 19:31:32] [INFO ] Decomposing Gal with order
[2021-05-17 19:31:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 19:31:32] [INFO ] Removed a total of 388 redundant transitions.
[2021-05-17 19:31:32] [INFO ] Flatten gal took : 137 ms
[2021-05-17 19:31:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2021-05-17 19:31:32] [INFO ] Time to serialize gal into /tmp/LTLFireability6081596547547584422.gal : 22 ms
[2021-05-17 19:31:32] [INFO ] Time to serialize properties into /tmp/LTLFireability13331794723565337256.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/LTLFireability6081596547547584422.gal, -t, CGAL, -LTL, /tmp/LTLFireability13331794723565337256.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/LTLFireability6081596547547584422.gal -t CGAL -LTL /tmp/LTLFireability13331794723565337256.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G((X("(((i11.i1.u127.p399==1)&&(i11.i2.u130.p405==1))&&(i11.i3.u135.p421==1))"))||((!("(((i11.i1.u127.p399==1)&&(i11.i2.u130.p405==1))&&(i11.i3.u135.p421==1))"))U(("((i30.i4.u494.p1600!=1)&&(!(((i11.i1.u127.p399==1)&&(i11.i2.u130.p405==1))&&(i11.i3.u135.p421==1))))")||(G(!("(((i11.i1.u127.p399==1)&&(i11.i2.u130.p405==1))&&(i11.i3.u135.p421==1))")))))))))
Formula 0 simplified : !FG(X"(((i11.i1.u127.p399==1)&&(i11.i2.u130.p405==1))&&(i11.i3.u135.p421==1))" | (!"(((i11.i1.u127.p399==1)&&(i11.i2.u130.p405==1))&&(i11.i3.u135.p421==1))" U ("((i30.i4.u494.p1600!=1)&&(!(((i11.i1.u127.p399==1)&&(i11.i2.u130.p405==1))&&(i11.i3.u135.p421==1))))" | G!"(((i11.i1.u127.p399==1)&&(i11.i2.u130.p405==1))&&(i11.i3.u135.p421==1))")))
Compilation finished in 23379 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin367818525432056760]
Link finished in 67 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, <>([]((X((LTLAPp0==true))||(!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin367818525432056760]
LTSmin run took 42260 ms.
FORMULA ShieldRVt-PT-040B-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621279958700

--------------------
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="ShieldRVt-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 ShieldRVt-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 r235-smll-162106564800317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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