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-162106564800316.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-smll-162106564800316
=====================================================================

--------------------
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 1621279471661

Running Version 0
[2021-05-17 19:24:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:24:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 19:24:34] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2021-05-17 19:24:34] [INFO ] Transformed 2003 places.
[2021-05-17 19:24:34] [INFO ] Transformed 2003 transitions.
[2021-05-17 19:24:34] [INFO ] Found NUPN structural information;
[2021-05-17 19:24:34] [INFO ] Parsed PT model containing 2003 places and 2003 transitions in 365 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 19:24:34] [INFO ] Initial state test concluded for 1 properties.
FORMULA ShieldRVt-PT-040B-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 2003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Discarding 427 places :
Symmetric choice reduction at 0 with 427 rule applications. Total rules 427 place count 1576 transition count 1576
Iterating global reduction 0 with 427 rules applied. Total rules applied 854 place count 1576 transition count 1576
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 855 place count 1575 transition count 1575
Iterating global reduction 0 with 1 rules applied. Total rules applied 856 place count 1575 transition count 1575
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 857 place count 1574 transition count 1574
Iterating global reduction 0 with 1 rules applied. Total rules applied 858 place count 1574 transition count 1574
Applied a total of 858 rules in 1002 ms. Remains 1574 /2003 variables (removed 429) and now considering 1574/2003 (removed 429) transitions.
// Phase 1: matrix 1574 rows 1574 cols
[2021-05-17 19:24:36] [INFO ] Computed 161 place invariants in 57 ms
[2021-05-17 19:24:37] [INFO ] Implicit Places using invariants in 1062 ms returned []
// Phase 1: matrix 1574 rows 1574 cols
[2021-05-17 19:24:37] [INFO ] Computed 161 place invariants in 16 ms
[2021-05-17 19:24:39] [INFO ] Implicit Places using invariants and state equation in 2026 ms returned []
Implicit Place search using SMT with State Equation took 3127 ms to find 0 implicit places.
// Phase 1: matrix 1574 rows 1574 cols
[2021-05-17 19:24:39] [INFO ] Computed 161 place invariants in 12 ms
[2021-05-17 19:24:40] [INFO ] Dead Transitions using invariants and state equation in 1776 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1574/2003 places, 1574/2003 transitions.
[2021-05-17 19:24:41] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 19:24:41] [INFO ] Flatten gal took : 211 ms
FORMULA ShieldRVt-PT-040B-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 19:24:41] [INFO ] Flatten gal took : 126 ms
[2021-05-17 19:24:41] [INFO ] Input system was already deterministic with 1574 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 807 ms. (steps per millisecond=123 ) properties (out of 16) seen :7
Running SMT prover for 9 properties.
// Phase 1: matrix 1574 rows 1574 cols
[2021-05-17 19:24:42] [INFO ] Computed 161 place invariants in 7 ms
[2021-05-17 19:24:42] [INFO ] [Real]Absence check using 161 positive place invariants in 89 ms returned sat
[2021-05-17 19:24:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:24:43] [INFO ] [Real]Absence check using state equation in 823 ms returned sat
[2021-05-17 19:24:44] [INFO ] Deduced a trap composed of 27 places in 847 ms of which 19 ms to minimize.
[2021-05-17 19:24:45] [INFO ] Deduced a trap composed of 33 places in 936 ms of which 3 ms to minimize.
[2021-05-17 19:24:46] [INFO ] Deduced a trap composed of 27 places in 694 ms of which 3 ms to minimize.
[2021-05-17 19:24:47] [INFO ] Deduced a trap composed of 43 places in 556 ms of which 3 ms to minimize.
[2021-05-17 19:24:48] [INFO ] Deduced a trap composed of 32 places in 761 ms of which 2 ms to minimize.
[2021-05-17 19:24:48] [INFO ] Deduced a trap composed of 22 places in 669 ms of which 1 ms to minimize.
[2021-05-17 19:24:49] [INFO ] Deduced a trap composed of 47 places in 573 ms of which 2 ms to minimize.
[2021-05-17 19:24:50] [INFO ] Deduced a trap composed of 30 places in 831 ms of which 2 ms to minimize.
[2021-05-17 19:24:51] [INFO ] Deduced a trap composed of 40 places in 581 ms of which 2 ms to minimize.
[2021-05-17 19:24:52] [INFO ] Deduced a trap composed of 39 places in 925 ms of which 2 ms to minimize.
[2021-05-17 19:24:53] [INFO ] Deduced a trap composed of 45 places in 781 ms of which 1 ms to minimize.
[2021-05-17 19:24:53] [INFO ] Deduced a trap composed of 45 places in 648 ms of which 2 ms to minimize.
[2021-05-17 19:24:54] [INFO ] Deduced a trap composed of 48 places in 816 ms of which 1 ms to minimize.
[2021-05-17 19:24:55] [INFO ] Deduced a trap composed of 41 places in 830 ms of which 2 ms to minimize.
[2021-05-17 19:24:56] [INFO ] Deduced a trap composed of 33 places in 755 ms of which 1 ms to minimize.
[2021-05-17 19:24:57] [INFO ] Deduced a trap composed of 27 places in 539 ms of which 2 ms to minimize.
[2021-05-17 19:24:58] [INFO ] Deduced a trap composed of 39 places in 712 ms of which 2 ms to minimize.
[2021-05-17 19:24:59] [INFO ] Deduced a trap composed of 52 places in 834 ms of which 3 ms to minimize.
[2021-05-17 19:24:59] [INFO ] Deduced a trap composed of 39 places in 825 ms of which 2 ms to minimize.
[2021-05-17 19:25:01] [INFO ] Deduced a trap composed of 36 places in 984 ms of which 3 ms to minimize.
[2021-05-17 19:25:02] [INFO ] Deduced a trap composed of 24 places in 852 ms of which 2 ms to minimize.
[2021-05-17 19:25:02] [INFO ] Deduced a trap composed of 46 places in 704 ms of which 1 ms to minimize.
[2021-05-17 19:25: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 0
[2021-05-17 19:25:03] [INFO ] [Real]Absence check using 161 positive place invariants in 142 ms returned sat
[2021-05-17 19:25:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:25:04] [INFO ] [Real]Absence check using state equation in 1098 ms returned sat
[2021-05-17 19:25:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:25:05] [INFO ] [Nat]Absence check using 161 positive place invariants in 134 ms returned sat
[2021-05-17 19:25:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:25:06] [INFO ] [Nat]Absence check using state equation in 1106 ms returned sat
[2021-05-17 19:25:06] [INFO ] Deduced a trap composed of 41 places in 626 ms of which 2 ms to minimize.
[2021-05-17 19:25:07] [INFO ] Deduced a trap composed of 26 places in 804 ms of which 1 ms to minimize.
[2021-05-17 19:25:08] [INFO ] Deduced a trap composed of 36 places in 780 ms of which 2 ms to minimize.
[2021-05-17 19:25:09] [INFO ] Deduced a trap composed of 47 places in 668 ms of which 2 ms to minimize.
[2021-05-17 19:25:10] [INFO ] Deduced a trap composed of 40 places in 647 ms of which 2 ms to minimize.
[2021-05-17 19:25:11] [INFO ] Deduced a trap composed of 32 places in 778 ms of which 2 ms to minimize.
[2021-05-17 19:25:11] [INFO ] Deduced a trap composed of 27 places in 716 ms of which 2 ms to minimize.
[2021-05-17 19:25:12] [INFO ] Deduced a trap composed of 33 places in 663 ms of which 2 ms to minimize.
[2021-05-17 19:25:13] [INFO ] Deduced a trap composed of 28 places in 510 ms of which 2 ms to minimize.
[2021-05-17 19:25:13] [INFO ] Deduced a trap composed of 41 places in 629 ms of which 1 ms to minimize.
[2021-05-17 19:25:14] [INFO ] Deduced a trap composed of 34 places in 582 ms of which 2 ms to minimize.
[2021-05-17 19:25:15] [INFO ] Deduced a trap composed of 42 places in 597 ms of which 10 ms to minimize.
[2021-05-17 19:25:16] [INFO ] Deduced a trap composed of 42 places in 694 ms of which 1 ms to minimize.
[2021-05-17 19:25:16] [INFO ] Deduced a trap composed of 27 places in 521 ms of which 1 ms to minimize.
[2021-05-17 19:25:17] [INFO ] Deduced a trap composed of 24 places in 407 ms of which 1 ms to minimize.
[2021-05-17 19:25:17] [INFO ] Deduced a trap composed of 41 places in 440 ms of which 2 ms to minimize.
[2021-05-17 19:25:18] [INFO ] Deduced a trap composed of 44 places in 439 ms of which 1 ms to minimize.
[2021-05-17 19:25:18] [INFO ] Deduced a trap composed of 46 places in 483 ms of which 3 ms to minimize.
[2021-05-17 19:25:19] [INFO ] Deduced a trap composed of 50 places in 567 ms of which 2 ms to minimize.
[2021-05-17 19:25:20] [INFO ] Deduced a trap composed of 52 places in 537 ms of which 1 ms to minimize.
[2021-05-17 19:25:20] [INFO ] Deduced a trap composed of 45 places in 548 ms of which 6 ms to minimize.
[2021-05-17 19:25:21] [INFO ] Deduced a trap composed of 49 places in 554 ms of which 2 ms to minimize.
[2021-05-17 19:25:22] [INFO ] Deduced a trap composed of 48 places in 483 ms of which 1 ms to minimize.
[2021-05-17 19:25:22] [INFO ] Deduced a trap composed of 57 places in 453 ms of which 2 ms to minimize.
[2021-05-17 19:25:23] [INFO ] Deduced a trap composed of 55 places in 449 ms of which 1 ms to minimize.
[2021-05-17 19:25:23] [INFO ] Deduced a trap composed of 48 places in 408 ms of which 1 ms to minimize.
[2021-05-17 19:25:24] [INFO ] Deduced a trap composed of 58 places in 404 ms of which 1 ms to minimize.
[2021-05-17 19:25:24] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 18172 ms
[2021-05-17 19:25:24] [INFO ] Computed and/alt/rep : 1573/2298/1573 causal constraints (skipped 0 transitions) in 170 ms.
[2021-05-17 19:25:24] [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:25] [INFO ] [Real]Absence check using 161 positive place invariants in 147 ms returned sat
[2021-05-17 19:25:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:25:26] [INFO ] [Real]Absence check using state equation in 1165 ms returned sat
[2021-05-17 19:25:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:25:26] [INFO ] [Nat]Absence check using 161 positive place invariants in 64 ms returned unsat
[2021-05-17 19:25:26] [INFO ] [Real]Absence check using 161 positive place invariants in 91 ms returned sat
[2021-05-17 19:25:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:25:27] [INFO ] [Real]Absence check using state equation in 853 ms returned sat
[2021-05-17 19:25:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:25:28] [INFO ] [Nat]Absence check using 161 positive place invariants in 90 ms returned sat
[2021-05-17 19:25:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:25:28] [INFO ] [Nat]Absence check using state equation in 865 ms returned sat
[2021-05-17 19:25:29] [INFO ] Deduced a trap composed of 27 places in 574 ms of which 1 ms to minimize.
[2021-05-17 19:25:30] [INFO ] Deduced a trap composed of 34 places in 653 ms of which 3 ms to minimize.
[2021-05-17 19:25:31] [INFO ] Deduced a trap composed of 35 places in 847 ms of which 2 ms to minimize.
[2021-05-17 19:25:32] [INFO ] Deduced a trap composed of 35 places in 741 ms of which 1 ms to minimize.
[2021-05-17 19:25:32] [INFO ] Deduced a trap composed of 44 places in 521 ms of which 1 ms to minimize.
[2021-05-17 19:25:33] [INFO ] Deduced a trap composed of 48 places in 622 ms of which 2 ms to minimize.
[2021-05-17 19:25:34] [INFO ] Deduced a trap composed of 27 places in 786 ms of which 3 ms to minimize.
[2021-05-17 19:25:35] [INFO ] Deduced a trap composed of 31 places in 775 ms of which 7 ms to minimize.
[2021-05-17 19:25:36] [INFO ] Deduced a trap composed of 49 places in 779 ms of which 2 ms to minimize.
[2021-05-17 19:25:36] [INFO ] Deduced a trap composed of 28 places in 677 ms of which 2 ms to minimize.
[2021-05-17 19:25:37] [INFO ] Deduced a trap composed of 28 places in 699 ms of which 1 ms to minimize.
[2021-05-17 19:25:38] [INFO ] Deduced a trap composed of 27 places in 632 ms of which 1 ms to minimize.
[2021-05-17 19:25:39] [INFO ] Deduced a trap composed of 33 places in 619 ms of which 1 ms to minimize.
[2021-05-17 19:25:39] [INFO ] Deduced a trap composed of 67 places in 417 ms of which 2 ms to minimize.
[2021-05-17 19:25:40] [INFO ] Deduced a trap composed of 36 places in 480 ms of which 1 ms to minimize.
[2021-05-17 19:25:40] [INFO ] Deduced a trap composed of 42 places in 511 ms of which 1 ms to minimize.
[2021-05-17 19:25:41] [INFO ] Deduced a trap composed of 41 places in 633 ms of which 4 ms to minimize.
[2021-05-17 19:25:42] [INFO ] Deduced a trap composed of 49 places in 607 ms of which 3 ms to minimize.
[2021-05-17 19:25:42] [INFO ] Deduced a trap composed of 42 places in 592 ms of which 11 ms to minimize.
[2021-05-17 19:25:43] [INFO ] Deduced a trap composed of 24 places in 649 ms of which 2 ms to minimize.
[2021-05-17 19:25:44] [INFO ] Deduced a trap composed of 56 places in 537 ms of which 2 ms to minimize.
[2021-05-17 19:25:44] [INFO ] Deduced a trap composed of 63 places in 588 ms of which 2 ms to minimize.
[2021-05-17 19:25:45] [INFO ] Deduced a trap composed of 45 places in 585 ms of which 2 ms to minimize.
[2021-05-17 19:25:46] [INFO ] Deduced a trap composed of 41 places in 520 ms of which 1 ms to minimize.
[2021-05-17 19:25:46] [INFO ] Deduced a trap composed of 44 places in 545 ms of which 2 ms to minimize.
[2021-05-17 19:25:47] [INFO ] Deduced a trap composed of 64 places in 558 ms of which 2 ms to minimize.
[2021-05-17 19:25:48] [INFO ] Deduced a trap composed of 57 places in 539 ms of which 2 ms to minimize.
[2021-05-17 19:25:48] [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:25:48] [INFO ] [Real]Absence check using 161 positive place invariants in 133 ms returned sat
[2021-05-17 19:25:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:25:49] [INFO ] [Real]Absence check using state equation in 1120 ms returned sat
[2021-05-17 19:25:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:25:50] [INFO ] [Nat]Absence check using 161 positive place invariants in 122 ms returned sat
[2021-05-17 19:25:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:25:51] [INFO ] [Nat]Absence check using state equation in 1196 ms returned sat
[2021-05-17 19:25:52] [INFO ] Deduced a trap composed of 24 places in 735 ms of which 1 ms to minimize.
[2021-05-17 19:25:52] [INFO ] Deduced a trap composed of 47 places in 699 ms of which 2 ms to minimize.
[2021-05-17 19:25:53] [INFO ] Deduced a trap composed of 22 places in 918 ms of which 2 ms to minimize.
[2021-05-17 19:25:54] [INFO ] Deduced a trap composed of 27 places in 842 ms of which 2 ms to minimize.
[2021-05-17 19:25:55] [INFO ] Deduced a trap composed of 35 places in 750 ms of which 1 ms to minimize.
[2021-05-17 19:25:56] [INFO ] Deduced a trap composed of 24 places in 707 ms of which 2 ms to minimize.
[2021-05-17 19:25:57] [INFO ] Deduced a trap composed of 27 places in 842 ms of which 2 ms to minimize.
[2021-05-17 19:25:58] [INFO ] Deduced a trap composed of 22 places in 857 ms of which 2 ms to minimize.
[2021-05-17 19:25:59] [INFO ] Deduced a trap composed of 23 places in 825 ms of which 2 ms to minimize.
[2021-05-17 19:26:00] [INFO ] Deduced a trap composed of 29 places in 800 ms of which 2 ms to minimize.
[2021-05-17 19:26:01] [INFO ] Deduced a trap composed of 23 places in 772 ms of which 2 ms to minimize.
[2021-05-17 19:26:01] [INFO ] Deduced a trap composed of 32 places in 757 ms of which 2 ms to minimize.
[2021-05-17 19:26:02] [INFO ] Deduced a trap composed of 36 places in 653 ms of which 2 ms to minimize.
[2021-05-17 19:26:03] [INFO ] Deduced a trap composed of 48 places in 743 ms of which 1 ms to minimize.
[2021-05-17 19:26:04] [INFO ] Deduced a trap composed of 40 places in 373 ms of which 1 ms to minimize.
[2021-05-17 19:26:04] [INFO ] Deduced a trap composed of 50 places in 564 ms of which 1 ms to minimize.
[2021-05-17 19:26:05] [INFO ] Deduced a trap composed of 48 places in 609 ms of which 2 ms to minimize.
[2021-05-17 19:26:06] [INFO ] Deduced a trap composed of 36 places in 722 ms of which 2 ms to minimize.
[2021-05-17 19:26:06] [INFO ] Deduced a trap composed of 46 places in 634 ms of which 2 ms to minimize.
[2021-05-17 19:26:07] [INFO ] Deduced a trap composed of 57 places in 615 ms of which 2 ms to minimize.
[2021-05-17 19:26:08] [INFO ] Deduced a trap composed of 33 places in 584 ms of which 1 ms to minimize.
[2021-05-17 19:26:09] [INFO ] Deduced a trap composed of 26 places in 605 ms of which 1 ms to minimize.
[2021-05-17 19:26:09] [INFO ] Deduced a trap composed of 24 places in 578 ms of which 1 ms to minimize.
[2021-05-17 19:26:10] [INFO ] Deduced a trap composed of 33 places in 473 ms of which 1 ms to minimize.
[2021-05-17 19:26:10] [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:26:10] [INFO ] [Real]Absence check using 161 positive place invariants in 140 ms returned sat
[2021-05-17 19:26:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:26:11] [INFO ] [Real]Absence check using state equation in 1151 ms returned sat
[2021-05-17 19:26:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:26:12] [INFO ] [Nat]Absence check using 161 positive place invariants in 141 ms returned sat
[2021-05-17 19:26:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:26:13] [INFO ] [Nat]Absence check using state equation in 1095 ms returned sat
[2021-05-17 19:26:14] [INFO ] Deduced a trap composed of 24 places in 727 ms of which 1 ms to minimize.
[2021-05-17 19:26:14] [INFO ] Deduced a trap composed of 47 places in 712 ms of which 2 ms to minimize.
[2021-05-17 19:26:15] [INFO ] Deduced a trap composed of 22 places in 879 ms of which 2 ms to minimize.
[2021-05-17 19:26:16] [INFO ] Deduced a trap composed of 27 places in 824 ms of which 2 ms to minimize.
[2021-05-17 19:26:17] [INFO ] Deduced a trap composed of 35 places in 830 ms of which 2 ms to minimize.
[2021-05-17 19:26:18] [INFO ] Deduced a trap composed of 24 places in 806 ms of which 2 ms to minimize.
[2021-05-17 19:26:19] [INFO ] Deduced a trap composed of 27 places in 817 ms of which 2 ms to minimize.
[2021-05-17 19:26:20] [INFO ] Deduced a trap composed of 22 places in 778 ms of which 2 ms to minimize.
[2021-05-17 19:26:21] [INFO ] Deduced a trap composed of 23 places in 845 ms of which 2 ms to minimize.
[2021-05-17 19:26:22] [INFO ] Deduced a trap composed of 29 places in 790 ms of which 2 ms to minimize.
[2021-05-17 19:26:23] [INFO ] Deduced a trap composed of 23 places in 772 ms of which 2 ms to minimize.
[2021-05-17 19:26:24] [INFO ] Deduced a trap composed of 32 places in 707 ms of which 2 ms to minimize.
[2021-05-17 19:26:24] [INFO ] Deduced a trap composed of 36 places in 803 ms of which 2 ms to minimize.
[2021-05-17 19:26:25] [INFO ] Deduced a trap composed of 48 places in 677 ms of which 1 ms to minimize.
[2021-05-17 19:26:26] [INFO ] Deduced a trap composed of 40 places in 570 ms of which 2 ms to minimize.
[2021-05-17 19:26:27] [INFO ] Deduced a trap composed of 50 places in 685 ms of which 1 ms to minimize.
[2021-05-17 19:26:27] [INFO ] Deduced a trap composed of 48 places in 522 ms of which 2 ms to minimize.
[2021-05-17 19:26:28] [INFO ] Deduced a trap composed of 36 places in 717 ms of which 2 ms to minimize.
[2021-05-17 19:26:29] [INFO ] Deduced a trap composed of 46 places in 619 ms of which 1 ms to minimize.
[2021-05-17 19:26:29] [INFO ] Deduced a trap composed of 57 places in 605 ms of which 1 ms to minimize.
[2021-05-17 19:26:30] [INFO ] Deduced a trap composed of 33 places in 624 ms of which 2 ms to minimize.
[2021-05-17 19:26:31] [INFO ] Deduced a trap composed of 26 places in 625 ms of which 2 ms to minimize.
[2021-05-17 19:26:32] [INFO ] Deduced a trap composed of 24 places in 600 ms of which 1 ms to minimize.
[2021-05-17 19:26:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-05-17 19:26:32] [INFO ] [Real]Absence check using 161 positive place invariants in 88 ms returned sat
[2021-05-17 19:26:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:26:33] [INFO ] [Real]Absence check using state equation in 1000 ms returned sat
[2021-05-17 19:26:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:26:33] [INFO ] [Nat]Absence check using 161 positive place invariants in 145 ms returned sat
[2021-05-17 19:26:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:26:34] [INFO ] [Nat]Absence check using state equation in 1081 ms returned sat
[2021-05-17 19:26:35] [INFO ] Deduced a trap composed of 24 places in 869 ms of which 2 ms to minimize.
[2021-05-17 19:26:36] [INFO ] Deduced a trap composed of 47 places in 784 ms of which 1 ms to minimize.
[2021-05-17 19:26:37] [INFO ] Deduced a trap composed of 22 places in 746 ms of which 2 ms to minimize.
[2021-05-17 19:26:38] [INFO ] Deduced a trap composed of 27 places in 851 ms of which 2 ms to minimize.
[2021-05-17 19:26:39] [INFO ] Deduced a trap composed of 35 places in 770 ms of which 2 ms to minimize.
[2021-05-17 19:26:40] [INFO ] Deduced a trap composed of 24 places in 885 ms of which 2 ms to minimize.
[2021-05-17 19:26:41] [INFO ] Deduced a trap composed of 27 places in 750 ms of which 2 ms to minimize.
[2021-05-17 19:26:41] [INFO ] Deduced a trap composed of 22 places in 647 ms of which 2 ms to minimize.
[2021-05-17 19:26:42] [INFO ] Deduced a trap composed of 23 places in 831 ms of which 2 ms to minimize.
[2021-05-17 19:26:43] [INFO ] Deduced a trap composed of 29 places in 791 ms of which 2 ms to minimize.
[2021-05-17 19:26:44] [INFO ] Deduced a trap composed of 23 places in 749 ms of which 12 ms to minimize.
[2021-05-17 19:26:45] [INFO ] Deduced a trap composed of 32 places in 553 ms of which 1 ms to minimize.
[2021-05-17 19:26:46] [INFO ] Deduced a trap composed of 36 places in 726 ms of which 1 ms to minimize.
[2021-05-17 19:26:46] [INFO ] Deduced a trap composed of 48 places in 714 ms of which 7 ms to minimize.
[2021-05-17 19:26:47] [INFO ] Deduced a trap composed of 40 places in 692 ms of which 1 ms to minimize.
[2021-05-17 19:26:48] [INFO ] Deduced a trap composed of 50 places in 455 ms of which 1 ms to minimize.
[2021-05-17 19:26:48] [INFO ] Deduced a trap composed of 48 places in 515 ms of which 2 ms to minimize.
[2021-05-17 19:26:49] [INFO ] Deduced a trap composed of 36 places in 706 ms of which 1 ms to minimize.
[2021-05-17 19:26:50] [INFO ] Deduced a trap composed of 46 places in 432 ms of which 2 ms to minimize.
[2021-05-17 19:26:50] [INFO ] Deduced a trap composed of 57 places in 616 ms of which 2 ms to minimize.
[2021-05-17 19:26:51] [INFO ] Deduced a trap composed of 33 places in 642 ms of which 2 ms to minimize.
[2021-05-17 19:26:52] [INFO ] Deduced a trap composed of 26 places in 593 ms of which 1 ms to minimize.
[2021-05-17 19:26:52] [INFO ] Deduced a trap composed of 24 places in 624 ms of which 2 ms to minimize.
[2021-05-17 19:26:53] [INFO ] Deduced a trap composed of 33 places in 600 ms of which 2 ms to minimize.
[2021-05-17 19:26:53] [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:26:54] [INFO ] [Real]Absence check using 161 positive place invariants in 142 ms returned sat
[2021-05-17 19:26:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:26:55] [INFO ] [Real]Absence check using state equation in 1030 ms returned sat
[2021-05-17 19:26:55] [INFO ] Deduced a trap composed of 28 places in 528 ms of which 1 ms to minimize.
[2021-05-17 19:26:56] [INFO ] Deduced a trap composed of 29 places in 649 ms of which 1 ms to minimize.
[2021-05-17 19:26:57] [INFO ] Deduced a trap composed of 23 places in 715 ms of which 1 ms to minimize.
[2021-05-17 19:26:58] [INFO ] Deduced a trap composed of 33 places in 747 ms of which 1 ms to minimize.
[2021-05-17 19:26:59] [INFO ] Deduced a trap composed of 36 places in 742 ms of which 2 ms to minimize.
[2021-05-17 19:26:59] [INFO ] Deduced a trap composed of 41 places in 732 ms of which 2 ms to minimize.
[2021-05-17 19:27:00] [INFO ] Deduced a trap composed of 42 places in 710 ms of which 2 ms to minimize.
[2021-05-17 19:27:01] [INFO ] Deduced a trap composed of 42 places in 701 ms of which 2 ms to minimize.
[2021-05-17 19:27:02] [INFO ] Deduced a trap composed of 52 places in 707 ms of which 2 ms to minimize.
[2021-05-17 19:27:03] [INFO ] Deduced a trap composed of 36 places in 678 ms of which 1 ms to minimize.
[2021-05-17 19:27:03] [INFO ] Deduced a trap composed of 49 places in 711 ms of which 1 ms to minimize.
[2021-05-17 19:27:04] [INFO ] Deduced a trap composed of 23 places in 676 ms of which 2 ms to minimize.
[2021-05-17 19:27:05] [INFO ] Deduced a trap composed of 26 places in 656 ms of which 2 ms to minimize.
[2021-05-17 19:27:06] [INFO ] Deduced a trap composed of 43 places in 649 ms of which 2 ms to minimize.
[2021-05-17 19:27:06] [INFO ] Deduced a trap composed of 40 places in 640 ms of which 2 ms to minimize.
[2021-05-17 19:27:07] [INFO ] Deduced a trap composed of 34 places in 576 ms of which 1 ms to minimize.
[2021-05-17 19:27:08] [INFO ] Deduced a trap composed of 41 places in 597 ms of which 2 ms to minimize.
[2021-05-17 19:27:09] [INFO ] Deduced a trap composed of 61 places in 571 ms of which 2 ms to minimize.
[2021-05-17 19:27:09] [INFO ] Deduced a trap composed of 44 places in 364 ms of which 1 ms to minimize.
[2021-05-17 19:27:10] [INFO ] Deduced a trap composed of 33 places in 435 ms of which 1 ms to minimize.
[2021-05-17 19:27:10] [INFO ] Deduced a trap composed of 42 places in 469 ms of which 2 ms to minimize.
[2021-05-17 19:27:11] [INFO ] Deduced a trap composed of 42 places in 469 ms of which 1 ms to minimize.
[2021-05-17 19:27:11] [INFO ] Deduced a trap composed of 33 places in 533 ms of which 1 ms to minimize.
[2021-05-17 19:27:12] [INFO ] Deduced a trap composed of 50 places in 590 ms of which 2 ms to minimize.
[2021-05-17 19:27:13] [INFO ] Deduced a trap composed of 48 places in 576 ms of which 1 ms to minimize.
[2021-05-17 19:27:13] [INFO ] Deduced a trap composed of 54 places in 556 ms of which 2 ms to minimize.
[2021-05-17 19:27:13] [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:27:14] [INFO ] [Real]Absence check using 161 positive place invariants in 130 ms returned sat
[2021-05-17 19:27:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:27:15] [INFO ] [Real]Absence check using state equation in 1064 ms returned sat
[2021-05-17 19:27:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:27:15] [INFO ] [Nat]Absence check using 161 positive place invariants in 141 ms returned sat
[2021-05-17 19:27:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:27:16] [INFO ] [Nat]Absence check using state equation in 1176 ms returned sat
[2021-05-17 19:27:17] [INFO ] Deduced a trap composed of 32 places in 865 ms of which 2 ms to minimize.
[2021-05-17 19:27:18] [INFO ] Deduced a trap composed of 36 places in 844 ms of which 2 ms to minimize.
[2021-05-17 19:27:19] [INFO ] Deduced a trap composed of 28 places in 844 ms of which 4 ms to minimize.
[2021-05-17 19:27:20] [INFO ] Deduced a trap composed of 27 places in 823 ms of which 1 ms to minimize.
[2021-05-17 19:27:21] [INFO ] Deduced a trap composed of 34 places in 806 ms of which 2 ms to minimize.
[2021-05-17 19:27:22] [INFO ] Deduced a trap composed of 24 places in 815 ms of which 2 ms to minimize.
[2021-05-17 19:27:23] [INFO ] Deduced a trap composed of 36 places in 823 ms of which 1 ms to minimize.
[2021-05-17 19:27:24] [INFO ] Deduced a trap composed of 35 places in 800 ms of which 1 ms to minimize.
[2021-05-17 19:27:25] [INFO ] Deduced a trap composed of 43 places in 737 ms of which 2 ms to minimize.
[2021-05-17 19:27:25] [INFO ] Deduced a trap composed of 42 places in 670 ms of which 2 ms to minimize.
[2021-05-17 19:27:26] [INFO ] Deduced a trap composed of 46 places in 648 ms of which 1 ms to minimize.
[2021-05-17 19:27:27] [INFO ] Deduced a trap composed of 40 places in 493 ms of which 2 ms to minimize.
[2021-05-17 19:27:27] [INFO ] Deduced a trap composed of 41 places in 659 ms of which 2 ms to minimize.
[2021-05-17 19:27:28] [INFO ] Deduced a trap composed of 26 places in 622 ms of which 1 ms to minimize.
[2021-05-17 19:27:29] [INFO ] Deduced a trap composed of 32 places in 624 ms of which 2 ms to minimize.
[2021-05-17 19:27:30] [INFO ] Deduced a trap composed of 39 places in 571 ms of which 1 ms to minimize.
[2021-05-17 19:27:30] [INFO ] Deduced a trap composed of 48 places in 366 ms of which 1 ms to minimize.
[2021-05-17 19:27:31] [INFO ] Deduced a trap composed of 50 places in 559 ms of which 1 ms to minimize.
[2021-05-17 19:27:31] [INFO ] Deduced a trap composed of 39 places in 563 ms of which 2 ms to minimize.
[2021-05-17 19:27:32] [INFO ] Deduced a trap composed of 46 places in 544 ms of which 2 ms to minimize.
[2021-05-17 19:27:33] [INFO ] Deduced a trap composed of 63 places in 499 ms of which 1 ms to minimize.
[2021-05-17 19:27:33] [INFO ] Deduced a trap composed of 55 places in 476 ms of which 1 ms to minimize.
[2021-05-17 19:27:34] [INFO ] Deduced a trap composed of 61 places in 535 ms of which 2 ms to minimize.
[2021-05-17 19:27:34] [INFO ] Deduced a trap composed of 70 places in 536 ms of which 1 ms to minimize.
[2021-05-17 19:27:35] [INFO ] Deduced a trap composed of 54 places in 501 ms of which 2 ms to minimize.
[2021-05-17 19:27:35] [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
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA ShieldRVt-PT-040B-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 1574 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1561 transition count 1561
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1561 transition count 1561
Applied a total of 26 rules in 213 ms. Remains 1561 /1574 variables (removed 13) and now considering 1561/1574 (removed 13) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2021-05-17 19:27:35] [INFO ] Computed 161 place invariants in 9 ms
[2021-05-17 19:27:36] [INFO ] Implicit Places using invariants in 753 ms returned []
// Phase 1: matrix 1561 rows 1561 cols
[2021-05-17 19:27:36] [INFO ] Computed 161 place invariants in 7 ms
[2021-05-17 19:27:38] [INFO ] Implicit Places using invariants and state equation in 2098 ms returned []
Implicit Place search using SMT with State Equation took 2859 ms to find 0 implicit places.
// Phase 1: matrix 1561 rows 1561 cols
[2021-05-17 19:27:38] [INFO ] Computed 161 place invariants in 6 ms
[2021-05-17 19:27:40] [INFO ] Dead Transitions using invariants and state equation in 1412 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1561/1574 places, 1561/1574 transitions.
Stuttering acceptance computed with spot in 281 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-01 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 s191 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 2 ms.
FORMULA ShieldRVt-PT-040B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-01 finished in 4863 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 1574 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 435 transitions
Trivial Post-agglo rules discarded 435 transitions
Performed 435 trivial Post agglomeration. Transition count delta: 435
Iterating post reduction 0 with 435 rules applied. Total rules applied 435 place count 1573 transition count 1138
Reduce places removed 435 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 436 rules applied. Total rules applied 871 place count 1138 transition count 1137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 872 place count 1137 transition count 1137
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 315 Pre rules applied. Total rules applied 872 place count 1137 transition count 822
Deduced a syphon composed of 315 places in 3 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 3 with 630 rules applied. Total rules applied 1502 place count 822 transition count 822
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1511 place count 813 transition count 813
Iterating global reduction 3 with 9 rules applied. Total rules applied 1520 place count 813 transition count 813
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1520 place count 813 transition count 806
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1534 place count 806 transition count 806
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 2246 place count 450 transition count 450
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2247 place count 450 transition count 449
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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2249 place count 449 transition count 448
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2451 place count 348 transition count 548
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 2485 place count 331 transition count 564
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2486 place count 331 transition count 564
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2487 place count 330 transition count 563
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2488 place count 329 transition count 563
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2489 place count 328 transition count 562
Applied a total of 2489 rules in 740 ms. Remains 328 /1574 variables (removed 1246) and now considering 562/1574 (removed 1012) transitions.
// Phase 1: matrix 562 rows 328 cols
[2021-05-17 19:27:41] [INFO ] Computed 160 place invariants in 3 ms
[2021-05-17 19:27:41] [INFO ] Implicit Places using invariants in 477 ms returned []
// Phase 1: matrix 562 rows 328 cols
[2021-05-17 19:27:41] [INFO ] Computed 160 place invariants in 26 ms
[2021-05-17 19:27:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-17 19:27:42] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1361 ms to find 0 implicit places.
[2021-05-17 19:27:42] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 562 rows 328 cols
[2021-05-17 19:27:42] [INFO ] Computed 160 place invariants in 2 ms
[2021-05-17 19:27:43] [INFO ] Dead Transitions using invariants and state equation in 572 ms returned []
Finished structural reductions, in 1 iterations. Remains : 328/1574 places, 562/1574 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040B-03 automaton TGBA [mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s128 0) (EQ s43 1)), p0:(OR (EQ s79 0) (EQ s325 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 34 reset in 1012 ms.
Product exploration explored 100000 steps with 26 reset in 914 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 17 reset in 758 ms.
Product exploration explored 100000 steps with 27 reset in 965 ms.
[2021-05-17 19:27:47] [INFO ] Flatten gal took : 91 ms
[2021-05-17 19:27:47] [INFO ] Flatten gal took : 81 ms
[2021-05-17 19:27:47] [INFO ] Time to serialize gal into /tmp/LTL17875582279329596967.gal : 40 ms
[2021-05-17 19:27:47] [INFO ] Time to serialize properties into /tmp/LTL16387441227947574626.ltl : 2 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/LTL17875582279329596967.gal, -t, CGAL, -LTL, /tmp/LTL16387441227947574626.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/LTL17875582279329596967.gal -t CGAL -LTL /tmp/LTL16387441227947574626.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(("((p500==0)||(p1991==1))")U("((p795==0)||(p294==1))"))))
Formula 0 simplified : !G("((p500==0)||(p1991==1))" U "((p795==0)||(p294==1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t366, t368, t370, t372, t374, t377, t378, t381, t383, t386, t387, t390, t391, t394, t395, t399, t401, t403, t405, t407, t409, t411, t413, t415, t417, t419, t421, t423, t425, t427, t429, t431, t433, t435, t437, t439, t441, t443, t447, t10.t352.t9, t364.t352.t12, t13.t9.t12, t16.t15.t355, t19.t15.t18, t20.t355.t18, t25.t22.t24, t28.t22.t27, t29.t24.t27, t34.t31.t33, t37.t31.t36, t38.t33.t36, t41.t40.t357, t44.t40.t43, t45.t357.t43, t51.t49.t53, t58.t55.t57, t375.t55.t60, t61.t57.t60, t66.t63.t64, t70.t63.t68, t69.t64.t68, t75.t72.t74, t78.t72.t77, t79.t74.t77, t84.t81.t83, t88.t81.t86, t87.t83.t86, t93.t90.t92, t96.t90.t95, t97.t92.t95, t102.t99.t101, t106.t99.t104, t105.t101.t104, t111.t108.t110, t114.t108.t113, t115.t110.t113, t120.t117.t119, t124.t117.t122, t123.t119.t122, t129.t126.t128, t132.t126.t131, t133.t128.t131, t397.t135.t138, t143.t135.t141, t142.t138.t141, t148.t145.t147, t151.t145.t150, t152.t147.t150, t157.t154.t155, t161.t154.t159, t160.t155.t159, t164.t163.t359, t167.t163.t165, t168.t359.t165, t173.t170.t172, t177.t170.t175, t176.t172.t175, t182.t179.t181, t185.t179.t183, t186.t181.t183, t192.t188.t191, t189.t188.t195, t193.t191.t195, t200.t197.t199, t203.t197.t201, t204.t199.t201, t209.t206.t208, t213.t206.t211, t212.t208.t211, t218.t215.t217, t221.t215.t219, t222.t217.t219, t227.t224.t226, t231.t224.t229, t230.t226.t229, t236.t233.t235, t239.t233.t237, t240.t235.t237, t245.t242.t244, t249.t242.t247, t248.t244.t247, t254.t251.t253, t257.t251.t255, t258.t253.t255, t263.t260.t262, t267.t260.t265, t266.t262.t265, t272.t269.t271, t273.t269.t360, t274.t271.t360, t279.t276.t278, t283.t276.t281, t282.t278.t281, t288.t285.t287, t362.t285.t290, t363.t287.t290, t295.t292.t294, t299.t292.t297, t298.t294.t297, t304.t301.t303, t307.t301.t306, t308.t303.t306, t313.t310.t312, t317.t310.t315, t316.t312.t315, t322.t319.t321, t325.t319.t324, t326.t321.t324, t331.t328.t330, t335.t328.t333, t334.t330.t333, t340.t337.t339, t343.t337.t342, t351.t445.t349, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/405/157/562
Computing Next relation with stutter on 4.90389e+30 deadlock states
Detected timeout of ITS tools.
[2021-05-17 19:28:02] [INFO ] Flatten gal took : 42 ms
[2021-05-17 19:28:02] [INFO ] Applying decomposition
[2021-05-17 19:28:02] [INFO ] Flatten gal took : 40 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/graph7882353417753357462.txt, -o, /tmp/graph7882353417753357462.bin, -w, /tmp/graph7882353417753357462.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/graph7882353417753357462.bin, -l, -1, -v, -w, /tmp/graph7882353417753357462.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 19:28:02] [INFO ] Decomposing Gal with order
[2021-05-17 19:28:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 19:28:03] [INFO ] Removed a total of 1091 redundant transitions.
[2021-05-17 19:28:03] [INFO ] Flatten gal took : 133 ms
[2021-05-17 19:28:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 560 labels/synchronizations in 45 ms.
[2021-05-17 19:28:03] [INFO ] Time to serialize gal into /tmp/LTL14686801293291153977.gal : 8 ms
[2021-05-17 19:28:03] [INFO ] Time to serialize properties into /tmp/LTL872071628420379396.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/LTL14686801293291153977.gal, -t, CGAL, -LTL, /tmp/LTL872071628420379396.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/LTL14686801293291153977.gal -t CGAL -LTL /tmp/LTL872071628420379396.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(("((i3.u37.p500==0)||(i10.u158.p1991==1))")U("((i5.u61.p795==0)||(i2.u21.p294==1))"))))
Formula 0 simplified : !G("((i3.u37.p500==0)||(i10.u158.p1991==1))" U "((i5.u61.p795==0)||(i2.u21.p294==1))")
Reverse transition relation is NOT exact ! Due to transitions t20_t355_t18, t28_t22_t26, t45_t357_t42, t61_t57_t60, t70_t62_t68, t87_t82_t86, t96_t90_t94, t123_t119_t122, t132_t126_t130, t152_t146_t150, t161_t153_t158, t193_t190_t194, t203_t197_t201, t230_t225_t228, t239_t233_t238, t266_t261_t265, t273_t268_t361, t308_t303_t306, t317_t309_t315, i0.t19_t15_t17, i0.t16_t15_t355, i0.t13_t8_t12, i0.t364_t352_t12, i0.t10_t352_t8, i0.t367, i0.t365, i1.t44_t39_t43, i1.t41_t39_t356, i1.t38_t33_t35, i1.t37_t30_t35, i1.t34_t30_t33, i1.t29_t24_t27, i1.t25_t22_t24, i1.t374, i1.t372, i1.t370, i2.t375_t54_t60, i2.t58_t54_t56, i2.t51_t48_t52, i2.t379, i2.u21.t3, i2.u23.t377, i3.t88_t81_t85, i3.t84_t81_t83, i3.t79_t74_t77, i3.t78_t71_t77, i3.t75_t71_t74, i3.t69_t65_t67, i3.t66_t62_t65, i3.t386, i3.t382, i3.t381, i4.t124_t116_t121, i4.t120_t116_t119, i4.t115_t109_t113, i4.t114_t108_t113, i4.t111_t108_t109, i4.t105_t101_t104, i4.t106_t98_t104, i4.t102_t98_t101, i4.t97_t91_t95, i4.t93_t89_t91, i4.t393, i4.t392, i4.t390, i4.t387, i5.t151_t144_t149, i5.t148_t144_t147, i5.t142_t139_t140, i5.t143_t135_t140, i5.t397_t135_t139, i5.t133_t127_t131, i5.t129_t125_t127, i5.t398, i5.t395, i5.u61.t2, i6.t177_t170_t174, i6.t168_t359_t165, i6.i0.t160_t155_t159, i6.i0.t167_t162_t165, i6.i0.i0.t157_t154_t155, i6.i0.i0.t401, i6.i0.i1.t164_t162_t358, i6.i0.i1.t403, i6.i1.t176_t172_t174, i6.i1.t185_t179_t184, i6.i1.t186_t180_t184, i6.i1.t189_t188_t194, i6.i1.i0.t182_t179_t180, i6.i1.i0.t407, i6.i1.i1.t173_t170_t172, i6.i1.i1.t404, i6.i1.i2.t192_t187_t191, i6.i1.i2.t409, i7.t221_t214_t220, i7.t212_t208_t211, i7.i0.t204_t199_t202, i7.i0.t213_t206_t211, i7.i0.i0.t200_t197_t199, i7.i0.i0.t411, i7.i0.i1.t209_t206_t207, i7.i0.i1.t413, i7.i1.t222_t217_t219, i7.i1.t231_t223_t228, i7.i1.i0.t218_t214_t216, i7.i1.i0.t414, i7.i1.i1.t227_t224_t226, i7.i1.i1.t416, i8.t257_t250_t256, i8.t248_t243_t246, i8.i0.t240_t234_t237, i8.i0.t249_t242_t246, i8.i0.i0.t236_t232_t234, i8.i0.i0.t418, i8.i0.i1.t245_t241_t243, i8.i0.i1.t421, i8.i1.t258_t253_t255, i8.i1.t267_t259_t264, i8.i1.i0.t254_t251_t252, i8.i1.i0.t422, i8.i1.i1.t263_t259_t262, i8.i1.i1.t425, i9.t362_t285_t290, i9.t282_t278_t281, i9.i0.t272_t269_t270, i9.i0.t279_t276_t277, i9.i0.i0.t283_t275_t281, i9.i0.i0.t429, i9.i0.i1.t274_t271_t360, i9.i0.i1.t426, i9.i1.t363_t286_t289, i9.i1.t299_t291_t296, i9.i1.i0.t288_t284_t286, i9.i1.i0.t431, i9.i1.i1.t307_t301_t305, i9.i1.i1.t304_t301_t302, i9.i1.i1.t298_t294_t296, i9.i1.i1.t295_t292_t294, i9.i1.i1.t435, i9.i1.i1.t433, i10.t351_t445_t348, i10.t343_t336_t341, i10.t340_t336_t338, i10.t334_t329_t332, i10.t335_t328_t332, i10.t331_t328_t329, i10.t326_t321_t323, i10.t325_t319_t323, i10.t322_t319_t321, i10.t316_t311_t314, i10.t313_t309_t311, i10.t447, i10.t443, i10.t441, i10.t438, i10.t437, i10.t1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/14/157/171
Computing Next relation with stutter on 4.90389e+30 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12391603736183711789
[2021-05-17 19:28:18] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12391603736183711789
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/ltsmin12391603736183711789]
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/ltsmin12391603736183711789] 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/ltsmin12391603736183711789] 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-03 finished in 38911 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 1574 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1562 transition count 1562
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1562 transition count 1562
Applied a total of 24 rules in 261 ms. Remains 1562 /1574 variables (removed 12) and now considering 1562/1574 (removed 12) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2021-05-17 19:28:19] [INFO ] Computed 161 place invariants in 5 ms
[2021-05-17 19:28:20] [INFO ] Implicit Places using invariants in 524 ms returned []
// Phase 1: matrix 1562 rows 1562 cols
[2021-05-17 19:28:20] [INFO ] Computed 161 place invariants in 5 ms
[2021-05-17 19:28:21] [INFO ] Implicit Places using invariants and state equation in 1716 ms returned []
Implicit Place search using SMT with State Equation took 2241 ms to find 0 implicit places.
// Phase 1: matrix 1562 rows 1562 cols
[2021-05-17 19:28:21] [INFO ] Computed 161 place invariants in 7 ms
[2021-05-17 19:28:23] [INFO ] Dead Transitions using invariants and state equation in 1452 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1562/1574 places, 1562/1574 transitions.
Stuttering acceptance computed with spot in 76 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:(OR (EQ s54 1) (AND (EQ s1191 0) (EQ s1211 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-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-06 finished in 4065 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1574 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1562 transition count 1562
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1562 transition count 1562
Applied a total of 24 rules in 240 ms. Remains 1562 /1574 variables (removed 12) and now considering 1562/1574 (removed 12) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2021-05-17 19:28:23] [INFO ] Computed 161 place invariants in 7 ms
[2021-05-17 19:28:24] [INFO ] Implicit Places using invariants in 644 ms returned []
// Phase 1: matrix 1562 rows 1562 cols
[2021-05-17 19:28:24] [INFO ] Computed 161 place invariants in 5 ms
[2021-05-17 19:28:26] [INFO ] Implicit Places using invariants and state equation in 2523 ms returned []
Implicit Place search using SMT with State Equation took 3169 ms to find 0 implicit places.
// Phase 1: matrix 1562 rows 1562 cols
[2021-05-17 19:28:26] [INFO ] Computed 161 place invariants in 18 ms
[2021-05-17 19:28:28] [INFO ] Dead Transitions using invariants and state equation in 1922 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1562/1574 places, 1562/1574 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1393 0) (EQ s1261 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]]
Product exploration explored 100000 steps with 50000 reset in 2044 ms.
Product exploration explored 100000 steps with 50000 reset in 1939 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 1762 ms.
Product exploration explored 100000 steps with 50000 reset in 1335 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1562 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Performed 437 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 1562 transition count 1562
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 437 place count 1562 transition count 1842
Deduced a syphon composed of 638 places in 5 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 638 place count 1562 transition count 1842
Performed 439 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1077 places in 3 ms
Iterating global reduction 1 with 439 rules applied. Total rules applied 1077 place count 1562 transition count 1843
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1078 place count 1562 transition count 1842
Renaming transitions due to excessive name length > 1024 char.
Discarding 279 places :
Symmetric choice reduction at 2 with 279 rule applications. Total rules 1357 place count 1283 transition count 1562
Deduced a syphon composed of 798 places in 3 ms
Iterating global reduction 2 with 279 rules applied. Total rules applied 1636 place count 1283 transition count 1562
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 799 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1637 place count 1283 transition count 1562
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1639 place count 1281 transition count 1560
Deduced a syphon composed of 797 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1641 place count 1281 transition count 1560
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -803
Deduced a syphon composed of 898 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1742 place count 1281 transition count 2363
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1843 place count 1180 transition count 2161
Deduced a syphon composed of 797 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1944 place count 1180 transition count 2161
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -155
Deduced a syphon composed of 815 places in 1 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 1962 place count 1180 transition count 2316
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1980 place count 1162 transition count 2280
Deduced a syphon composed of 797 places in 1 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 1998 place count 1162 transition count 2280
Deduced a syphon composed of 797 places in 0 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2007 place count 1162 transition count 2271
Deduced a syphon composed of 797 places in 0 ms
Applied a total of 2007 rules in 1425 ms. Remains 1162 /1562 variables (removed 400) and now considering 2271/1562 (removed -709) transitions.
[2021-05-17 19:28:38] [INFO ] Redundant transitions in 222 ms returned []
// Phase 1: matrix 2271 rows 1162 cols
[2021-05-17 19:28:38] [INFO ] Computed 161 place invariants in 14 ms
[2021-05-17 19:28:40] [INFO ] Dead Transitions using invariants and state equation in 1991 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1162/1562 places, 2271/1562 transitions.
Product exploration explored 100000 steps with 50000 reset in 7338 ms.
Product exploration explored 100000 steps with 50000 reset in 6520 ms.
[2021-05-17 19:28:54] [INFO ] Flatten gal took : 63 ms
[2021-05-17 19:28:54] [INFO ] Flatten gal took : 98 ms
[2021-05-17 19:28:54] [INFO ] Time to serialize gal into /tmp/LTL10112947873930255524.gal : 11 ms
[2021-05-17 19:28:54] [INFO ] Time to serialize properties into /tmp/LTL5122114118237643563.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10112947873930255524.gal, -t, CGAL, -LTL, /tmp/LTL5122114118237643563.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/LTL10112947873930255524.gal -t CGAL -LTL /tmp/LTL5122114118237643563.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p1782==0)||(p1613==1))"))))
Formula 0 simplified : !XF"((p1782==0)||(p1613==1))"
Detected timeout of ITS tools.
[2021-05-17 19:29:09] [INFO ] Flatten gal took : 45 ms
[2021-05-17 19:29:09] [INFO ] Applying decomposition
[2021-05-17 19:29:09] [INFO ] Flatten gal took : 45 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/graph11425019730152278044.txt, -o, /tmp/graph11425019730152278044.bin, -w, /tmp/graph11425019730152278044.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/graph11425019730152278044.bin, -l, -1, -v, -w, /tmp/graph11425019730152278044.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 19:29:09] [INFO ] Decomposing Gal with order
[2021-05-17 19:29:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 19:29:09] [INFO ] Removed a total of 399 redundant transitions.
[2021-05-17 19:29:09] [INFO ] Flatten gal took : 137 ms
[2021-05-17 19:29:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2021-05-17 19:29:09] [INFO ] Time to serialize gal into /tmp/LTL18321595389491682301.gal : 28 ms
[2021-05-17 19:29:09] [INFO ] Time to serialize properties into /tmp/LTL8015190794288423338.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/LTL18321595389491682301.gal, -t, CGAL, -LTL, /tmp/LTL8015190794288423338.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/LTL18321595389491682301.gal -t CGAL -LTL /tmp/LTL8015190794288423338.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((i34.i2.u548.p1782==0)||(i32.i0.u499.p1613==1))"))))
Formula 0 simplified : !XF"((i34.i2.u548.p1782==0)||(i32.i0.u499.p1613==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11072347421679294593
[2021-05-17 19:29:24] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11072347421679294593
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/ltsmin11072347421679294593]
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/ltsmin11072347421679294593] 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/ltsmin11072347421679294593] 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-09 finished in 62575 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1574 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 439 transitions
Trivial Post-agglo rules discarded 439 transitions
Performed 439 trivial Post agglomeration. Transition count delta: 439
Iterating post reduction 0 with 439 rules applied. Total rules applied 439 place count 1573 transition count 1134
Reduce places removed 439 places and 0 transitions.
Iterating post reduction 1 with 439 rules applied. Total rules applied 878 place count 1134 transition count 1134
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 315 Pre rules applied. Total rules applied 878 place count 1134 transition count 819
Deduced a syphon composed of 315 places in 2 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 2 with 630 rules applied. Total rules applied 1508 place count 819 transition count 819
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1515 place count 812 transition count 812
Iterating global reduction 2 with 7 rules applied. Total rules applied 1522 place count 812 transition count 812
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1522 place count 812 transition count 807
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1532 place count 807 transition count 807
Performed 362 Post agglomeration using F-continuation condition.Transition count delta: 362
Deduced a syphon composed of 362 places in 1 ms
Reduce places removed 362 places and 0 transitions.
Iterating global reduction 2 with 724 rules applied. Total rules applied 2256 place count 445 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2257 place count 445 transition count 444
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2259 place count 444 transition count 443
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2461 place count 343 transition count 541
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2497 place count 325 transition count 559
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2498 place count 324 transition count 558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2499 place count 323 transition count 558
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2500 place count 322 transition count 557
Applied a total of 2500 rules in 544 ms. Remains 322 /1574 variables (removed 1252) and now considering 557/1574 (removed 1017) transitions.
// Phase 1: matrix 557 rows 322 cols
[2021-05-17 19:29:26] [INFO ] Computed 160 place invariants in 3 ms
[2021-05-17 19:29:26] [INFO ] Implicit Places using invariants in 403 ms returned []
// Phase 1: matrix 557 rows 322 cols
[2021-05-17 19:29:26] [INFO ] Computed 160 place invariants in 2 ms
[2021-05-17 19:29:27] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
[2021-05-17 19:29:27] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 557 rows 322 cols
[2021-05-17 19:29:27] [INFO ] Computed 160 place invariants in 1 ms
[2021-05-17 19:29:28] [INFO ] Dead Transitions using invariants and state equation in 498 ms returned []
Finished structural reductions, in 1 iterations. Remains : 322/1574 places, 557/1574 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s14 0) (EQ s249 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 19 reset in 803 ms.
Product exploration explored 100000 steps with 28 reset in 684 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 29 reset in 620 ms.
Product exploration explored 100000 steps with 21 reset in 743 ms.
[2021-05-17 19:29:31] [INFO ] Flatten gal took : 28 ms
[2021-05-17 19:29:31] [INFO ] Flatten gal took : 27 ms
[2021-05-17 19:29:31] [INFO ] Time to serialize gal into /tmp/LTL5497673573569317750.gal : 5 ms
[2021-05-17 19:29:31] [INFO ] Time to serialize properties into /tmp/LTL18258335234591766172.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/LTL5497673573569317750.gal, -t, CGAL, -LTL, /tmp/LTL18258335234591766172.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/LTL5497673573569317750.gal -t CGAL -LTL /tmp/LTL18258335234591766172.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("((p119==0)||(p1552==1))"))))
Formula 0 simplified : !FG"((p119==0)||(p1552==1))"
Reverse transition relation is NOT exact ! Due to transitions t1.t12, t1.t13, t0.t268, t0.t269, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/553/4/557
Computing Next relation with stutter on 4.90389e+30 deadlock states
Detected timeout of ITS tools.
[2021-05-17 19:29:46] [INFO ] Flatten gal took : 24 ms
[2021-05-17 19:29:46] [INFO ] Applying decomposition
[2021-05-17 19:29:46] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14781861016528871479.txt, -o, /tmp/graph14781861016528871479.bin, -w, /tmp/graph14781861016528871479.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/graph14781861016528871479.bin, -l, -1, -v, -w, /tmp/graph14781861016528871479.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 19:29:46] [INFO ] Decomposing Gal with order
[2021-05-17 19:29:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 19:29:46] [INFO ] Removed a total of 1088 redundant transitions.
[2021-05-17 19:29:46] [INFO ] Flatten gal took : 53 ms
[2021-05-17 19:29:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 484 labels/synchronizations in 17 ms.
[2021-05-17 19:29:46] [INFO ] Time to serialize gal into /tmp/LTL13157547724692035961.gal : 5 ms
[2021-05-17 19:29:46] [INFO ] Time to serialize properties into /tmp/LTL7484514922605642261.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13157547724692035961.gal, -t, CGAL, -LTL, /tmp/LTL7484514922605642261.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/LTL13157547724692035961.gal -t CGAL -LTL /tmp/LTL7484514922605642261.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("((i0.u6.p119==0)||(i9.u123.p1552==1))"))))
Formula 0 simplified : !FG"((i0.u6.p119==0)||(i9.u123.p1552==1))"
Reverse transition relation is NOT exact ! Due to transitions i0.u6.t1.t12, i0.u6.t1.t13, i9.u123.t0.t268, i9.u123.t0.t269, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/162/4/166
Computing Next relation with stutter on 4.90389e+30 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
280 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.84918,109736,1,0,198575,110,2288,553948,131,209,115158
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-040B-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldRVt-PT-040B-10 finished in 23904 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F((p1&&F((G(p3)||p2)))))||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 1574 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1563 transition count 1563
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1563 transition count 1563
Applied a total of 22 rules in 168 ms. Remains 1563 /1574 variables (removed 11) and now considering 1563/1574 (removed 11) transitions.
// Phase 1: matrix 1563 rows 1563 cols
[2021-05-17 19:29:50] [INFO ] Computed 161 place invariants in 7 ms
[2021-05-17 19:29:50] [INFO ] Implicit Places using invariants in 724 ms returned []
// Phase 1: matrix 1563 rows 1563 cols
[2021-05-17 19:29:50] [INFO ] Computed 161 place invariants in 6 ms
[2021-05-17 19:29:52] [INFO ] Implicit Places using invariants and state equation in 1906 ms returned []
Implicit Place search using SMT with State Equation took 2636 ms to find 0 implicit places.
// Phase 1: matrix 1563 rows 1563 cols
[2021-05-17 19:29:52] [INFO ] Computed 161 place invariants in 6 ms
[2021-05-17 19:29:54] [INFO ] Dead Transitions using invariants and state equation in 1787 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1563/1574 places, 1563/1574 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
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={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s265 0) (EQ s1298 1)), p1:(OR (EQ s265 0) (EQ s1298 1)), p2:(OR (EQ s265 0) (EQ s1298 1)), p3:(OR (EQ s644 0) (EQ s1185 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1924 ms.
Product exploration explored 100000 steps with 50000 reset in 1725 ms.
Knowledge obtained : [p0, p1, p2, p3]
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 50000 reset in 1833 ms.
Product exploration explored 100000 steps with 50000 reset in 1433 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Support contains 4 out of 1563 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1563/1563 places, 1563/1563 transitions.
Performed 437 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 1563 transition count 1563
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 199 Pre rules applied. Total rules applied 437 place count 1563 transition count 1837
Deduced a syphon composed of 636 places in 4 ms
Iterating global reduction 1 with 199 rules applied. Total rules applied 636 place count 1563 transition count 1837
Performed 438 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1074 places in 3 ms
Iterating global reduction 1 with 438 rules applied. Total rules applied 1074 place count 1563 transition count 1837
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1075 place count 1563 transition count 1836
Renaming transitions due to excessive name length > 1024 char.
Discarding 279 places :
Symmetric choice reduction at 2 with 279 rule applications. Total rules 1354 place count 1284 transition count 1557
Deduced a syphon composed of 795 places in 3 ms
Iterating global reduction 2 with 279 rules applied. Total rules applied 1633 place count 1284 transition count 1557
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 796 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1634 place count 1284 transition count 1557
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1636 place count 1282 transition count 1555
Deduced a syphon composed of 794 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1638 place count 1282 transition count 1555
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -802
Deduced a syphon composed of 895 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1739 place count 1282 transition count 2357
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1840 place count 1181 transition count 2155
Deduced a syphon composed of 794 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1941 place count 1181 transition count 2155
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -159
Deduced a syphon composed of 814 places in 1 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 1961 place count 1181 transition count 2314
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 1981 place count 1161 transition count 2274
Deduced a syphon composed of 794 places in 1 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 2001 place count 1161 transition count 2274
Deduced a syphon composed of 794 places in 0 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2010 place count 1161 transition count 2265
Deduced a syphon composed of 794 places in 1 ms
Applied a total of 2010 rules in 717 ms. Remains 1161 /1563 variables (removed 402) and now considering 2265/1563 (removed -702) transitions.
[2021-05-17 19:30:03] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 2265 rows 1161 cols
[2021-05-17 19:30:03] [INFO ] Computed 161 place invariants in 10 ms
[2021-05-17 19:30:05] [INFO ] Dead Transitions using invariants and state equation in 2506 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1161/1563 places, 2265/1563 transitions.
Product exploration explored 100000 steps with 50000 reset in 1757 ms.
Product exploration explored 100000 steps with 50000 reset in 1390 ms.
[2021-05-17 19:30:08] [INFO ] Flatten gal took : 42 ms
[2021-05-17 19:30:09] [INFO ] Flatten gal took : 45 ms
[2021-05-17 19:30:09] [INFO ] Time to serialize gal into /tmp/LTL17890753214434157028.gal : 17 ms
[2021-05-17 19:30:09] [INFO ] Time to serialize properties into /tmp/LTL1755695500314992700.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/LTL17890753214434157028.gal, -t, CGAL, -LTL, /tmp/LTL1755695500314992700.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/LTL17890753214434157028.gal -t CGAL -LTL /tmp/LTL1755695500314992700.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((p328==0)||(p1659==1))")||(X(F(("((p328==0)||(p1659==1))")&&(F(("((p328==0)||(p1659==1))")||(G("((p816==0)||(p1514==1))"))))))))))
Formula 0 simplified : !X("((p328==0)||(p1659==1))" | XF("((p328==0)||(p1659==1))" & F("((p328==0)||(p1659==1))" | G"((p816==0)||(p1514==1))")))
Detected timeout of ITS tools.
[2021-05-17 19:30:24] [INFO ] Flatten gal took : 40 ms
[2021-05-17 19:30:24] [INFO ] Applying decomposition
[2021-05-17 19:30:24] [INFO ] Flatten gal took : 40 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/graph13319574041968221786.txt, -o, /tmp/graph13319574041968221786.bin, -w, /tmp/graph13319574041968221786.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/graph13319574041968221786.bin, -l, -1, -v, -w, /tmp/graph13319574041968221786.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 19:30:24] [INFO ] Decomposing Gal with order
[2021-05-17 19:30:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 19:30:24] [INFO ] Removed a total of 397 redundant transitions.
[2021-05-17 19:30:24] [INFO ] Flatten gal took : 96 ms
[2021-05-17 19:30:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2021-05-17 19:30:24] [INFO ] Time to serialize gal into /tmp/LTL17583780946638587484.gal : 16 ms
[2021-05-17 19:30:24] [INFO ] Time to serialize properties into /tmp/LTL4139503071102515705.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/LTL17583780946638587484.gal, -t, CGAL, -LTL, /tmp/LTL4139503071102515705.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/LTL17583780946638587484.gal -t CGAL -LTL /tmp/LTL4139503071102515705.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("((i9.i4.u107.p328==0)||(i31.i4.u507.p1659==1))")||(X(F(("((i9.i4.u107.p328==0)||(i31.i4.u507.p1659==1))")&&(F(("((i9.i4.u107.p328==0)||(i31.i4.u507.p1659==1))")||(G("((i3.i5.u252.p816==0)||(i29.i0.u465.p1514==1))"))))))))))
Formula 0 simplified : !X("((i9.i4.u107.p328==0)||(i31.i4.u507.p1659==1))" | XF("((i9.i4.u107.p328==0)||(i31.i4.u507.p1659==1))" & F("((i9.i4.u107.p328==0)||(i31.i4.u507.p1659==1))" | G"((i3.i5.u252.p816==0)||(i29.i0.u465.p1514==1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3105514239941364315
[2021-05-17 19:30:39] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3105514239941364315
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/ltsmin3105514239941364315]
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/ltsmin3105514239941364315] 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/ltsmin3105514239941364315] 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-11 finished in 50769 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(((F(p1) U p2) U (p0&&(F(p1) U p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1574 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1562 transition count 1562
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1562 transition count 1562
Applied a total of 24 rules in 162 ms. Remains 1562 /1574 variables (removed 12) and now considering 1562/1574 (removed 12) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2021-05-17 19:30:40] [INFO ] Computed 161 place invariants in 4 ms
[2021-05-17 19:30:41] [INFO ] Implicit Places using invariants in 725 ms returned []
// Phase 1: matrix 1562 rows 1562 cols
[2021-05-17 19:30:41] [INFO ] Computed 161 place invariants in 11 ms
[2021-05-17 19:30:43] [INFO ] Implicit Places using invariants and state equation in 2047 ms returned []
Implicit Place search using SMT with State Equation took 2788 ms to find 0 implicit places.
// 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 ] Dead Transitions using invariants and state equation in 1346 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1562/1574 places, 1562/1574 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (OR (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
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={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s324 1), p2:(EQ s1224 1), p1:(AND (OR (EQ s868 0) (EQ s1514 1)) (EQ s1224 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 919 reset in 387 ms.
Product exploration explored 100000 steps with 926 reset in 470 ms.
Knowledge obtained : [(NOT p0), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (OR (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 932 reset in 302 ms.
Product exploration explored 100000 steps with 939 reset in 320 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (OR (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
Support contains 4 out of 1562 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Performed 436 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 436 rules applied. Total rules applied 436 place count 1562 transition count 1562
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 202 Pre rules applied. Total rules applied 436 place count 1562 transition count 1842
Deduced a syphon composed of 638 places in 5 ms
Iterating global reduction 1 with 202 rules applied. Total rules applied 638 place count 1562 transition count 1842
Performed 438 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1076 places in 4 ms
Iterating global reduction 1 with 438 rules applied. Total rules applied 1076 place count 1562 transition count 1843
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1077 place count 1562 transition count 1842
Renaming transitions due to excessive name length > 1024 char.
Discarding 279 places :
Symmetric choice reduction at 2 with 279 rule applications. Total rules 1356 place count 1283 transition count 1562
Deduced a syphon composed of 797 places in 3 ms
Iterating global reduction 2 with 279 rules applied. Total rules applied 1635 place count 1283 transition count 1562
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 798 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1636 place count 1283 transition count 1562
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1638 place count 1281 transition count 1560
Deduced a syphon composed of 796 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1640 place count 1281 transition count 1560
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -814
Deduced a syphon composed of 897 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1741 place count 1281 transition count 2374
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1842 place count 1180 transition count 2172
Deduced a syphon composed of 796 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1943 place count 1180 transition count 2172
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -144
Deduced a syphon composed of 814 places in 1 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 1961 place count 1180 transition count 2316
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1979 place count 1162 transition count 2280
Deduced a syphon composed of 796 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 1997 place count 1162 transition count 2280
Deduced a syphon composed of 796 places in 0 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2006 place count 1162 transition count 2271
Deduced a syphon composed of 796 places in 1 ms
Applied a total of 2006 rules in 1009 ms. Remains 1162 /1562 variables (removed 400) and now considering 2271/1562 (removed -709) transitions.
[2021-05-17 19:30:48] [INFO ] Redundant transitions in 77 ms returned []
// Phase 1: matrix 2271 rows 1162 cols
[2021-05-17 19:30:48] [INFO ] Computed 161 place invariants in 11 ms
[2021-05-17 19:30:50] [INFO ] Dead Transitions using invariants and state equation in 1738 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1162/1562 places, 2271/1562 transitions.
Stuttering criterion allowed to conclude after 15 steps with 2 reset in 2 ms.
FORMULA ShieldRVt-PT-040B-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-12 finished in 9556 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1574 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 439 transitions
Trivial Post-agglo rules discarded 439 transitions
Performed 439 trivial Post agglomeration. Transition count delta: 439
Iterating post reduction 0 with 439 rules applied. Total rules applied 439 place count 1573 transition count 1134
Reduce places removed 439 places and 0 transitions.
Iterating post reduction 1 with 439 rules applied. Total rules applied 878 place count 1134 transition count 1134
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 314 Pre rules applied. Total rules applied 878 place count 1134 transition count 820
Deduced a syphon composed of 314 places in 1 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 2 with 628 rules applied. Total rules applied 1506 place count 820 transition count 820
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1514 place count 812 transition count 812
Iterating global reduction 2 with 8 rules applied. Total rules applied 1522 place count 812 transition count 812
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1522 place count 812 transition count 806
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1534 place count 806 transition count 806
Performed 361 Post agglomeration using F-continuation condition.Transition count delta: 361
Deduced a syphon composed of 361 places in 0 ms
Reduce places removed 361 places and 0 transitions.
Iterating global reduction 2 with 722 rules applied. Total rules applied 2256 place count 445 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2257 place count 445 transition count 444
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2259 place count 444 transition count 443
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2461 place count 343 transition count 542
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 3 with 36 rules applied. Total rules applied 2497 place count 325 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2498 place count 324 transition count 559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2499 place count 323 transition count 559
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2500 place count 322 transition count 558
Applied a total of 2500 rules in 226 ms. Remains 322 /1574 variables (removed 1252) and now considering 558/1574 (removed 1016) transitions.
// Phase 1: matrix 558 rows 322 cols
[2021-05-17 19:30:50] [INFO ] Computed 160 place invariants in 1 ms
[2021-05-17 19:30:50] [INFO ] Implicit Places using invariants in 433 ms returned []
// Phase 1: matrix 558 rows 322 cols
[2021-05-17 19:30:50] [INFO ] Computed 160 place invariants in 2 ms
[2021-05-17 19:30:51] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
[2021-05-17 19:30:51] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 558 rows 322 cols
[2021-05-17 19:30:51] [INFO ] Computed 160 place invariants in 11 ms
[2021-05-17 19:30:52] [INFO ] Dead Transitions using invariants and state equation in 473 ms returned []
Finished structural reductions, in 1 iterations. Remains : 322/1574 places, 558/1574 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s39 0) (NEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][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 1873 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11712810952717291386
[2021-05-17 19:30:52] [INFO ] Too many transitions (1574) to apply POR reductions. Disabling POR matrices.
[2021-05-17 19:30:52] [INFO ] Applying decomposition
[2021-05-17 19:30:52] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11712810952717291386
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/ltsmin11712810952717291386]
[2021-05-17 19:30:52] [INFO ] Flatten gal took : 39 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/graph5325169231765917714.txt, -o, /tmp/graph5325169231765917714.bin, -w, /tmp/graph5325169231765917714.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/graph5325169231765917714.bin, -l, -1, -v, -w, /tmp/graph5325169231765917714.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 19:30:52] [INFO ] Decomposing Gal with order
[2021-05-17 19:30:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 19:30:52] [INFO ] Removed a total of 381 redundant transitions.
[2021-05-17 19:30:52] [INFO ] Flatten gal took : 110 ms
[2021-05-17 19:30:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2021-05-17 19:30:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality12522553636400874030.gal : 17 ms
[2021-05-17 19:30:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality10937027330292213328.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/LTLCardinality12522553636400874030.gal, -t, CGAL, -LTL, /tmp/LTLCardinality10937027330292213328.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/LTLCardinality12522553636400874030.gal -t CGAL -LTL /tmp/LTLCardinality10937027330292213328.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((G(("((i6.i2.u162.p500==0)||(i39.i4.u613.p1991==1))")U("((i20.i2.u254.p795==0)||(i12.i1.u99.p294==1))"))))
Formula 0 simplified : !G("((i6.i2.u162.p500==0)||(i39.i4.u613.p1991==1))" U "((i20.i2.u254.p795==0)||(i12.i1.u99.p294==1))")
Compilation finished in 22914 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11712810952717291386]
Link finished in 75 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, -p, --pins-guards, --when, --ltl, [](((LTLAPp0==true) U (LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin11712810952717291386]
WARNING : LTSmin timed out (>400 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](((LTLAPp0==true) U (LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin11712810952717291386]
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(<>((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin11712810952717291386]
LTSmin run took 892 ms.
FORMULA ShieldRVt-PT-040B-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
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((X(<>(((LTLAPp4==true)&&<>(([]((LTLAPp6==true))||(LTLAPp5==true))))))||(LTLAPp3==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin11712810952717291386]
LTSmin run took 591 ms.
FORMULA ShieldRVt-PT-040B-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 3200 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](((LTLAPp0==true) U (LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin11712810952717291386]
Detected timeout of ITS tools.
[2021-05-17 19:52:58] [INFO ] Applying decomposition
[2021-05-17 19:52:58] [INFO ] Flatten gal took : 94 ms
[2021-05-17 19:52:58] [INFO ] Decomposing Gal with order
[2021-05-17 19:52:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 19:52:59] [INFO ] Removed a total of 114 redundant transitions.
[2021-05-17 19:52:59] [INFO ] Flatten gal took : 129 ms
[2021-05-17 19:52:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2021-05-17 19:52:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality12650876381731285433.gal : 30 ms
[2021-05-17 19:52:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality13004399057310156706.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/LTLCardinality12650876381731285433.gal, -t, CGAL, -LTL, /tmp/LTLCardinality13004399057310156706.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/LTLCardinality12650876381731285433.gal -t CGAL -LTL /tmp/LTLCardinality13004399057310156706.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u108.p500==0)||(i1.i0.u319.p1991==1))")U("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u150.p795==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u79.p294==1))"))))
Formula 0 simplified : !G("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u108.p500==0)||(i1.i0.u319.p1991==1))" U "((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u150.p795==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u79.p294==1))")
Reverse transition relation is NOT exact ! Due to transitions i0.t1844, i0.i0.t1919, i0.i0.i0.t1846, i0.i0.i0.i0.t1917, i0.i0.i0.i0.i0.t1848, i0.i0.i0.i0.i0.i0.t1915, i0.i0.i0.i0.i0.i0.i0.t1850, i0.i0.i0.i0.i0.i0.i0.i0.t1913, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1911, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1854, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1909, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1856, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1907, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1858, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1905, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1860, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1903, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1862, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1901, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1864, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1899, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1866, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1897, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1868, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1895, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1870, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1893, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1872, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1891, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1874, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1889, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1876, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1887, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1878, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1885, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1880, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t1883, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u40.t1840, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u47.t1797, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u47.t1804, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u46.t1809, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u46.t1816, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u44.t1830, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u44.t1832, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u44.t1837, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u44.t1839, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u45.t1821, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u45.t1827, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u54.t1751, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u54.t1758, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u53.t1763, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u53.t1765, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u53.t1770, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u53.t1772, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u51.t1784, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u51.t1791, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u52.t1775, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u52.t1781, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u61.t1705, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u61.t1712, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u60.t1717, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u60.t1724, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u58.t1738, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u58.t1745, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u59.t1729, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u59.t1735, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u68.t1659, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u68.t1666, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u67.t1671, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u67.t1678, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u65.t1692, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u65.t1699, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u66.t1683, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u66.t1689, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u75.t1613, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u75.t1620, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u74.t1625, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u74.t1627, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u74.t1632, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u74.t1634, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u72.t1646, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u72.t1653, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u73.t1637, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u73.t1643, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u82.t1567, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u82.t1573, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u82.t1575, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u81.t1579, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u81.t1586, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u79.t1600, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u79.t1608, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u80.t1591, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u80.t1597, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u89.t1521, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u89.t1528, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u88.t1533, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u88.t1540, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u86.t1554, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u86.t1561, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u87.t1545, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u87.t1551, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u96.t1475, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u96.t1482, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u95.t1487, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u95.t1494, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u93.t1508, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u93.t1515, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u94.t1499, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u94.t1504, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u94.t1505, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u94.t1506, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u103.t1429, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u103.t1436, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u102.t1441, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u102.t1448, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u100.t1462, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u100.t1469, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u101.t1453, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u101.t1459, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u110.t1383, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u110.t1390, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u109.t1395, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u109.t1402, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u107.t1416, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u107.t1423, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u108.t1407, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u108.t1413, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u117.t1337, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u117.t1344, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u116.t1349, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u116.t1356, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u114.t1370, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u114.t1377, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u115.t1361, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u115.t1367, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u124.t1291, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u124.t1298, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u123.t1303, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u123.t1310, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u121.t1324, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u121.t1331, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u122.t1315, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u122.t1321, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u131.t1245, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u131.t1252, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u130.t1257, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u130.t1264, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u128.t1278, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u128.t1285, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u129.t1269, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u129.t1275, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u138.t1199, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u138.t1206, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u137.t1211, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u137.t1218, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u135.t1232, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u135.t1239, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u136.t1223, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u136.t1229, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u145.t1153, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u145.t1160, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u144.t1165, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u144.t1172, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u142.t1186, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u142.t1193, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u143.t1177, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u143.t1183, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u152.t1107, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u152.t1114, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u151.t1119, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u151.t1126, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u149.t1140, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u149.t1147, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u150.t1131, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u150.t1138, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u159.t1061, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u159.t1068, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u158.t1073, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u158.t1080, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u156.t1094, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u156.t1101, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u157.t1085, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u157.t1091, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u166.t1015, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u166.t1022, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u165.t1027, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u165.t1034, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u163.t1048, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u163.t1055, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u164.t1039, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u164.t1045, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u173.t969, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u173.t976, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u172.t981, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u172.t983, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u172.t988, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u172.t990, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u170.t1002, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u170.t1009, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u171.t993, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u171.t999, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u180.t923, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u180.t930, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u179.t935, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u179.t942, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u177.t956, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u177.t963, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u178.t947, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u178.t953, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u187.t877, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u187.t884, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u186.t889, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u186.t896, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u184.t910, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u184.t917, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u185.t901, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u185.t907, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u194.t831, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u194.t837, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u194.t839, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u193.t843, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u193.t850, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u191.t864, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u191.t871, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u192.t855, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u192.t861, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u201.t785, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u201.t792, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u200.t797, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u200.t804, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u198.t818, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u198.t825, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u199.t809, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u199.t815, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u208.t739, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u208.t746, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u207.t751, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u207.t758, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u205.t772, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u205.t779, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u206.t763, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u206.t769, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u215.t693, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u215.t700, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u214.t705, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u214.t712, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u212.t726, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u212.t733, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u213.t717, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u213.t723, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u222.t647, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u222.t654, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u221.t659, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u221.t666, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u219.t680, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u219.t687, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u220.t671, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u220.t677, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u229.t601, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u229.t608, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u228.t613, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u228.t620, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u226.t634, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u226.t641, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u227.t625, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u227.t631, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u236.t555, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u236.t562, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u235.t567, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u235.t574, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u233.t588, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u233.t595, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u234.t579, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u234.t585, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u243.t509, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u243.t516, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u242.t521, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u242.t528, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u240.t542, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u240.t549, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u241.t533, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u241.t539, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u250.t463, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u250.t470, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u249.t475, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u249.t482, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u247.t496, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u247.t503, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u248.t487, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u248.t493, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u257.t417, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u257.t424, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u257.t426, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u256.t429, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u256.t436, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u254.t450, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u254.t457, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u255.t441, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u255.t447, i0.i0.i0.i0.i0.i0.i0.i0.i1.u264.t371, i0.i0.i0.i0.i0.i0.i0.i0.i1.u264.t378, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u263.t383, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u263.t390, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u261.t404, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u261.t411, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u262.t395, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u262.t401, i0.i0.i0.i0.i0.i0.i0.i1.u271.t326, i0.i0.i0.i0.i0.i0.i0.i1.u271.t333, i0.i0.i0.i0.i0.i0.i0.i1.i0.u270.t337, i0.i0.i0.i0.i0.i0.i0.i1.i0.u270.t344, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u268.t358, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u268.t365, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u269.t349, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u269.t355, i0.i0.i0.i0.i0.i0.i1.u278.t279, i0.i0.i0.i0.i0.i0.i1.u278.t286, i0.i0.i0.i0.i0.i0.i1.i0.u277.t291, i0.i0.i0.i0.i0.i0.i1.i0.u277.t298, i0.i0.i0.i0.i0.i0.i1.i0.i0.u275.t312, i0.i0.i0.i0.i0.i0.i1.i0.i0.u275.t319, i0.i0.i0.i0.i0.i0.i1.i0.i0.u276.t303, i0.i0.i0.i0.i0.i0.i1.i0.i0.u276.t309, i0.i0.i0.i0.i0.i1.u285.t233, i0.i0.i0.i0.i0.i1.u285.t240, i0.i0.i0.i0.i0.i1.i0.u284.t245, i0.i0.i0.i0.i0.i1.i0.u284.t252, i0.i0.i0.i0.i0.i1.i0.i0.u282.t266, i0.i0.i0.i0.i0.i1.i0.i0.u282.t273, i0.i0.i0.i0.i0.i1.i0.i0.u283.t257, i0.i0.i0.i0.i0.i1.i0.i0.u283.t263, i0.i0.i0.i0.i1.u292.t187, i0.i0.i0.i0.i1.u292.t194, i0.i0.i0.i0.i1.i0.u291.t199, i0.i0.i0.i0.i1.i0.u291.t206, i0.i0.i0.i0.i1.i0.i0.u289.t220, i0.i0.i0.i0.i1.i0.i0.u289.t227, i0.i0.i0.i0.i1.i0.i0.u290.t212, i0.i0.i0.i0.i1.i0.i0.u290.t218, i0.i0.i0.i1.u299.t141, i0.i0.i0.i1.u299.t148, i0.i0.i0.i1.i0.u298.t153, i0.i0.i0.i1.i0.u298.t160, i0.i0.i0.i1.i0.i0.u296.t174, i0.i0.i0.i1.i0.i0.u296.t181, i0.i0.i0.i1.i0.i0.u297.t165, i0.i0.i0.i1.i0.i0.u297.t171, i0.i0.i1.u306.t95, i0.i0.i1.u306.t102, i0.i0.i1.i0.u305.t107, i0.i0.i1.i0.u305.t114, i0.i0.i1.i0.i0.u303.t128, i0.i0.i1.i0.i0.u303.t135, i0.i0.i1.i0.i0.u304.t119, i0.i0.i1.i0.i0.u304.t125, i0.i1.u313.t49, i0.i1.u313.t56, i0.i1.i0.u312.t61, i0.i1.i0.u312.t68, i0.i1.i0.i0.u310.t82, i0.i1.i0.i0.u310.t89, i0.i1.i0.i0.u311.t73, i0.i1.i0.i0.u311.t79, i1.u320.t3, i1.u320.t10, i1.i0.u319.t15, i1.i0.u319.t22, i1.i0.i0.u317.t38, i1.i0.i0.u317.t40, i1.i0.i0.u317.t43, i1.i0.i0.u317.t45, i1.i0.i0.u318.t27, i1.i0.i0.u318.t33, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1201/373/1574
Computing Next relation with stutter on 4.90389e+30 deadlock states
LTSmin run took 1683554 ms.
FORMULA ShieldRVt-PT-040B-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621281961638

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-162106564800316"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;