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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1008K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 139K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K 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.4K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 15K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 13:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 13:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 19:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 19:16 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 614K 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-050B-00
FORMULA_NAME ShieldRVt-PT-050B-01
FORMULA_NAME ShieldRVt-PT-050B-02
FORMULA_NAME ShieldRVt-PT-050B-03
FORMULA_NAME ShieldRVt-PT-050B-04
FORMULA_NAME ShieldRVt-PT-050B-05
FORMULA_NAME ShieldRVt-PT-050B-06
FORMULA_NAME ShieldRVt-PT-050B-07
FORMULA_NAME ShieldRVt-PT-050B-08
FORMULA_NAME ShieldRVt-PT-050B-09
FORMULA_NAME ShieldRVt-PT-050B-10
FORMULA_NAME ShieldRVt-PT-050B-11
FORMULA_NAME ShieldRVt-PT-050B-12
FORMULA_NAME ShieldRVt-PT-050B-13
FORMULA_NAME ShieldRVt-PT-050B-14
FORMULA_NAME ShieldRVt-PT-050B-15

=== Now, execution of the tool begins

BK_START 1621288123854

Running Version 0
[2021-05-17 21:48:46] [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 21:48:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 21:48:47] [INFO ] Load time of PNML (sax parser for PT used): 374 ms
[2021-05-17 21:48:47] [INFO ] Transformed 2503 places.
[2021-05-17 21:48:47] [INFO ] Transformed 2503 transitions.
[2021-05-17 21:48:47] [INFO ] Found NUPN structural information;
[2021-05-17 21:48:47] [INFO ] Parsed PT model containing 2503 places and 2503 transitions in 558 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 21:48:47] [INFO ] Initial state test concluded for 2 properties.
FORMULA ShieldRVt-PT-050B-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 2503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Discarding 533 places :
Symmetric choice reduction at 0 with 533 rule applications. Total rules 533 place count 1970 transition count 1970
Iterating global reduction 0 with 533 rules applied. Total rules applied 1066 place count 1970 transition count 1970
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1067 place count 1969 transition count 1969
Iterating global reduction 0 with 1 rules applied. Total rules applied 1068 place count 1969 transition count 1969
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1069 place count 1968 transition count 1968
Iterating global reduction 0 with 1 rules applied. Total rules applied 1070 place count 1968 transition count 1968
Applied a total of 1070 rules in 1397 ms. Remains 1968 /2503 variables (removed 535) and now considering 1968/2503 (removed 535) transitions.
// Phase 1: matrix 1968 rows 1968 cols
[2021-05-17 21:48:49] [INFO ] Computed 201 place invariants in 48 ms
[2021-05-17 21:48:50] [INFO ] Implicit Places using invariants in 1065 ms returned []
// Phase 1: matrix 1968 rows 1968 cols
[2021-05-17 21:48:50] [INFO ] Computed 201 place invariants in 27 ms
[2021-05-17 21:48:52] [INFO ] Implicit Places using invariants and state equation in 2374 ms returned []
Implicit Place search using SMT with State Equation took 3479 ms to find 0 implicit places.
// Phase 1: matrix 1968 rows 1968 cols
[2021-05-17 21:48:52] [INFO ] Computed 201 place invariants in 11 ms
[2021-05-17 21:48:55] [INFO ] Dead Transitions using invariants and state equation in 2339 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1968/2503 places, 1968/2503 transitions.
[2021-05-17 21:48:55] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 21:48:55] [INFO ] Flatten gal took : 343 ms
FORMULA ShieldRVt-PT-050B-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 21:48:55] [INFO ] Flatten gal took : 127 ms
[2021-05-17 21:48:56] [INFO ] Input system was already deterministic with 1968 transitions.
Incomplete random walk after 100000 steps, including 4 resets, run finished after 828 ms. (steps per millisecond=120 ) properties (out of 17) seen :9
Running SMT prover for 8 properties.
// Phase 1: matrix 1968 rows 1968 cols
[2021-05-17 21:48:57] [INFO ] Computed 201 place invariants in 9 ms
[2021-05-17 21:48:57] [INFO ] [Real]Absence check using 201 positive place invariants in 182 ms returned sat
[2021-05-17 21:48:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:48:59] [INFO ] [Real]Absence check using state equation in 1414 ms returned sat
[2021-05-17 21:48:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 21:48:59] [INFO ] [Nat]Absence check using 201 positive place invariants in 162 ms returned unsat
[2021-05-17 21:49:00] [INFO ] [Real]Absence check using 201 positive place invariants in 130 ms returned sat
[2021-05-17 21:49:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:49:01] [INFO ] [Real]Absence check using state equation in 1382 ms returned sat
[2021-05-17 21:49:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 21:49:02] [INFO ] [Nat]Absence check using 201 positive place invariants in 117 ms returned sat
[2021-05-17 21:49:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 21:49:03] [INFO ] [Nat]Absence check using state equation in 1523 ms returned sat
[2021-05-17 21:49:05] [INFO ] Deduced a trap composed of 26 places in 1093 ms of which 7 ms to minimize.
[2021-05-17 21:49:06] [INFO ] Deduced a trap composed of 54 places in 913 ms of which 3 ms to minimize.
[2021-05-17 21:49:07] [INFO ] Deduced a trap composed of 22 places in 800 ms of which 1 ms to minimize.
[2021-05-17 21:49:07] [INFO ] Deduced a trap composed of 40 places in 794 ms of which 3 ms to minimize.
[2021-05-17 21:49:08] [INFO ] Deduced a trap composed of 24 places in 629 ms of which 3 ms to minimize.
[2021-05-17 21:49:09] [INFO ] Deduced a trap composed of 36 places in 857 ms of which 1 ms to minimize.
[2021-05-17 21:49:10] [INFO ] Deduced a trap composed of 30 places in 770 ms of which 2 ms to minimize.
[2021-05-17 21:49:11] [INFO ] Deduced a trap composed of 24 places in 597 ms of which 2 ms to minimize.
[2021-05-17 21:49:11] [INFO ] Deduced a trap composed of 22 places in 495 ms of which 1 ms to minimize.
[2021-05-17 21:49:12] [INFO ] Deduced a trap composed of 25 places in 597 ms of which 1 ms to minimize.
[2021-05-17 21:49:13] [INFO ] Deduced a trap composed of 36 places in 566 ms of which 1 ms to minimize.
[2021-05-17 21:49:14] [INFO ] Deduced a trap composed of 29 places in 734 ms of which 1 ms to minimize.
[2021-05-17 21:49:14] [INFO ] Deduced a trap composed of 34 places in 638 ms of which 1 ms to minimize.
[2021-05-17 21:49:15] [INFO ] Deduced a trap composed of 43 places in 545 ms of which 1 ms to minimize.
[2021-05-17 21:49:16] [INFO ] Deduced a trap composed of 39 places in 520 ms of which 2 ms to minimize.
[2021-05-17 21:49:16] [INFO ] Deduced a trap composed of 69 places in 504 ms of which 1 ms to minimize.
[2021-05-17 21:49:17] [INFO ] Deduced a trap composed of 57 places in 730 ms of which 2 ms to minimize.
[2021-05-17 21:49:18] [INFO ] Deduced a trap composed of 58 places in 705 ms of which 2 ms to minimize.
[2021-05-17 21:49:18] [INFO ] Deduced a trap composed of 49 places in 495 ms of which 1 ms to minimize.
[2021-05-17 21:49:19] [INFO ] Deduced a trap composed of 57 places in 473 ms of which 2 ms to minimize.
[2021-05-17 21:49:20] [INFO ] Deduced a trap composed of 42 places in 550 ms of which 1 ms to minimize.
[2021-05-17 21:49:20] [INFO ] Deduced a trap composed of 79 places in 648 ms of which 2 ms to minimize.
[2021-05-17 21:49:21] [INFO ] Deduced a trap composed of 45 places in 444 ms of which 1 ms to minimize.
[2021-05-17 21:49:22] [INFO ] Deduced a trap composed of 47 places in 598 ms of which 3 ms to minimize.
[2021-05-17 21:49:22] [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 21:49:22] [INFO ] [Real]Absence check using 201 positive place invariants in 192 ms returned sat
[2021-05-17 21:49:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:49:24] [INFO ] [Real]Absence check using state equation in 1507 ms returned sat
[2021-05-17 21:49:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 21:49:24] [INFO ] [Nat]Absence check using 201 positive place invariants in 102 ms returned sat
[2021-05-17 21:49:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 21:49:26] [INFO ] [Nat]Absence check using state equation in 1283 ms returned sat
[2021-05-17 21:49:27] [INFO ] Deduced a trap composed of 16 places in 942 ms of which 1 ms to minimize.
[2021-05-17 21:49:28] [INFO ] Deduced a trap composed of 22 places in 818 ms of which 3 ms to minimize.
[2021-05-17 21:49:28] [INFO ] Deduced a trap composed of 25 places in 774 ms of which 1 ms to minimize.
[2021-05-17 21:49:29] [INFO ] Deduced a trap composed of 29 places in 752 ms of which 2 ms to minimize.
[2021-05-17 21:49:30] [INFO ] Deduced a trap composed of 35 places in 776 ms of which 1 ms to minimize.
[2021-05-17 21:49:31] [INFO ] Deduced a trap composed of 30 places in 745 ms of which 1 ms to minimize.
[2021-05-17 21:49:32] [INFO ] Deduced a trap composed of 42 places in 720 ms of which 1 ms to minimize.
[2021-05-17 21:49:33] [INFO ] Deduced a trap composed of 33 places in 703 ms of which 1 ms to minimize.
[2021-05-17 21:49:33] [INFO ] Deduced a trap composed of 52 places in 598 ms of which 1 ms to minimize.
[2021-05-17 21:49:34] [INFO ] Deduced a trap composed of 45 places in 806 ms of which 7 ms to minimize.
[2021-05-17 21:49:35] [INFO ] Deduced a trap composed of 37 places in 835 ms of which 2 ms to minimize.
[2021-05-17 21:49:36] [INFO ] Deduced a trap composed of 34 places in 750 ms of which 1 ms to minimize.
[2021-05-17 21:49:37] [INFO ] Deduced a trap composed of 40 places in 487 ms of which 2 ms to minimize.
[2021-05-17 21:49:38] [INFO ] Deduced a trap composed of 46 places in 672 ms of which 1 ms to minimize.
[2021-05-17 21:49:38] [INFO ] Deduced a trap composed of 38 places in 534 ms of which 1 ms to minimize.
[2021-05-17 21:49:39] [INFO ] Deduced a trap composed of 50 places in 694 ms of which 1 ms to minimize.
[2021-05-17 21:49:40] [INFO ] Deduced a trap composed of 52 places in 577 ms of which 2 ms to minimize.
[2021-05-17 21:49:40] [INFO ] Deduced a trap composed of 45 places in 570 ms of which 1 ms to minimize.
[2021-05-17 21:49:41] [INFO ] Deduced a trap composed of 51 places in 548 ms of which 2 ms to minimize.
[2021-05-17 21:49:42] [INFO ] Deduced a trap composed of 63 places in 480 ms of which 2 ms to minimize.
[2021-05-17 21:49:42] [INFO ] Deduced a trap composed of 51 places in 694 ms of which 2 ms to minimize.
[2021-05-17 21:49:43] [INFO ] Deduced a trap composed of 44 places in 627 ms of which 2 ms to minimize.
[2021-05-17 21:49:44] [INFO ] Deduced a trap composed of 52 places in 687 ms of which 1 ms to minimize.
[2021-05-17 21:49:45] [INFO ] Deduced a trap composed of 65 places in 684 ms of which 3 ms to minimize.
[2021-05-17 21:49:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-17 21:49:45] [INFO ] [Real]Absence check using 201 positive place invariants in 135 ms returned sat
[2021-05-17 21:49:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:49:46] [INFO ] [Real]Absence check using state equation in 1366 ms returned sat
[2021-05-17 21:49:47] [INFO ] Deduced a trap composed of 34 places in 779 ms of which 2 ms to minimize.
[2021-05-17 21:49:48] [INFO ] Deduced a trap composed of 17 places in 884 ms of which 1 ms to minimize.
[2021-05-17 21:49:50] [INFO ] Deduced a trap composed of 51 places in 988 ms of which 2 ms to minimize.
[2021-05-17 21:49:50] [INFO ] Deduced a trap composed of 40 places in 772 ms of which 1 ms to minimize.
[2021-05-17 21:49:51] [INFO ] Deduced a trap composed of 24 places in 737 ms of which 1 ms to minimize.
[2021-05-17 21:49:52] [INFO ] Deduced a trap composed of 25 places in 819 ms of which 2 ms to minimize.
[2021-05-17 21:49:53] [INFO ] Deduced a trap composed of 22 places in 702 ms of which 1 ms to minimize.
[2021-05-17 21:49:54] [INFO ] Deduced a trap composed of 27 places in 689 ms of which 3 ms to minimize.
[2021-05-17 21:49:55] [INFO ] Deduced a trap composed of 25 places in 1011 ms of which 3 ms to minimize.
[2021-05-17 21:49:56] [INFO ] Deduced a trap composed of 36 places in 729 ms of which 2 ms to minimize.
[2021-05-17 21:49:57] [INFO ] Deduced a trap composed of 41 places in 762 ms of which 1 ms to minimize.
[2021-05-17 21:49:57] [INFO ] Deduced a trap composed of 29 places in 803 ms of which 2 ms to minimize.
[2021-05-17 21:49:58] [INFO ] Deduced a trap composed of 24 places in 818 ms of which 1 ms to minimize.
[2021-05-17 21:49:59] [INFO ] Deduced a trap composed of 35 places in 775 ms of which 1 ms to minimize.
[2021-05-17 21:50:00] [INFO ] Deduced a trap composed of 48 places in 856 ms of which 2 ms to minimize.
[2021-05-17 21:50:01] [INFO ] Deduced a trap composed of 38 places in 835 ms of which 4 ms to minimize.
[2021-05-17 21:50:02] [INFO ] Deduced a trap composed of 34 places in 773 ms of which 2 ms to minimize.
[2021-05-17 21:50:03] [INFO ] Deduced a trap composed of 69 places in 648 ms of which 5 ms to minimize.
[2021-05-17 21:50:04] [INFO ] Deduced a trap composed of 40 places in 593 ms of which 4 ms to minimize.
[2021-05-17 21:50:05] [INFO ] Deduced a trap composed of 39 places in 614 ms of which 14 ms to minimize.
[2021-05-17 21:50:06] [INFO ] Deduced a trap composed of 14 places in 1698 ms of which 3 ms to minimize.
[2021-05-17 21:50:06] [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 21:50:07] [INFO ] [Real]Absence check using 201 positive place invariants in 122 ms returned sat
[2021-05-17 21:50:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:50:08] [INFO ] [Real]Absence check using state equation in 1309 ms returned sat
[2021-05-17 21:50:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 21:50:09] [INFO ] [Nat]Absence check using 201 positive place invariants in 122 ms returned sat
[2021-05-17 21:50:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 21:50:10] [INFO ] [Nat]Absence check using state equation in 1194 ms returned sat
[2021-05-17 21:50:11] [INFO ] Deduced a trap composed of 28 places in 845 ms of which 1 ms to minimize.
[2021-05-17 21:50:12] [INFO ] Deduced a trap composed of 25 places in 826 ms of which 1 ms to minimize.
[2021-05-17 21:50:13] [INFO ] Deduced a trap composed of 30 places in 820 ms of which 1 ms to minimize.
[2021-05-17 21:50:13] [INFO ] Deduced a trap composed of 22 places in 694 ms of which 1 ms to minimize.
[2021-05-17 21:50:14] [INFO ] Deduced a trap composed of 26 places in 696 ms of which 1 ms to minimize.
[2021-05-17 21:50:15] [INFO ] Deduced a trap composed of 35 places in 803 ms of which 1 ms to minimize.
[2021-05-17 21:50:16] [INFO ] Deduced a trap composed of 26 places in 737 ms of which 2 ms to minimize.
[2021-05-17 21:50:17] [INFO ] Deduced a trap composed of 32 places in 809 ms of which 2 ms to minimize.
[2021-05-17 21:50:18] [INFO ] Deduced a trap composed of 35 places in 774 ms of which 1 ms to minimize.
[2021-05-17 21:50:18] [INFO ] Deduced a trap composed of 28 places in 770 ms of which 2 ms to minimize.
[2021-05-17 21:50:19] [INFO ] Deduced a trap composed of 33 places in 808 ms of which 1 ms to minimize.
[2021-05-17 21:50:20] [INFO ] Deduced a trap composed of 33 places in 576 ms of which 2 ms to minimize.
[2021-05-17 21:50:21] [INFO ] Deduced a trap composed of 64 places in 708 ms of which 2 ms to minimize.
[2021-05-17 21:50:22] [INFO ] Deduced a trap composed of 41 places in 748 ms of which 2 ms to minimize.
[2021-05-17 21:50:22] [INFO ] Deduced a trap composed of 49 places in 721 ms of which 1 ms to minimize.
[2021-05-17 21:50:23] [INFO ] Deduced a trap composed of 38 places in 555 ms of which 2 ms to minimize.
[2021-05-17 21:50:24] [INFO ] Deduced a trap composed of 39 places in 667 ms of which 2 ms to minimize.
[2021-05-17 21:50:25] [INFO ] Deduced a trap composed of 48 places in 722 ms of which 2 ms to minimize.
[2021-05-17 21:50:25] [INFO ] Deduced a trap composed of 42 places in 724 ms of which 1 ms to minimize.
[2021-05-17 21:50:26] [INFO ] Deduced a trap composed of 42 places in 537 ms of which 1 ms to minimize.
[2021-05-17 21:50:27] [INFO ] Deduced a trap composed of 44 places in 596 ms of which 2 ms to minimize.
[2021-05-17 21:50:27] [INFO ] Deduced a trap composed of 46 places in 460 ms of which 1 ms to minimize.
[2021-05-17 21:50:28] [INFO ] Deduced a trap composed of 43 places in 504 ms of which 2 ms to minimize.
[2021-05-17 21:50:29] [INFO ] Deduced a trap composed of 34 places in 640 ms of which 2 ms to minimize.
[2021-05-17 21:50:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2021-05-17 21:50:29] [INFO ] [Real]Absence check using 201 positive place invariants in 186 ms returned sat
[2021-05-17 21:50:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:50:31] [INFO ] [Real]Absence check using state equation in 1201 ms returned sat
[2021-05-17 21:50:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 21:50:31] [INFO ] [Nat]Absence check using 201 positive place invariants in 137 ms returned sat
[2021-05-17 21:50:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 21:50:32] [INFO ] [Nat]Absence check using state equation in 1197 ms returned sat
[2021-05-17 21:50:33] [INFO ] Deduced a trap composed of 18 places in 866 ms of which 1 ms to minimize.
[2021-05-17 21:50:34] [INFO ] Deduced a trap composed of 33 places in 919 ms of which 2 ms to minimize.
[2021-05-17 21:50:35] [INFO ] Deduced a trap composed of 24 places in 934 ms of which 2 ms to minimize.
[2021-05-17 21:50:36] [INFO ] Deduced a trap composed of 16 places in 892 ms of which 2 ms to minimize.
[2021-05-17 21:50:37] [INFO ] Deduced a trap composed of 35 places in 846 ms of which 1 ms to minimize.
[2021-05-17 21:50:38] [INFO ] Deduced a trap composed of 23 places in 833 ms of which 2 ms to minimize.
[2021-05-17 21:50:39] [INFO ] Deduced a trap composed of 32 places in 776 ms of which 1 ms to minimize.
[2021-05-17 21:50:40] [INFO ] Deduced a trap composed of 28 places in 804 ms of which 2 ms to minimize.
[2021-05-17 21:50:41] [INFO ] Deduced a trap composed of 28 places in 773 ms of which 1 ms to minimize.
[2021-05-17 21:50:42] [INFO ] Deduced a trap composed of 28 places in 754 ms of which 1 ms to minimize.
[2021-05-17 21:50:43] [INFO ] Deduced a trap composed of 17 places in 887 ms of which 1 ms to minimize.
[2021-05-17 21:50:43] [INFO ] Deduced a trap composed of 22 places in 715 ms of which 2 ms to minimize.
[2021-05-17 21:50:44] [INFO ] Deduced a trap composed of 29 places in 899 ms of which 1 ms to minimize.
[2021-05-17 21:50:45] [INFO ] Deduced a trap composed of 26 places in 630 ms of which 2 ms to minimize.
[2021-05-17 21:50:46] [INFO ] Deduced a trap composed of 33 places in 718 ms of which 1 ms to minimize.
[2021-05-17 21:50:47] [INFO ] Deduced a trap composed of 30 places in 634 ms of which 1 ms to minimize.
[2021-05-17 21:50:47] [INFO ] Deduced a trap composed of 42 places in 705 ms of which 1 ms to minimize.
[2021-05-17 21:50:48] [INFO ] Deduced a trap composed of 37 places in 748 ms of which 1 ms to minimize.
[2021-05-17 21:50:49] [INFO ] Deduced a trap composed of 36 places in 776 ms of which 2 ms to minimize.
[2021-05-17 21:50:50] [INFO ] Deduced a trap composed of 46 places in 672 ms of which 1 ms to minimize.
[2021-05-17 21:50:51] [INFO ] Deduced a trap composed of 28 places in 630 ms of which 1 ms to minimize.
[2021-05-17 21:50:51] [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 21:50:51] [INFO ] [Real]Absence check using 201 positive place invariants in 137 ms returned sat
[2021-05-17 21:50:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:50:52] [INFO ] [Real]Absence check using state equation in 1364 ms returned sat
[2021-05-17 21:50:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 21:50:53] [INFO ] [Nat]Absence check using 201 positive place invariants in 192 ms returned sat
[2021-05-17 21:50:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 21:50:55] [INFO ] [Nat]Absence check using state equation in 1444 ms returned sat
[2021-05-17 21:50:56] [INFO ] Deduced a trap composed of 40 places in 899 ms of which 2 ms to minimize.
[2021-05-17 21:50:57] [INFO ] Deduced a trap composed of 24 places in 937 ms of which 1 ms to minimize.
[2021-05-17 21:50:58] [INFO ] Deduced a trap composed of 28 places in 913 ms of which 1 ms to minimize.
[2021-05-17 21:50:59] [INFO ] Deduced a trap composed of 22 places in 896 ms of which 2 ms to minimize.
[2021-05-17 21:51:00] [INFO ] Deduced a trap composed of 29 places in 835 ms of which 2 ms to minimize.
[2021-05-17 21:51:01] [INFO ] Deduced a trap composed of 24 places in 806 ms of which 1 ms to minimize.
[2021-05-17 21:51:02] [INFO ] Deduced a trap composed of 44 places in 789 ms of which 1 ms to minimize.
[2021-05-17 21:51:03] [INFO ] Deduced a trap composed of 34 places in 1006 ms of which 3 ms to minimize.
[2021-05-17 21:51:03] [INFO ] Deduced a trap composed of 28 places in 756 ms of which 1 ms to minimize.
[2021-05-17 21:51:04] [INFO ] Deduced a trap composed of 29 places in 780 ms of which 2 ms to minimize.
[2021-05-17 21:51:05] [INFO ] Deduced a trap composed of 27 places in 636 ms of which 1 ms to minimize.
[2021-05-17 21:51:06] [INFO ] Deduced a trap composed of 30 places in 735 ms of which 2 ms to minimize.
[2021-05-17 21:51:07] [INFO ] Deduced a trap composed of 38 places in 707 ms of which 2 ms to minimize.
[2021-05-17 21:51:07] [INFO ] Deduced a trap composed of 48 places in 611 ms of which 1 ms to minimize.
[2021-05-17 21:51:08] [INFO ] Deduced a trap composed of 26 places in 599 ms of which 2 ms to minimize.
[2021-05-17 21:51:09] [INFO ] Deduced a trap composed of 22 places in 690 ms of which 2 ms to minimize.
[2021-05-17 21:51:10] [INFO ] Deduced a trap composed of 46 places in 674 ms of which 2 ms to minimize.
[2021-05-17 21:51:11] [INFO ] Deduced a trap composed of 37 places in 632 ms of which 1 ms to minimize.
[2021-05-17 21:51:11] [INFO ] Deduced a trap composed of 41 places in 601 ms of which 1 ms to minimize.
[2021-05-17 21:51:12] [INFO ] Deduced a trap composed of 44 places in 593 ms of which 2 ms to minimize.
[2021-05-17 21:51:13] [INFO ] Deduced a trap composed of 45 places in 566 ms of which 2 ms to minimize.
[2021-05-17 21:51: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 6
[2021-05-17 21:51:13] [INFO ] [Real]Absence check using 201 positive place invariants in 139 ms returned sat
[2021-05-17 21:51:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:51:15] [INFO ] [Real]Absence check using state equation in 1381 ms returned sat
[2021-05-17 21:51:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 21:51:15] [INFO ] [Nat]Absence check using 201 positive place invariants in 74 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
[2021-05-17 21:51:15] [INFO ] Initial state test concluded for 1 properties.
FORMULA ShieldRVt-PT-050B-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1968 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 556 transitions
Trivial Post-agglo rules discarded 556 transitions
Performed 556 trivial Post agglomeration. Transition count delta: 556
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 1967 transition count 1411
Reduce places removed 556 places and 0 transitions.
Iterating post reduction 1 with 556 rules applied. Total rules applied 1112 place count 1411 transition count 1411
Performed 390 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 390 Pre rules applied. Total rules applied 1112 place count 1411 transition count 1021
Deduced a syphon composed of 390 places in 4 ms
Reduce places removed 390 places and 0 transitions.
Iterating global reduction 2 with 780 rules applied. Total rules applied 1892 place count 1021 transition count 1021
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1903 place count 1010 transition count 1010
Iterating global reduction 2 with 11 rules applied. Total rules applied 1914 place count 1010 transition count 1010
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1914 place count 1010 transition count 1004
Deduced a syphon composed of 6 places in 10 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1926 place count 1004 transition count 1004
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 449
Deduced a syphon composed of 449 places in 2 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 2 with 898 rules applied. Total rules applied 2824 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2825 place count 555 transition count 554
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2827 place count 554 transition count 553
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3029 place count 453 transition count 653
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3125 place count 405 transition count 700
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3126 place count 404 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3127 place count 403 transition count 699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3128 place count 402 transition count 698
Applied a total of 3128 rules in 935 ms. Remains 402 /1968 variables (removed 1566) and now considering 698/1968 (removed 1270) transitions.
// Phase 1: matrix 698 rows 402 cols
[2021-05-17 21:51:16] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-17 21:51:17] [INFO ] Implicit Places using invariants in 418 ms returned []
// Phase 1: matrix 698 rows 402 cols
[2021-05-17 21:51:17] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-17 21:51:17] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 1166 ms to find 0 implicit places.
[2021-05-17 21:51:17] [INFO ] Redundant transitions in 55 ms returned []
// Phase 1: matrix 698 rows 402 cols
[2021-05-17 21:51:17] [INFO ] Computed 200 place invariants in 4 ms
[2021-05-17 21:51:18] [INFO ] Dead Transitions using invariants and state equation in 596 ms returned []
Finished structural reductions, in 1 iterations. Remains : 402/1968 places, 698/1968 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-01 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 s73 0) (EQ s337 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 24 reset in 1192 ms.
Product exploration explored 100000 steps with 27 reset in 1026 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 21 reset in 637 ms.
Product exploration explored 100000 steps with 37 reset in 1086 ms.
[2021-05-17 21:51:22] [INFO ] Flatten gal took : 56 ms
[2021-05-17 21:51:22] [INFO ] Flatten gal took : 57 ms
[2021-05-17 21:51:22] [INFO ] Time to serialize gal into /tmp/LTL14631787681151751383.gal : 30 ms
[2021-05-17 21:51:22] [INFO ] Time to serialize properties into /tmp/LTL12046852027030162783.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/LTL14631787681151751383.gal, -t, CGAL, -LTL, /tmp/LTL12046852027030162783.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/LTL14631787681151751383.gal -t CGAL -LTL /tmp/LTL12046852027030162783.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("((p487==0)||(p2101==1))"))))
Formula 0 simplified : !FG"((p487==0)||(p2101==1))"
Reverse transition relation is NOT exact ! Due to transitions t0.t363, t0.t364, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/696/2/698
Computing Next relation with stutter on 3.26648e+38 deadlock states
Detected timeout of ITS tools.
[2021-05-17 21:51:38] [INFO ] Flatten gal took : 50 ms
[2021-05-17 21:51:38] [INFO ] Applying decomposition
[2021-05-17 21:51:38] [INFO ] Flatten gal took : 47 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/graph15128452381878376735.txt, -o, /tmp/graph15128452381878376735.bin, -w, /tmp/graph15128452381878376735.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/graph15128452381878376735.bin, -l, -1, -v, -w, /tmp/graph15128452381878376735.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 21:51:38] [INFO ] Decomposing Gal with order
[2021-05-17 21:51:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 21:51:38] [INFO ] Removed a total of 1376 redundant transitions.
[2021-05-17 21:51:38] [INFO ] Flatten gal took : 151 ms
[2021-05-17 21:51:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 654 labels/synchronizations in 55 ms.
[2021-05-17 21:51:38] [INFO ] Time to serialize gal into /tmp/LTL13331964330480786798.gal : 11 ms
[2021-05-17 21:51:38] [INFO ] Time to serialize properties into /tmp/LTL10719137607185266816.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/LTL13331964330480786798.gal, -t, CGAL, -LTL, /tmp/LTL10719137607185266816.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/LTL13331964330480786798.gal -t CGAL -LTL /tmp/LTL10719137607185266816.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("((i2.i0.i1.u36.p487==0)||(i10.u168.p2101==1))"))))
Formula 0 simplified : !FG"((i2.i0.i1.u36.p487==0)||(i10.u168.p2101==1))"
Reverse transition relation is NOT exact ! Due to transitions i10.u168.t0.t363, i10.u168.t0.t364, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/202/2/204
Computing Next relation with stutter on 3.26648e+38 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13091870487322021020
[2021-05-17 21:51:53] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13091870487322021020
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/ltsmin13091870487322021020]
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/ltsmin13091870487322021020] 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/ltsmin13091870487322021020] 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-050B-01 finished in 39210 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1968 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 554 transitions
Trivial Post-agglo rules discarded 554 transitions
Performed 554 trivial Post agglomeration. Transition count delta: 554
Iterating post reduction 0 with 554 rules applied. Total rules applied 554 place count 1967 transition count 1413
Reduce places removed 554 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 555 rules applied. Total rules applied 1109 place count 1413 transition count 1412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1110 place count 1412 transition count 1412
Performed 390 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 390 Pre rules applied. Total rules applied 1110 place count 1412 transition count 1022
Deduced a syphon composed of 390 places in 3 ms
Reduce places removed 390 places and 0 transitions.
Iterating global reduction 3 with 780 rules applied. Total rules applied 1890 place count 1022 transition count 1022
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1901 place count 1011 transition count 1011
Iterating global reduction 3 with 11 rules applied. Total rules applied 1912 place count 1011 transition count 1011
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1912 place count 1011 transition count 1004
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1926 place count 1004 transition count 1004
Performed 447 Post agglomeration using F-continuation condition.Transition count delta: 447
Deduced a syphon composed of 447 places in 0 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 3 with 894 rules applied. Total rules applied 2820 place count 557 transition count 557
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2821 place count 557 transition count 556
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2823 place count 556 transition count 555
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3025 place count 455 transition count 655
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 3121 place count 407 transition count 703
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3122 place count 406 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3123 place count 405 transition count 702
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3124 place count 404 transition count 701
Applied a total of 3124 rules in 577 ms. Remains 404 /1968 variables (removed 1564) and now considering 701/1968 (removed 1267) transitions.
// Phase 1: matrix 701 rows 404 cols
[2021-05-17 21:51:55] [INFO ] Computed 200 place invariants in 4 ms
[2021-05-17 21:51:55] [INFO ] Implicit Places using invariants in 365 ms returned []
// Phase 1: matrix 701 rows 404 cols
[2021-05-17 21:51:55] [INFO ] Computed 200 place invariants in 1 ms
[2021-05-17 21:51:56] [INFO ] State equation strengthened by 171 read => feed constraints.
[2021-05-17 21:51:58] [INFO ] Implicit Places using invariants and state equation in 2382 ms returned []
Implicit Place search using SMT with State Equation took 2750 ms to find 0 implicit places.
[2021-05-17 21:51:58] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 701 rows 404 cols
[2021-05-17 21:51:58] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-17 21:51:58] [INFO ] Dead Transitions using invariants and state equation in 429 ms returned []
Finished structural reductions, in 1 iterations. Remains : 404/1968 places, 701/1968 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-050B-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(NEQ s131 1), p1:(EQ s345 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050B-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-02 finished in 3919 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(F(p0))||(F((p2&&G(p3)))&&p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1968 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1952 transition count 1952
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1952 transition count 1952
Applied a total of 32 rules in 214 ms. Remains 1952 /1968 variables (removed 16) and now considering 1952/1968 (removed 16) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2021-05-17 21:51:59] [INFO ] Computed 201 place invariants in 10 ms
[2021-05-17 21:51:59] [INFO ] Implicit Places using invariants in 774 ms returned []
// Phase 1: matrix 1952 rows 1952 cols
[2021-05-17 21:51:59] [INFO ] Computed 201 place invariants in 9 ms
[2021-05-17 21:52:02] [INFO ] Implicit Places using invariants and state equation in 2592 ms returned []
Implicit Place search using SMT with State Equation took 3368 ms to find 0 implicit places.
// Phase 1: matrix 1952 rows 1952 cols
[2021-05-17 21:52:02] [INFO ] Computed 201 place invariants in 6 ms
[2021-05-17 21:52:04] [INFO ] Dead Transitions using invariants and state equation in 2297 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1952/1968 places, 1952/1968 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : ShieldRVt-PT-050B-04 automaton TGBA [mat=[[{ cond=(AND p1 p2 p3), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), acceptance={} source=0 dest: 3}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p1 p2 p3 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p2) (NOT p0)) (AND p1 (NOT p3) (NOT p0))), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p3 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NEQ s1313 0) (NEQ s435 1)), p2:(OR (NEQ s522 0) (NEQ s1838 1)), p3:(NEQ s1277 1), p0:(OR (EQ s1838 0) (EQ s522 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 2104 ms.
Product exploration explored 100000 steps with 50000 reset in 1777 ms.
Knowledge obtained : [(NOT p1), p2, p3, p0]
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))]
Product exploration explored 100000 steps with 50000 reset in 2183 ms.
Product exploration explored 100000 steps with 50000 reset in 1758 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))]
Support contains 5 out of 1952 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Performed 546 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 1952 transition count 1952
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 250 Pre rules applied. Total rules applied 546 place count 1952 transition count 2299
Deduced a syphon composed of 796 places in 8 ms
Iterating global reduction 1 with 250 rules applied. Total rules applied 796 place count 1952 transition count 2299
Performed 547 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1343 places in 3 ms
Iterating global reduction 1 with 547 rules applied. Total rules applied 1343 place count 1952 transition count 2300
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1344 place count 1952 transition count 2299
Renaming transitions due to excessive name length > 1024 char.
Discarding 348 places :
Symmetric choice reduction at 2 with 348 rule applications. Total rules 1692 place count 1604 transition count 1951
Deduced a syphon composed of 995 places in 3 ms
Iterating global reduction 2 with 348 rules applied. Total rules applied 2040 place count 1604 transition count 1951
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 996 places in 4 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2041 place count 1604 transition count 1951
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2043 place count 1602 transition count 1949
Deduced a syphon composed of 994 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2045 place count 1602 transition count 1949
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -801
Deduced a syphon composed of 1095 places in 4 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2146 place count 1602 transition count 2750
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2247 place count 1501 transition count 2548
Deduced a syphon composed of 994 places in 4 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2348 place count 1501 transition count 2548
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: -395
Deduced a syphon composed of 1043 places in 1 ms
Iterating global reduction 2 with 49 rules applied. Total rules applied 2397 place count 1501 transition count 2943
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 2446 place count 1452 transition count 2845
Deduced a syphon composed of 994 places in 1 ms
Iterating global reduction 2 with 49 rules applied. Total rules applied 2495 place count 1452 transition count 2845
Deduced a syphon composed of 994 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 2504 place count 1452 transition count 2836
Deduced a syphon composed of 994 places in 1 ms
Applied a total of 2504 rules in 2032 ms. Remains 1452 /1952 variables (removed 500) and now considering 2836/1952 (removed -884) transitions.
[2021-05-17 21:52:15] [INFO ] Redundant transitions in 132 ms returned []
// Phase 1: matrix 2836 rows 1452 cols
[2021-05-17 21:52:15] [INFO ] Computed 201 place invariants in 17 ms
[2021-05-17 21:52:17] [INFO ] Dead Transitions using invariants and state equation in 1895 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1452/1952 places, 2836/1952 transitions.
Product exploration explored 100000 steps with 50000 reset in 9357 ms.
Product exploration explored 100000 steps with 50000 reset in 8594 ms.
[2021-05-17 21:52:35] [INFO ] Flatten gal took : 64 ms
[2021-05-17 21:52:35] [INFO ] Flatten gal took : 60 ms
[2021-05-17 21:52:35] [INFO ] Time to serialize gal into /tmp/LTL6922562581520513182.gal : 13 ms
[2021-05-17 21:52:35] [INFO ] Time to serialize properties into /tmp/LTL7876710344527636954.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/LTL6922562581520513182.gal, -t, CGAL, -LTL, /tmp/LTL7876710344527636954.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/LTL6922562581520513182.gal -t CGAL -LTL /tmp/LTL7876710344527636954.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((X(F("((p2352==0)||(p657==1))")))||(("((p1676!=0)&&(p545!=1))")&&(F(("((p657!=0)||(p2352!=1))")&&(G("(p1630!=1)"))))))))
Formula 0 simplified : !F(XF"((p2352==0)||(p657==1))" | ("((p1676!=0)&&(p545!=1))" & F("((p657!=0)||(p2352!=1))" & G"(p1630!=1)")))
Detected timeout of ITS tools.
[2021-05-17 21:52:50] [INFO ] Flatten gal took : 68 ms
[2021-05-17 21:52:50] [INFO ] Applying decomposition
[2021-05-17 21:52:51] [INFO ] Flatten gal took : 74 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/graph8651591327922552422.txt, -o, /tmp/graph8651591327922552422.bin, -w, /tmp/graph8651591327922552422.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/graph8651591327922552422.bin, -l, -1, -v, -w, /tmp/graph8651591327922552422.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 21:52:51] [INFO ] Decomposing Gal with order
[2021-05-17 21:52:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 21:52:51] [INFO ] Removed a total of 497 redundant transitions.
[2021-05-17 21:52:51] [INFO ] Flatten gal took : 166 ms
[2021-05-17 21:52:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2021-05-17 21:52:51] [INFO ] Time to serialize gal into /tmp/LTL793128430277327174.gal : 28 ms
[2021-05-17 21:52:51] [INFO ] Time to serialize properties into /tmp/LTL451669658740607.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/LTL793128430277327174.gal, -t, CGAL, -LTL, /tmp/LTL451669658740607.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/LTL793128430277327174.gal -t CGAL -LTL /tmp/LTL451669658740607.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((X(F("((i46.i4.u724.p2352==0)||(i19.i2.u212.p657==1))")))||(("((i2.i1.u521.p1676!=0)&&(i9.i6.u175.p545!=1))")&&(F(("((i19.i2.u212.p657!=0)||(i46.i4.u724.p2352!=1))")&&(G("(i3.i1.u505.p1630!=1)"))))))))
Formula 0 simplified : !F(XF"((i46.i4.u724.p2352==0)||(i19.i2.u212.p657==1))" | ("((i2.i1.u521.p1676!=0)&&(i9.i6.u175.p545!=1))" & F("((i19.i2.u212.p657!=0)||(i46.i4.u724.p2352!=1))" & G"(i3.i1.u505.p1630!=1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11761143333251425286
[2021-05-17 21:53:06] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11761143333251425286
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/ltsmin11761143333251425286]
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/ltsmin11761143333251425286] 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/ltsmin11761143333251425286] 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-050B-04 finished in 69170 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 1968 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 554 transitions
Trivial Post-agglo rules discarded 554 transitions
Performed 554 trivial Post agglomeration. Transition count delta: 554
Iterating post reduction 0 with 554 rules applied. Total rules applied 554 place count 1967 transition count 1413
Reduce places removed 554 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 555 rules applied. Total rules applied 1109 place count 1413 transition count 1412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1110 place count 1412 transition count 1412
Performed 390 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 390 Pre rules applied. Total rules applied 1110 place count 1412 transition count 1022
Deduced a syphon composed of 390 places in 3 ms
Reduce places removed 390 places and 0 transitions.
Iterating global reduction 3 with 780 rules applied. Total rules applied 1890 place count 1022 transition count 1022
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1902 place count 1010 transition count 1010
Iterating global reduction 3 with 12 rules applied. Total rules applied 1914 place count 1010 transition count 1010
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1914 place count 1010 transition count 1003
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1928 place count 1003 transition count 1003
Performed 448 Post agglomeration using F-continuation condition.Transition count delta: 448
Deduced a syphon composed of 448 places in 0 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 3 with 896 rules applied. Total rules applied 2824 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2825 place count 555 transition count 554
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2827 place count 554 transition count 553
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 4 with 202 rules applied. Total rules applied 3029 place count 453 transition count 651
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 3121 place count 407 transition count 697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3122 place count 406 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3123 place count 405 transition count 696
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3124 place count 404 transition count 695
Applied a total of 3124 rules in 446 ms. Remains 404 /1968 variables (removed 1564) and now considering 695/1968 (removed 1273) transitions.
// Phase 1: matrix 695 rows 404 cols
[2021-05-17 21:53:08] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-17 21:53:08] [INFO ] Implicit Places using invariants in 497 ms returned []
// Phase 1: matrix 695 rows 404 cols
[2021-05-17 21:53:08] [INFO ] Computed 200 place invariants in 13 ms
[2021-05-17 21:53:09] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
[2021-05-17 21:53:09] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 695 rows 404 cols
[2021-05-17 21:53:09] [INFO ] Computed 200 place invariants in 1 ms
[2021-05-17 21:53:10] [INFO ] Dead Transitions using invariants and state equation in 605 ms returned []
Finished structural reductions, in 1 iterations. Remains : 404/1968 places, 695/1968 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-05 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:(OR (EQ s19 0) (EQ s29 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]]
Product exploration explored 100000 steps with 16 reset in 945 ms.
Product exploration explored 100000 steps with 25 reset in 825 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 30 reset in 658 ms.
Product exploration explored 100000 steps with 27 reset in 790 ms.
[2021-05-17 21:53:13] [INFO ] Flatten gal took : 34 ms
[2021-05-17 21:53:13] [INFO ] Flatten gal took : 35 ms
[2021-05-17 21:53:13] [INFO ] Time to serialize gal into /tmp/LTL16373907124956023000.gal : 7 ms
[2021-05-17 21:53:13] [INFO ] Time to serialize properties into /tmp/LTL7145550124436682752.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/LTL16373907124956023000.gal, -t, CGAL, -LTL, /tmp/LTL7145550124436682752.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/LTL16373907124956023000.gal -t CGAL -LTL /tmp/LTL7145550124436682752.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((p145==0)||(p195==1))"))))
Formula 0 simplified : !GF"((p145==0)||(p195==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 3.26648e+38 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
159 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,1.7101,45544,1,0,9,172727,24,5,15044,65898,22
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-050B-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldRVt-PT-050B-05 finished in 7556 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 1968 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1953 transition count 1953
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1953 transition count 1953
Applied a total of 30 rules in 240 ms. Remains 1953 /1968 variables (removed 15) and now considering 1953/1968 (removed 15) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2021-05-17 21:53:15] [INFO ] Computed 201 place invariants in 5 ms
[2021-05-17 21:53:16] [INFO ] Implicit Places using invariants in 620 ms returned []
// Phase 1: matrix 1953 rows 1953 cols
[2021-05-17 21:53:16] [INFO ] Computed 201 place invariants in 12 ms
[2021-05-17 21:53:18] [INFO ] Implicit Places using invariants and state equation in 2511 ms returned []
Implicit Place search using SMT with State Equation took 3136 ms to find 0 implicit places.
// Phase 1: matrix 1953 rows 1953 cols
[2021-05-17 21:53:18] [INFO ] Computed 201 place invariants in 5 ms
[2021-05-17 21:53:21] [INFO ] Dead Transitions using invariants and state equation in 2242 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1953/1968 places, 1953/1968 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-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 s1885 0) (EQ s968 1) (EQ s1182 0) (EQ s1786 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]]
Product exploration explored 100000 steps with 2 reset in 721 ms.
Product exploration explored 100000 steps with 1 reset in 873 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 640 ms.
Product exploration explored 100000 steps with 3 reset in 933 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 1953 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1953/1953 places, 1953/1953 transitions.
Performed 548 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 548 rules applied. Total rules applied 548 place count 1953 transition count 1953
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 248 Pre rules applied. Total rules applied 548 place count 1953 transition count 2297
Deduced a syphon composed of 796 places in 5 ms
Iterating global reduction 1 with 248 rules applied. Total rules applied 796 place count 1953 transition count 2297
Performed 550 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1346 places in 5 ms
Iterating global reduction 1 with 550 rules applied. Total rules applied 1346 place count 1953 transition count 2298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1347 place count 1953 transition count 2297
Renaming transitions due to excessive name length > 1024 char.
Discarding 351 places :
Symmetric choice reduction at 2 with 351 rule applications. Total rules 1698 place count 1602 transition count 1946
Deduced a syphon composed of 995 places in 3 ms
Iterating global reduction 2 with 351 rules applied. Total rules applied 2049 place count 1602 transition count 1946
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 996 places in 4 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2050 place count 1602 transition count 1946
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2052 place count 1600 transition count 1944
Deduced a syphon composed of 994 places in 4 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2054 place count 1600 transition count 1944
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -803
Deduced a syphon composed of 1095 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2155 place count 1600 transition count 2747
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2256 place count 1499 transition count 2545
Deduced a syphon composed of 994 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2357 place count 1499 transition count 2545
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: -398
Deduced a syphon composed of 1044 places in 1 ms
Iterating global reduction 2 with 50 rules applied. Total rules applied 2407 place count 1499 transition count 2943
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 2457 place count 1449 transition count 2843
Deduced a syphon composed of 994 places in 1 ms
Iterating global reduction 2 with 50 rules applied. Total rules applied 2507 place count 1449 transition count 2843
Deduced a syphon composed of 994 places in 1 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2516 place count 1449 transition count 2834
Deduced a syphon composed of 994 places in 1 ms
Applied a total of 2516 rules in 997 ms. Remains 1449 /1953 variables (removed 504) and now considering 2834/1953 (removed -881) transitions.
[2021-05-17 21:53:25] [INFO ] Redundant transitions in 98 ms returned []
// Phase 1: matrix 2834 rows 1449 cols
[2021-05-17 21:53:25] [INFO ] Computed 201 place invariants in 15 ms
[2021-05-17 21:53:27] [INFO ] Dead Transitions using invariants and state equation in 1761 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1449/1953 places, 2834/1953 transitions.
Entered a terminal (fully accepting) state of product in 86616 steps with 16 reset in 695 ms.
FORMULA ShieldRVt-PT-050B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-06 finished in 12883 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1968 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 556 transitions
Trivial Post-agglo rules discarded 556 transitions
Performed 556 trivial Post agglomeration. Transition count delta: 556
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 1967 transition count 1411
Reduce places removed 556 places and 0 transitions.
Iterating post reduction 1 with 556 rules applied. Total rules applied 1112 place count 1411 transition count 1411
Performed 390 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 390 Pre rules applied. Total rules applied 1112 place count 1411 transition count 1021
Deduced a syphon composed of 390 places in 2 ms
Reduce places removed 390 places and 0 transitions.
Iterating global reduction 2 with 780 rules applied. Total rules applied 1892 place count 1021 transition count 1021
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1901 place count 1012 transition count 1012
Iterating global reduction 2 with 9 rules applied. Total rules applied 1910 place count 1012 transition count 1012
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1910 place count 1012 transition count 1008
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1918 place count 1008 transition count 1008
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 449
Deduced a syphon composed of 449 places in 0 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 2 with 898 rules applied. Total rules applied 2816 place count 559 transition count 559
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2817 place count 559 transition count 558
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 2819 place count 558 transition count 557
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3021 place count 457 transition count 657
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3117 place count 409 transition count 704
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3118 place count 408 transition count 703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3119 place count 407 transition count 703
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3120 place count 406 transition count 702
Applied a total of 3120 rules in 352 ms. Remains 406 /1968 variables (removed 1562) and now considering 702/1968 (removed 1266) transitions.
// Phase 1: matrix 702 rows 406 cols
[2021-05-17 21:53:28] [INFO ] Computed 200 place invariants in 1 ms
[2021-05-17 21:53:29] [INFO ] Implicit Places using invariants in 474 ms returned []
// Phase 1: matrix 702 rows 406 cols
[2021-05-17 21:53:29] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-17 21:53:29] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-17 21:53:30] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1359 ms to find 0 implicit places.
[2021-05-17 21:53:30] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 702 rows 406 cols
[2021-05-17 21:53:30] [INFO ] Computed 200 place invariants in 1 ms
[2021-05-17 21:53:30] [INFO ] Dead Transitions using invariants and state equation in 542 ms returned []
Finished structural reductions, in 1 iterations. Remains : 406/1968 places, 702/1968 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-050B-10 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s35 0) (EQ s85 1)), p1:(AND (NEQ s297 0) (NEQ s268 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1884 steps with 1 reset in 24 ms.
FORMULA ShieldRVt-PT-050B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-10 finished in 2354 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1968 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1952 transition count 1952
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1952 transition count 1952
Applied a total of 32 rules in 239 ms. Remains 1952 /1968 variables (removed 16) and now considering 1952/1968 (removed 16) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2021-05-17 21:53:30] [INFO ] Computed 201 place invariants in 6 ms
[2021-05-17 21:53:31] [INFO ] Implicit Places using invariants in 746 ms returned []
// Phase 1: matrix 1952 rows 1952 cols
[2021-05-17 21:53:31] [INFO ] Computed 201 place invariants in 5 ms
[2021-05-17 21:53:33] [INFO ] Implicit Places using invariants and state equation in 2044 ms returned []
Implicit Place search using SMT with State Equation took 2793 ms to find 0 implicit places.
// Phase 1: matrix 1952 rows 1952 cols
[2021-05-17 21:53:33] [INFO ] Computed 201 place invariants in 6 ms
[2021-05-17 21:53:35] [INFO ] Dead Transitions using invariants and state equation in 1682 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1952/1968 places, 1952/1968 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-050B-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (EQ s1238 0) (EQ s1050 1)) (OR (EQ s1424 0) (EQ s850 1))), p1:(AND (NEQ s1424 0) (NEQ s850 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1808 ms.
Product exploration explored 100000 steps with 50000 reset in 1804 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 1721 ms.
Product exploration explored 100000 steps with 50000 reset in 1736 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1952 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Performed 547 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1952 transition count 1952
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 250 Pre rules applied. Total rules applied 547 place count 1952 transition count 2296
Deduced a syphon composed of 797 places in 8 ms
Iterating global reduction 1 with 250 rules applied. Total rules applied 797 place count 1952 transition count 2296
Performed 548 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1345 places in 7 ms
Iterating global reduction 1 with 548 rules applied. Total rules applied 1345 place count 1952 transition count 2296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1346 place count 1952 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Discarding 349 places :
Symmetric choice reduction at 2 with 349 rule applications. Total rules 1695 place count 1603 transition count 1946
Deduced a syphon composed of 996 places in 19 ms
Iterating global reduction 2 with 349 rules applied. Total rules applied 2044 place count 1603 transition count 1946
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 997 places in 5 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2045 place count 1603 transition count 1946
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2047 place count 1601 transition count 1944
Deduced a syphon composed of 995 places in 4 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2049 place count 1601 transition count 1944
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -802
Deduced a syphon composed of 1096 places in 7 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2150 place count 1601 transition count 2746
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2251 place count 1500 transition count 2544
Deduced a syphon composed of 995 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2352 place count 1500 transition count 2544
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: -408
Deduced a syphon composed of 1046 places in 1 ms
Iterating global reduction 2 with 51 rules applied. Total rules applied 2403 place count 1500 transition count 2952
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 2454 place count 1449 transition count 2850
Deduced a syphon composed of 995 places in 1 ms
Iterating global reduction 2 with 51 rules applied. Total rules applied 2505 place count 1449 transition count 2850
Deduced a syphon composed of 995 places in 1 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2514 place count 1449 transition count 2841
Deduced a syphon composed of 995 places in 1 ms
Applied a total of 2514 rules in 1364 ms. Remains 1449 /1952 variables (removed 503) and now considering 2841/1952 (removed -889) transitions.
[2021-05-17 21:53:44] [INFO ] Redundant transitions in 108 ms returned []
// Phase 1: matrix 2841 rows 1449 cols
[2021-05-17 21:53:44] [INFO ] Computed 201 place invariants in 21 ms
[2021-05-17 21:53:47] [INFO ] Dead Transitions using invariants and state equation in 2476 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1449/1952 places, 2841/1952 transitions.
Product exploration explored 100000 steps with 50000 reset in 2097 ms.
Product exploration explored 100000 steps with 50000 reset in 1696 ms.
[2021-05-17 21:53:50] [INFO ] Flatten gal took : 47 ms
[2021-05-17 21:53:51] [INFO ] Flatten gal took : 56 ms
[2021-05-17 21:53:51] [INFO ] Time to serialize gal into /tmp/LTL6968506216991206032.gal : 12 ms
[2021-05-17 21:53:51] [INFO ] Time to serialize properties into /tmp/LTL5253878733160693203.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/LTL6968506216991206032.gal, -t, CGAL, -LTL, /tmp/LTL5253878733160693203.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/LTL6968506216991206032.gal -t CGAL -LTL /tmp/LTL5253878733160693203.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((X("((p1819!=0)&&(p1080!=1))"))||("(((p1579==0)||(p1337==1))&&((p1819==0)||(p1080==1)))")))))
Formula 0 simplified : !XF("(((p1579==0)||(p1337==1))&&((p1819==0)||(p1080==1)))" | X"((p1819!=0)&&(p1080!=1))")
Detected timeout of ITS tools.
[2021-05-17 21:54:06] [INFO ] Flatten gal took : 47 ms
[2021-05-17 21:54:06] [INFO ] Applying decomposition
[2021-05-17 21:54:06] [INFO ] Flatten gal took : 47 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/graph4069304045732257258.txt, -o, /tmp/graph4069304045732257258.bin, -w, /tmp/graph4069304045732257258.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/graph4069304045732257258.bin, -l, -1, -v, -w, /tmp/graph4069304045732257258.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 21:54:06] [INFO ] Decomposing Gal with order
[2021-05-17 21:54:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 21:54:06] [INFO ] Removed a total of 501 redundant transitions.
[2021-05-17 21:54:06] [INFO ] Flatten gal took : 142 ms
[2021-05-17 21:54:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2021-05-17 21:54:06] [INFO ] Time to serialize gal into /tmp/LTL12404077232905478398.gal : 24 ms
[2021-05-17 21:54:07] [INFO ] Time to serialize properties into /tmp/LTL14391453249742396788.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/LTL12404077232905478398.gal, -t, CGAL, -LTL, /tmp/LTL14391453249742396788.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/LTL12404077232905478398.gal -t CGAL -LTL /tmp/LTL14391453249742396788.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((X("((i37.i0.u566.p1819!=0)&&(i24.i4.u335.p1080!=1))"))||("(((i3.i1.u491.p1579==0)||(i5.i2.u416.p1337==1))&&((i37.i0.u566.p1819==0)||(i24.i4.u335.p1080==1)))")))))
Formula 0 simplified : !XF("(((i3.i1.u491.p1579==0)||(i5.i2.u416.p1337==1))&&((i37.i0.u566.p1819==0)||(i24.i4.u335.p1080==1)))" | X"((i37.i0.u566.p1819!=0)&&(i24.i4.u335.p1080!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4003142381035232311
[2021-05-17 21:54:22] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4003142381035232311
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/ltsmin4003142381035232311]
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/ltsmin4003142381035232311] 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/ltsmin4003142381035232311] 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-050B-12 finished in 52347 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 1968 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1952 transition count 1952
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1952 transition count 1952
Applied a total of 32 rules in 231 ms. Remains 1952 /1968 variables (removed 16) and now considering 1952/1968 (removed 16) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2021-05-17 21:54:23] [INFO ] Computed 201 place invariants in 5 ms
[2021-05-17 21:54:24] [INFO ] Implicit Places using invariants in 882 ms returned []
// Phase 1: matrix 1952 rows 1952 cols
[2021-05-17 21:54:24] [INFO ] Computed 201 place invariants in 5 ms
[2021-05-17 21:54:27] [INFO ] Implicit Places using invariants and state equation in 3303 ms returned []
Implicit Place search using SMT with State Equation took 4216 ms to find 0 implicit places.
// Phase 1: matrix 1952 rows 1952 cols
[2021-05-17 21:54:27] [INFO ] Computed 201 place invariants in 4 ms
[2021-05-17 21:54:29] [INFO ] Dead Transitions using invariants and state equation in 1705 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1952/1968 places, 1952/1968 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s1853 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 1 ms.
FORMULA ShieldRVt-PT-050B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-13 finished in 6370 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9897479151458457518
[2021-05-17 21:54:29] [INFO ] Too many transitions (1968) to apply POR reductions. Disabling POR matrices.
[2021-05-17 21:54:29] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9897479151458457518
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/ltsmin9897479151458457518]
[2021-05-17 21:54:29] [INFO ] Applying decomposition
[2021-05-17 21:54:29] [INFO ] Flatten gal took : 103 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/graph9534211687915504350.txt, -o, /tmp/graph9534211687915504350.bin, -w, /tmp/graph9534211687915504350.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/graph9534211687915504350.bin, -l, -1, -v, -w, /tmp/graph9534211687915504350.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 21:54:29] [INFO ] Decomposing Gal with order
[2021-05-17 21:54:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 21:54:30] [INFO ] Removed a total of 481 redundant transitions.
[2021-05-17 21:54:30] [INFO ] Flatten gal took : 115 ms
[2021-05-17 21:54:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2021-05-17 21:54:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality9891582673422754884.gal : 49 ms
[2021-05-17 21:54:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality2815192043440398398.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/LTLCardinality9891582673422754884.gal, -t, CGAL, -LTL, /tmp/LTLCardinality2815192043440398398.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/LTLCardinality9891582673422754884.gal -t CGAL -LTL /tmp/LTLCardinality2815192043440398398.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((G(F(("((i40.i2.u676.p2178==0)||(i40.i2.u676.p2178==1))")&&(("(i41.i2.u688.p2233==1)")U(G("((i15.i4.u156.p487==0)||(i38.i4.u651.p2101==1))")))))))
Formula 0 simplified : !GF("((i40.i2.u676.p2178==0)||(i40.i2.u676.p2178==1))" & ("(i41.i2.u688.p2233==1)" U G"((i15.i4.u156.p487==0)||(i38.i4.u651.p2101==1))"))
Compilation finished in 33094 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9897479151458457518]
Link finished in 66 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin9897479151458457518]
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))), --buchi-type=spotba], workingDir=/tmp/ltsmin9897479151458457518]
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(<>((LTLAPp1==true)))||(<>(((LTLAPp3==true)&&[]((LTLAPp4==true))))&&(LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9897479151458457518]
LTSmin run took 517 ms.
FORMULA ShieldRVt-PT-050B-04 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(<>(((LTLAPp5==true)||X((LTLAPp6==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9897479151458457518]
LTSmin run took 930 ms.
FORMULA ShieldRVt-PT-050B-12 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin9897479151458457518]
LTSmin run took 495735 ms.
FORMULA ShieldRVt-PT-050B-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621289401479

--------------------
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-050B"
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-050B, 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-162106564800332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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