Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r216-tall-162098205800903.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPt-PT-050B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205800903
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 12:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 18:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 18:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 955K May 5 16:52 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-050B-00
FORMULA_NAME ShieldPPPt-PT-050B-01
FORMULA_NAME ShieldPPPt-PT-050B-02
FORMULA_NAME ShieldPPPt-PT-050B-03
FORMULA_NAME ShieldPPPt-PT-050B-04
FORMULA_NAME ShieldPPPt-PT-050B-05
FORMULA_NAME ShieldPPPt-PT-050B-06
FORMULA_NAME ShieldPPPt-PT-050B-07
FORMULA_NAME ShieldPPPt-PT-050B-08
FORMULA_NAME ShieldPPPt-PT-050B-09
FORMULA_NAME ShieldPPPt-PT-050B-10
FORMULA_NAME ShieldPPPt-PT-050B-11
FORMULA_NAME ShieldPPPt-PT-050B-12
FORMULA_NAME ShieldPPPt-PT-050B-13
FORMULA_NAME ShieldPPPt-PT-050B-14
FORMULA_NAME ShieldPPPt-PT-050B-15

=== Now, execution of the tool begins

BK_START 1622944688713

Running Version 0
[2021-06-06 01:58:10] [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-06-06 01:58:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 01:58:10] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2021-06-06 01:58:10] [INFO ] Transformed 3903 places.
[2021-06-06 01:58:10] [INFO ] Transformed 3553 transitions.
[2021-06-06 01:58:10] [INFO ] Found NUPN structural information;
[2021-06-06 01:58:10] [INFO ] Parsed PT model containing 3903 places and 3553 transitions in 421 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-06-06 01:58:10] [INFO ] Initial state test concluded for 5 properties.
FORMULA ShieldPPPt-PT-050B-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 3903 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Discarding 544 places :
Symmetric choice reduction at 0 with 544 rule applications. Total rules 544 place count 3359 transition count 3009
Iterating global reduction 0 with 544 rules applied. Total rules applied 1088 place count 3359 transition count 3009
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1089 place count 3358 transition count 3008
Iterating global reduction 0 with 1 rules applied. Total rules applied 1090 place count 3358 transition count 3008
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1091 place count 3357 transition count 3007
Iterating global reduction 0 with 1 rules applied. Total rules applied 1092 place count 3357 transition count 3007
Applied a total of 1092 rules in 1757 ms. Remains 3357 /3903 variables (removed 546) and now considering 3007/3553 (removed 546) transitions.
// Phase 1: matrix 3007 rows 3357 cols
[2021-06-06 01:58:12] [INFO ] Computed 551 place invariants in 43 ms
[2021-06-06 01:58:13] [INFO ] Implicit Places using invariants in 1085 ms returned []
// Phase 1: matrix 3007 rows 3357 cols
[2021-06-06 01:58:13] [INFO ] Computed 551 place invariants in 15 ms
[2021-06-06 01:58:17] [INFO ] Implicit Places using invariants and state equation in 3399 ms returned []
Implicit Place search using SMT with State Equation took 4513 ms to find 0 implicit places.
// Phase 1: matrix 3007 rows 3357 cols
[2021-06-06 01:58:17] [INFO ] Computed 551 place invariants in 16 ms
[2021-06-06 01:58:19] [INFO ] Dead Transitions using invariants and state equation in 2192 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3357/3903 places, 3007/3553 transitions.
[2021-06-06 01:58:20] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-06-06 01:58:20] [INFO ] Flatten gal took : 203 ms
FORMULA ShieldPPPt-PT-050B-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-06 01:58:20] [INFO ] Flatten gal took : 137 ms
[2021-06-06 01:58:20] [INFO ] Input system was already deterministic with 3007 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1135 ms. (steps per millisecond=88 ) properties (out of 19) seen :9
Running SMT prover for 10 properties.
// Phase 1: matrix 3007 rows 3357 cols
[2021-06-06 01:58:21] [INFO ] Computed 551 place invariants in 18 ms
[2021-06-06 01:58:22] [INFO ] [Real]Absence check using 551 positive place invariants in 233 ms returned sat
[2021-06-06 01:58:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 01:58:23] [INFO ] [Real]Absence check using state equation in 1619 ms returned sat
[2021-06-06 01:58:24] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 01:58:24] [INFO ] [Nat]Absence check using 551 positive place invariants in 59 ms returned unsat
[2021-06-06 01:58:24] [INFO ] [Real]Absence check using 551 positive place invariants in 211 ms returned sat
[2021-06-06 01:58:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 01:58:26] [INFO ] [Real]Absence check using state equation in 1549 ms returned sat
[2021-06-06 01:58:26] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 01:58:27] [INFO ] [Nat]Absence check using 551 positive place invariants in 204 ms returned unsat
[2021-06-06 01:58:27] [INFO ] [Real]Absence check using 551 positive place invariants in 205 ms returned sat
[2021-06-06 01:58:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 01:58:29] [INFO ] [Real]Absence check using state equation in 1567 ms returned sat
[2021-06-06 01:58:29] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 01:58:29] [INFO ] [Nat]Absence check using 551 positive place invariants in 213 ms returned sat
[2021-06-06 01:58:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 01:58:31] [INFO ] [Nat]Absence check using state equation in 1637 ms returned sat
[2021-06-06 01:58:32] [INFO ] Deduced a trap composed of 25 places in 798 ms of which 7 ms to minimize.
[2021-06-06 01:58:33] [INFO ] Deduced a trap composed of 23 places in 847 ms of which 8 ms to minimize.
[2021-06-06 01:58:34] [INFO ] Deduced a trap composed of 22 places in 791 ms of which 6 ms to minimize.
[2021-06-06 01:58:35] [INFO ] Deduced a trap composed of 16 places in 787 ms of which 11 ms to minimize.
[2021-06-06 01:58:36] [INFO ] Deduced a trap composed of 24 places in 762 ms of which 2 ms to minimize.
[2021-06-06 01:58:36] [INFO ] Deduced a trap composed of 21 places in 786 ms of which 6 ms to minimize.
[2021-06-06 01:58:37] [INFO ] Deduced a trap composed of 21 places in 746 ms of which 2 ms to minimize.
[2021-06-06 01:58:38] [INFO ] Deduced a trap composed of 20 places in 734 ms of which 2 ms to minimize.
[2021-06-06 01:58:39] [INFO ] Deduced a trap composed of 17 places in 739 ms of which 1 ms to minimize.
[2021-06-06 01:58:40] [INFO ] Deduced a trap composed of 25 places in 688 ms of which 1 ms to minimize.
[2021-06-06 01:58:41] [INFO ] Deduced a trap composed of 17 places in 691 ms of which 2 ms to minimize.
[2021-06-06 01:58:41] [INFO ] Deduced a trap composed of 27 places in 732 ms of which 2 ms to minimize.
[2021-06-06 01:58:42] [INFO ] Deduced a trap composed of 25 places in 679 ms of which 2 ms to minimize.
[2021-06-06 01:58:43] [INFO ] Deduced a trap composed of 27 places in 653 ms of which 1 ms to minimize.
[2021-06-06 01:58:44] [INFO ] Deduced a trap composed of 29 places in 610 ms of which 1 ms to minimize.
[2021-06-06 01:58:45] [INFO ] Deduced a trap composed of 21 places in 635 ms of which 2 ms to minimize.
[2021-06-06 01:58:45] [INFO ] Deduced a trap composed of 30 places in 620 ms of which 2 ms to minimize.
[2021-06-06 01:58:46] [INFO ] Deduced a trap composed of 43 places in 610 ms of which 2 ms to minimize.
[2021-06-06 01:58:47] [INFO ] Deduced a trap composed of 31 places in 610 ms of which 2 ms to minimize.
[2021-06-06 01:58:47] [INFO ] Deduced a trap composed of 30 places in 610 ms of which 2 ms to minimize.
[2021-06-06 01:58:48] [INFO ] Deduced a trap composed of 32 places in 593 ms of which 2 ms to minimize.
[2021-06-06 01:58:49] [INFO ] Deduced a trap composed of 31 places in 592 ms of which 1 ms to minimize.
[2021-06-06 01:58:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-06-06 01:58:49] [INFO ] [Real]Absence check using 551 positive place invariants in 223 ms returned sat
[2021-06-06 01:58:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 01:58:51] [INFO ] [Real]Absence check using state equation in 1620 ms returned sat
[2021-06-06 01:58:51] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 01:58:52] [INFO ] [Nat]Absence check using 551 positive place invariants in 233 ms returned sat
[2021-06-06 01:58:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 01:58:53] [INFO ] [Nat]Absence check using state equation in 1529 ms returned sat
[2021-06-06 01:58:54] [INFO ] Deduced a trap composed of 24 places in 821 ms of which 2 ms to minimize.
[2021-06-06 01:58:55] [INFO ] Deduced a trap composed of 20 places in 826 ms of which 2 ms to minimize.
[2021-06-06 01:58:56] [INFO ] Deduced a trap composed of 18 places in 852 ms of which 2 ms to minimize.
[2021-06-06 01:58:57] [INFO ] Deduced a trap composed of 26 places in 916 ms of which 1 ms to minimize.
[2021-06-06 01:58:58] [INFO ] Deduced a trap composed of 26 places in 869 ms of which 2 ms to minimize.
[2021-06-06 01:58:59] [INFO ] Deduced a trap composed of 20 places in 867 ms of which 1 ms to minimize.
[2021-06-06 01:59:00] [INFO ] Deduced a trap composed of 27 places in 869 ms of which 2 ms to minimize.
[2021-06-06 01:59:01] [INFO ] Deduced a trap composed of 26 places in 845 ms of which 2 ms to minimize.
[2021-06-06 01:59:02] [INFO ] Deduced a trap composed of 27 places in 818 ms of which 2 ms to minimize.
[2021-06-06 01:59:03] [INFO ] Deduced a trap composed of 23 places in 829 ms of which 1 ms to minimize.
[2021-06-06 01:59:04] [INFO ] Deduced a trap composed of 26 places in 810 ms of which 2 ms to minimize.
[2021-06-06 01:59:05] [INFO ] Deduced a trap composed of 23 places in 803 ms of which 2 ms to minimize.
[2021-06-06 01:59:05] [INFO ] Deduced a trap composed of 18 places in 791 ms of which 2 ms to minimize.
[2021-06-06 01:59:06] [INFO ] Deduced a trap composed of 17 places in 786 ms of which 1 ms to minimize.
[2021-06-06 01:59:07] [INFO ] Deduced a trap composed of 17 places in 812 ms of which 1 ms to minimize.
[2021-06-06 01:59:08] [INFO ] Deduced a trap composed of 20 places in 766 ms of which 2 ms to minimize.
[2021-06-06 01:59:09] [INFO ] Deduced a trap composed of 33 places in 752 ms of which 1 ms to minimize.
[2021-06-06 01:59:10] [INFO ] Deduced a trap composed of 36 places in 742 ms of which 1 ms to minimize.
[2021-06-06 01:59:11] [INFO ] Deduced a trap composed of 25 places in 745 ms of which 1 ms to minimize.
[2021-06-06 01:59:12] [INFO ] Deduced a trap composed of 25 places in 786 ms of which 1 ms to minimize.
[2021-06-06 01:59:12] [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-06-06 01:59:12] [INFO ] [Real]Absence check using 551 positive place invariants in 210 ms returned sat
[2021-06-06 01:59:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 01:59:14] [INFO ] [Real]Absence check using state equation in 1583 ms returned sat
[2021-06-06 01:59:14] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 01:59:14] [INFO ] [Nat]Absence check using 551 positive place invariants in 209 ms returned sat
[2021-06-06 01:59:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 01:59:16] [INFO ] [Nat]Absence check using state equation in 1556 ms returned sat
[2021-06-06 01:59:17] [INFO ] Deduced a trap composed of 25 places in 802 ms of which 2 ms to minimize.
[2021-06-06 01:59:18] [INFO ] Deduced a trap composed of 24 places in 811 ms of which 2 ms to minimize.
[2021-06-06 01:59:19] [INFO ] Deduced a trap composed of 25 places in 847 ms of which 3 ms to minimize.
[2021-06-06 01:59:20] [INFO ] Deduced a trap composed of 22 places in 801 ms of which 2 ms to minimize.
[2021-06-06 01:59:20] [INFO ] Deduced a trap composed of 22 places in 769 ms of which 2 ms to minimize.
[2021-06-06 01:59:21] [INFO ] Deduced a trap composed of 21 places in 789 ms of which 1 ms to minimize.
[2021-06-06 01:59:22] [INFO ] Deduced a trap composed of 20 places in 769 ms of which 2 ms to minimize.
[2021-06-06 01:59:23] [INFO ] Deduced a trap composed of 16 places in 777 ms of which 1 ms to minimize.
[2021-06-06 01:59:24] [INFO ] Deduced a trap composed of 26 places in 765 ms of which 2 ms to minimize.
[2021-06-06 01:59:25] [INFO ] Deduced a trap composed of 24 places in 777 ms of which 1 ms to minimize.
[2021-06-06 01:59:26] [INFO ] Deduced a trap composed of 26 places in 772 ms of which 2 ms to minimize.
[2021-06-06 01:59:27] [INFO ] Deduced a trap composed of 20 places in 772 ms of which 2 ms to minimize.
[2021-06-06 01:59:27] [INFO ] Deduced a trap composed of 29 places in 726 ms of which 2 ms to minimize.
[2021-06-06 01:59:28] [INFO ] Deduced a trap composed of 28 places in 703 ms of which 10 ms to minimize.
[2021-06-06 01:59:29] [INFO ] Deduced a trap composed of 24 places in 700 ms of which 2 ms to minimize.
[2021-06-06 01:59:30] [INFO ] Deduced a trap composed of 24 places in 685 ms of which 2 ms to minimize.
[2021-06-06 01:59:31] [INFO ] Deduced a trap composed of 26 places in 674 ms of which 2 ms to minimize.
[2021-06-06 01:59:31] [INFO ] Deduced a trap composed of 28 places in 680 ms of which 2 ms to minimize.
[2021-06-06 01:59:32] [INFO ] Deduced a trap composed of 34 places in 658 ms of which 2 ms to minimize.
[2021-06-06 01:59:33] [INFO ] Deduced a trap composed of 17 places in 664 ms of which 2 ms to minimize.
[2021-06-06 01:59:34] [INFO ] Deduced a trap composed of 30 places in 660 ms of which 1 ms to minimize.
[2021-06-06 01:59:34] [INFO ] Deduced a trap composed of 30 places in 638 ms of which 2 ms to minimize.
[2021-06-06 01:59:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2021-06-06 01:59:35] [INFO ] [Real]Absence check using 551 positive place invariants in 198 ms returned sat
[2021-06-06 01:59:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 01:59:36] [INFO ] [Real]Absence check using state equation in 1582 ms returned sat
[2021-06-06 01:59:37] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 01:59:37] [INFO ] [Nat]Absence check using 551 positive place invariants in 206 ms returned sat
[2021-06-06 01:59:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 01:59:39] [INFO ] [Nat]Absence check using state equation in 1569 ms returned sat
[2021-06-06 01:59:40] [INFO ] Deduced a trap composed of 22 places in 785 ms of which 2 ms to minimize.
[2021-06-06 01:59:40] [INFO ] Deduced a trap composed of 23 places in 769 ms of which 4 ms to minimize.
[2021-06-06 01:59:41] [INFO ] Deduced a trap composed of 20 places in 754 ms of which 5 ms to minimize.
[2021-06-06 01:59:42] [INFO ] Deduced a trap composed of 26 places in 771 ms of which 15 ms to minimize.
[2021-06-06 01:59:43] [INFO ] Deduced a trap composed of 26 places in 753 ms of which 2 ms to minimize.
[2021-06-06 01:59:44] [INFO ] Deduced a trap composed of 16 places in 742 ms of which 2 ms to minimize.
[2021-06-06 01:59:45] [INFO ] Deduced a trap composed of 23 places in 724 ms of which 2 ms to minimize.
[2021-06-06 01:59:46] [INFO ] Deduced a trap composed of 19 places in 741 ms of which 2 ms to minimize.
[2021-06-06 01:59:46] [INFO ] Deduced a trap composed of 16 places in 718 ms of which 1 ms to minimize.
[2021-06-06 01:59:47] [INFO ] Deduced a trap composed of 16 places in 751 ms of which 3 ms to minimize.
[2021-06-06 01:59:48] [INFO ] Deduced a trap composed of 26 places in 697 ms of which 1 ms to minimize.
[2021-06-06 01:59:49] [INFO ] Deduced a trap composed of 31 places in 705 ms of which 1 ms to minimize.
[2021-06-06 01:59:50] [INFO ] Deduced a trap composed of 26 places in 735 ms of which 2 ms to minimize.
[2021-06-06 01:59:50] [INFO ] Deduced a trap composed of 24 places in 702 ms of which 1 ms to minimize.
[2021-06-06 01:59:51] [INFO ] Deduced a trap composed of 30 places in 689 ms of which 1 ms to minimize.
[2021-06-06 01:59:52] [INFO ] Deduced a trap composed of 29 places in 709 ms of which 5 ms to minimize.
[2021-06-06 01:59:53] [INFO ] Deduced a trap composed of 26 places in 715 ms of which 1 ms to minimize.
[2021-06-06 01:59:54] [INFO ] Deduced a trap composed of 31 places in 683 ms of which 1 ms to minimize.
[2021-06-06 01:59:54] [INFO ] Deduced a trap composed of 37 places in 648 ms of which 1 ms to minimize.
[2021-06-06 01:59:55] [INFO ] Deduced a trap composed of 48 places in 643 ms of which 1 ms to minimize.
[2021-06-06 01:59:56] [INFO ] Deduced a trap composed of 50 places in 653 ms of which 1 ms to minimize.
[2021-06-06 01:59:57] [INFO ] Deduced a trap composed of 25 places in 641 ms of which 2 ms to minimize.
[2021-06-06 01:59:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-06-06 01:59:57] [INFO ] [Real]Absence check using 551 positive place invariants in 203 ms returned sat
[2021-06-06 01:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 01:59:59] [INFO ] [Real]Absence check using state equation in 1603 ms returned sat
[2021-06-06 01:59:59] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 01:59:59] [INFO ] [Nat]Absence check using 551 positive place invariants in 205 ms returned sat
[2021-06-06 01:59:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 02:00:01] [INFO ] [Nat]Absence check using state equation in 1559 ms returned sat
[2021-06-06 02:00:02] [INFO ] Deduced a trap composed of 31 places in 736 ms of which 2 ms to minimize.
[2021-06-06 02:00:03] [INFO ] Deduced a trap composed of 16 places in 736 ms of which 1 ms to minimize.
[2021-06-06 02:00:04] [INFO ] Deduced a trap composed of 24 places in 725 ms of which 2 ms to minimize.
[2021-06-06 02:00:04] [INFO ] Deduced a trap composed of 18 places in 744 ms of which 2 ms to minimize.
[2021-06-06 02:00:05] [INFO ] Deduced a trap composed of 20 places in 706 ms of which 2 ms to minimize.
[2021-06-06 02:00:06] [INFO ] Deduced a trap composed of 34 places in 690 ms of which 2 ms to minimize.
[2021-06-06 02:00:07] [INFO ] Deduced a trap composed of 17 places in 688 ms of which 1 ms to minimize.
[2021-06-06 02:00:08] [INFO ] Deduced a trap composed of 20 places in 675 ms of which 2 ms to minimize.
[2021-06-06 02:00:08] [INFO ] Deduced a trap composed of 27 places in 669 ms of which 1 ms to minimize.
[2021-06-06 02:00:09] [INFO ] Deduced a trap composed of 20 places in 662 ms of which 1 ms to minimize.
[2021-06-06 02:00:10] [INFO ] Deduced a trap composed of 26 places in 628 ms of which 2 ms to minimize.
[2021-06-06 02:00:11] [INFO ] Deduced a trap composed of 26 places in 671 ms of which 2 ms to minimize.
[2021-06-06 02:00:11] [INFO ] Deduced a trap composed of 22 places in 645 ms of which 2 ms to minimize.
[2021-06-06 02:00:12] [INFO ] Deduced a trap composed of 17 places in 634 ms of which 1 ms to minimize.
[2021-06-06 02:00:13] [INFO ] Deduced a trap composed of 31 places in 613 ms of which 1 ms to minimize.
[2021-06-06 02:00:14] [INFO ] Deduced a trap composed of 37 places in 642 ms of which 2 ms to minimize.
[2021-06-06 02:00:14] [INFO ] Deduced a trap composed of 30 places in 603 ms of which 2 ms to minimize.
[2021-06-06 02:00:15] [INFO ] Deduced a trap composed of 31 places in 587 ms of which 1 ms to minimize.
[2021-06-06 02:00:16] [INFO ] Deduced a trap composed of 26 places in 592 ms of which 2 ms to minimize.
[2021-06-06 02:00:16] [INFO ] Deduced a trap composed of 29 places in 572 ms of which 1 ms to minimize.
[2021-06-06 02:00:17] [INFO ] Deduced a trap composed of 37 places in 578 ms of which 1 ms to minimize.
[2021-06-06 02:00:18] [INFO ] Deduced a trap composed of 32 places in 567 ms of which 2 ms to minimize.
[2021-06-06 02:00:19] [INFO ] Deduced a trap composed of 36 places in 549 ms of which 1 ms to minimize.
[2021-06-06 02:00:19] [INFO ] Deduced a trap composed of 29 places in 559 ms of which 2 ms to minimize.
[2021-06-06 02:00:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2021-06-06 02:00:20] [INFO ] [Real]Absence check using 551 positive place invariants in 208 ms returned sat
[2021-06-06 02:00:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 02:00:21] [INFO ] [Real]Absence check using state equation in 1562 ms returned sat
[2021-06-06 02:00:21] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 02:00:22] [INFO ] [Nat]Absence check using 551 positive place invariants in 62 ms returned unsat
[2021-06-06 02:00:22] [INFO ] [Real]Absence check using 551 positive place invariants in 211 ms returned sat
[2021-06-06 02:00:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 02:00:24] [INFO ] [Real]Absence check using state equation in 1569 ms returned sat
[2021-06-06 02:00:24] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 02:00:24] [INFO ] [Nat]Absence check using 551 positive place invariants in 208 ms returned sat
[2021-06-06 02:00:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 02:00:26] [INFO ] [Nat]Absence check using state equation in 1567 ms returned sat
[2021-06-06 02:00:27] [INFO ] Deduced a trap composed of 24 places in 785 ms of which 2 ms to minimize.
[2021-06-06 02:00:28] [INFO ] Deduced a trap composed of 16 places in 777 ms of which 2 ms to minimize.
[2021-06-06 02:00:29] [INFO ] Deduced a trap composed of 29 places in 766 ms of which 2 ms to minimize.
[2021-06-06 02:00:30] [INFO ] Deduced a trap composed of 31 places in 758 ms of which 1 ms to minimize.
[2021-06-06 02:00:30] [INFO ] Deduced a trap composed of 31 places in 773 ms of which 1 ms to minimize.
[2021-06-06 02:00:31] [INFO ] Deduced a trap composed of 40 places in 771 ms of which 2 ms to minimize.
[2021-06-06 02:00:32] [INFO ] Deduced a trap composed of 26 places in 770 ms of which 2 ms to minimize.
[2021-06-06 02:00:33] [INFO ] Deduced a trap composed of 25 places in 754 ms of which 1 ms to minimize.
[2021-06-06 02:00:34] [INFO ] Deduced a trap composed of 17 places in 748 ms of which 13 ms to minimize.
[2021-06-06 02:00:35] [INFO ] Deduced a trap composed of 18 places in 732 ms of which 1 ms to minimize.
[2021-06-06 02:00:36] [INFO ] Deduced a trap composed of 31 places in 708 ms of which 2 ms to minimize.
[2021-06-06 02:00:36] [INFO ] Deduced a trap composed of 23 places in 707 ms of which 2 ms to minimize.
[2021-06-06 02:00:37] [INFO ] Deduced a trap composed of 16 places in 714 ms of which 1 ms to minimize.
[2021-06-06 02:00:38] [INFO ] Deduced a trap composed of 26 places in 720 ms of which 1 ms to minimize.
[2021-06-06 02:00:39] [INFO ] Deduced a trap composed of 28 places in 716 ms of which 2 ms to minimize.
[2021-06-06 02:00:40] [INFO ] Deduced a trap composed of 24 places in 693 ms of which 2 ms to minimize.
[2021-06-06 02:00:40] [INFO ] Deduced a trap composed of 25 places in 696 ms of which 1 ms to minimize.
[2021-06-06 02:00:41] [INFO ] Deduced a trap composed of 18 places in 694 ms of which 2 ms to minimize.
[2021-06-06 02:00:42] [INFO ] Deduced a trap composed of 23 places in 690 ms of which 1 ms to minimize.
[2021-06-06 02:00:43] [INFO ] Deduced a trap composed of 19 places in 683 ms of which 2 ms to minimize.
[2021-06-06 02:00:44] [INFO ] Deduced a trap composed of 23 places in 698 ms of which 2 ms to minimize.
[2021-06-06 02:00:44] [INFO ] Deduced a trap composed of 17 places in 661 ms of which 1 ms to minimize.
[2021-06-06 02:00:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
[2021-06-06 02:00:45] [INFO ] [Real]Absence check using 551 positive place invariants in 200 ms returned sat
[2021-06-06 02:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 02:00:46] [INFO ] [Real]Absence check using state equation in 1462 ms returned sat
[2021-06-06 02:00:46] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 02:00:47] [INFO ] [Nat]Absence check using 551 positive place invariants in 200 ms returned sat
[2021-06-06 02:00:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 02:00:48] [INFO ] [Nat]Absence check using state equation in 1509 ms returned sat
[2021-06-06 02:00:49] [INFO ] Deduced a trap composed of 28 places in 765 ms of which 4 ms to minimize.
[2021-06-06 02:00:50] [INFO ] Deduced a trap composed of 20 places in 797 ms of which 1 ms to minimize.
[2021-06-06 02:00:51] [INFO ] Deduced a trap composed of 16 places in 799 ms of which 2 ms to minimize.
[2021-06-06 02:00:52] [INFO ] Deduced a trap composed of 20 places in 769 ms of which 2 ms to minimize.
[2021-06-06 02:00:53] [INFO ] Deduced a trap composed of 22 places in 746 ms of which 1 ms to minimize.
[2021-06-06 02:00:54] [INFO ] Deduced a trap composed of 19 places in 743 ms of which 2 ms to minimize.
[2021-06-06 02:00:54] [INFO ] Deduced a trap composed of 17 places in 727 ms of which 2 ms to minimize.
[2021-06-06 02:00:55] [INFO ] Deduced a trap composed of 23 places in 739 ms of which 2 ms to minimize.
[2021-06-06 02:00:56] [INFO ] Deduced a trap composed of 25 places in 720 ms of which 2 ms to minimize.
[2021-06-06 02:00:57] [INFO ] Deduced a trap composed of 29 places in 708 ms of which 2 ms to minimize.
[2021-06-06 02:00:58] [INFO ] Deduced a trap composed of 28 places in 720 ms of which 2 ms to minimize.
[2021-06-06 02:00:59] [INFO ] Deduced a trap composed of 20 places in 716 ms of which 2 ms to minimize.
[2021-06-06 02:00:59] [INFO ] Deduced a trap composed of 33 places in 737 ms of which 1 ms to minimize.
[2021-06-06 02:01:00] [INFO ] Deduced a trap composed of 16 places in 695 ms of which 1 ms to minimize.
[2021-06-06 02:01:01] [INFO ] Deduced a trap composed of 28 places in 692 ms of which 1 ms to minimize.
[2021-06-06 02:01:02] [INFO ] Deduced a trap composed of 28 places in 694 ms of which 2 ms to minimize.
[2021-06-06 02:01:03] [INFO ] Deduced a trap composed of 26 places in 721 ms of which 1 ms to minimize.
[2021-06-06 02:01:03] [INFO ] Deduced a trap composed of 30 places in 671 ms of which 1 ms to minimize.
[2021-06-06 02:01:04] [INFO ] Deduced a trap composed of 26 places in 673 ms of which 1 ms to minimize.
[2021-06-06 02:01:05] [INFO ] Deduced a trap composed of 34 places in 685 ms of which 2 ms to minimize.
[2021-06-06 02:01:06] [INFO ] Deduced a trap composed of 19 places in 690 ms of which 2 ms to minimize.
[2021-06-06 02:01:07] [INFO ] Deduced a trap composed of 29 places in 696 ms of which 1 ms to minimize.
[2021-06-06 02:01:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
[2021-06-06 02:01:07] [INFO ] Initial state test concluded for 1 properties.
FORMULA ShieldPPPt-PT-050B-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 3357 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3357/3357 places, 3007/3007 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 703 transitions
Trivial Post-agglo rules discarded 703 transitions
Performed 703 trivial Post agglomeration. Transition count delta: 703
Iterating post reduction 0 with 703 rules applied. Total rules applied 703 place count 3356 transition count 2303
Reduce places removed 703 places and 0 transitions.
Iterating post reduction 1 with 703 rules applied. Total rules applied 1406 place count 2653 transition count 2303
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 396 Pre rules applied. Total rules applied 1406 place count 2653 transition count 1907
Deduced a syphon composed of 396 places in 4 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 2 with 792 rules applied. Total rules applied 2198 place count 2257 transition count 1907
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 2204 place count 2251 transition count 1901
Iterating global reduction 2 with 6 rules applied. Total rules applied 2210 place count 2251 transition count 1901
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2210 place count 2251 transition count 1897
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2218 place count 2247 transition count 1897
Performed 845 Post agglomeration using F-continuation condition.Transition count delta: 845
Deduced a syphon composed of 845 places in 4 ms
Reduce places removed 845 places and 0 transitions.
Iterating global reduction 2 with 1690 rules applied. Total rules applied 3908 place count 1402 transition count 1052
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3909 place count 1402 transition count 1051
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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3911 place count 1401 transition count 1050
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4113 place count 1300 transition count 1050
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 5 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4209 place count 1252 transition count 1050
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4210 place count 1251 transition count 1049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4211 place count 1250 transition count 1049
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4211 place count 1250 transition count 1047
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4215 place count 1248 transition count 1047
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4216 place count 1247 transition count 1046
Applied a total of 4216 rules in 1279 ms. Remains 1247 /3357 variables (removed 2110) and now considering 1046/3007 (removed 1961) transitions.
// Phase 1: matrix 1046 rows 1247 cols
[2021-06-06 02:01:08] [INFO ] Computed 550 place invariants in 3 ms
[2021-06-06 02:01:09] [INFO ] Implicit Places using invariants in 1026 ms returned [1230, 1234]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1029 ms to find 2 implicit places.
[2021-06-06 02:01:09] [INFO ] Redundant transitions in 65 ms returned []
// Phase 1: matrix 1046 rows 1245 cols
[2021-06-06 02:01:09] [INFO ] Computed 548 place invariants in 6 ms
[2021-06-06 02:01:10] [INFO ] Dead Transitions using invariants and state equation in 543 ms returned []
Starting structural reductions, iteration 1 : 1245/3357 places, 1046/3007 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1243 transition count 1044
Applied a total of 4 rules in 65 ms. Remains 1243 /1245 variables (removed 2) and now considering 1044/1046 (removed 2) transitions.
// Phase 1: matrix 1044 rows 1243 cols
[2021-06-06 02:01:10] [INFO ] Computed 548 place invariants in 3 ms
[2021-06-06 02:01:10] [INFO ] Implicit Places using invariants in 600 ms returned []
// Phase 1: matrix 1044 rows 1243 cols
[2021-06-06 02:01:10] [INFO ] Computed 548 place invariants in 5 ms
[2021-06-06 02:01:12] [INFO ] Implicit Places using invariants and state equation in 1280 ms returned []
Implicit Place search using SMT with State Equation took 1883 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1243/3357 places, 1044/3007 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1228 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 8412 reset in 996 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 1 ms.
FORMULA ShieldPPPt-PT-050B-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-00 finished in 6159 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (p1||(p2&&G(!p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 3357 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3357/3357 places, 3007/3007 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3351 transition count 3001
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3351 transition count 3001
Applied a total of 12 rules in 564 ms. Remains 3351 /3357 variables (removed 6) and now considering 3001/3007 (removed 6) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2021-06-06 02:01:13] [INFO ] Computed 551 place invariants in 13 ms
[2021-06-06 02:01:15] [INFO ] Implicit Places using invariants in 1253 ms returned []
// Phase 1: matrix 3001 rows 3351 cols
[2021-06-06 02:01:15] [INFO ] Computed 551 place invariants in 10 ms
[2021-06-06 02:01:18] [INFO ] Implicit Places using invariants and state equation in 3528 ms returned []
Implicit Place search using SMT with State Equation took 4792 ms to find 0 implicit places.
// Phase 1: matrix 3001 rows 3351 cols
[2021-06-06 02:01:18] [INFO ] Computed 551 place invariants in 12 ms
[2021-06-06 02:01:20] [INFO ] Dead Transitions using invariants and state equation in 2277 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3351/3357 places, 3001/3007 transitions.
Stuttering acceptance computed with spot in 179 ms :[p0, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), true]
Running random walk in product with property : ShieldPPPt-PT-050B-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (EQ s2107 0) (EQ s2403 1)), p1:(EQ s1485 1), p2:(EQ s1485 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 909 ms.
Product exploration explored 100000 steps with 0 reset in 1162 ms.
Knowledge obtained : [p0, (NOT p1), p2]
Stuttering acceptance computed with spot in 125 ms :[p0, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), true]
Product exploration explored 100000 steps with 0 reset in 873 ms.
Entered a terminal (fully accepting) state of product in 375 steps with 0 reset in 3 ms.
FORMULA ShieldPPPt-PT-050B-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-02 finished in 11172 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 3357 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3357/3357 places, 3007/3007 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3352 transition count 3002
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3352 transition count 3002
Applied a total of 10 rules in 568 ms. Remains 3352 /3357 variables (removed 5) and now considering 3002/3007 (removed 5) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2021-06-06 02:01:25] [INFO ] Computed 551 place invariants in 15 ms
[2021-06-06 02:01:26] [INFO ] Implicit Places using invariants in 1159 ms returned []
// Phase 1: matrix 3002 rows 3352 cols
[2021-06-06 02:01:26] [INFO ] Computed 551 place invariants in 11 ms
[2021-06-06 02:01:29] [INFO ] Implicit Places using invariants and state equation in 3561 ms returned []
Implicit Place search using SMT with State Equation took 4722 ms to find 0 implicit places.
// Phase 1: matrix 3002 rows 3352 cols
[2021-06-06 02:01:29] [INFO ] Computed 551 place invariants in 13 ms
[2021-06-06 02:01:31] [INFO ] Dead Transitions using invariants and state equation in 2159 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3352/3357 places, 3002/3007 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2604 0) (EQ s1502 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 902 ms.
Stack based approach found an accepted trace after 5692 steps with 0 reset with depth 5693 and stack size 5693 in 59 ms.
FORMULA ShieldPPPt-PT-050B-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-04 finished in 8551 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 3357 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3357/3357 places, 3007/3007 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 3356 transition count 2307
Reduce places removed 699 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 700 rules applied. Total rules applied 1399 place count 2657 transition count 2306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1400 place count 2656 transition count 2306
Performed 397 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 397 Pre rules applied. Total rules applied 1400 place count 2656 transition count 1909
Deduced a syphon composed of 397 places in 3 ms
Reduce places removed 397 places and 0 transitions.
Iterating global reduction 3 with 794 rules applied. Total rules applied 2194 place count 2259 transition count 1909
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 2198 place count 2255 transition count 1905
Iterating global reduction 3 with 4 rules applied. Total rules applied 2202 place count 2255 transition count 1905
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 2202 place count 2255 transition count 1902
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 2208 place count 2252 transition count 1902
Performed 844 Post agglomeration using F-continuation condition.Transition count delta: 844
Deduced a syphon composed of 844 places in 1 ms
Reduce places removed 844 places and 0 transitions.
Iterating global reduction 3 with 1688 rules applied. Total rules applied 3896 place count 1408 transition count 1058
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3897 place count 1408 transition count 1057
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3899 place count 1407 transition count 1056
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4101 place count 1306 transition count 1056
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4197 place count 1258 transition count 1056
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4198 place count 1257 transition count 1055
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4199 place count 1256 transition count 1055
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4199 place count 1256 transition count 1053
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4203 place count 1254 transition count 1053
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4204 place count 1253 transition count 1052
Applied a total of 4204 rules in 861 ms. Remains 1253 /3357 variables (removed 2104) and now considering 1052/3007 (removed 1955) transitions.
// Phase 1: matrix 1052 rows 1253 cols
[2021-06-06 02:01:33] [INFO ] Computed 550 place invariants in 4 ms
[2021-06-06 02:01:34] [INFO ] Implicit Places using invariants in 774 ms returned [1236, 1240]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 776 ms to find 2 implicit places.
[2021-06-06 02:01:34] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 1052 rows 1251 cols
[2021-06-06 02:01:34] [INFO ] Computed 548 place invariants in 2 ms
[2021-06-06 02:01:35] [INFO ] Dead Transitions using invariants and state equation in 566 ms returned []
Starting structural reductions, iteration 1 : 1251/3357 places, 1052/3007 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1249 transition count 1050
Applied a total of 4 rules in 56 ms. Remains 1249 /1251 variables (removed 2) and now considering 1050/1052 (removed 2) transitions.
// Phase 1: matrix 1050 rows 1249 cols
[2021-06-06 02:01:35] [INFO ] Computed 548 place invariants in 4 ms
[2021-06-06 02:01:35] [INFO ] Implicit Places using invariants in 601 ms returned []
// Phase 1: matrix 1050 rows 1249 cols
[2021-06-06 02:01:35] [INFO ] Computed 548 place invariants in 5 ms
[2021-06-06 02:01:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2021-06-06 02:01:37] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 2096 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1249/3357 places, 1050/3007 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050B-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s398 0) (EQ s976 1)), p1:(OR (EQ s130 0) (EQ s925 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 808 ms.
Stack based approach found an accepted trace after 62 steps with 0 reset with depth 63 and stack size 63 in 1 ms.
FORMULA ShieldPPPt-PT-050B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-05 finished in 5314 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&X(X(G((p1&&X(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 3357 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3357/3357 places, 3007/3007 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3351 transition count 3001
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3351 transition count 3001
Applied a total of 12 rules in 564 ms. Remains 3351 /3357 variables (removed 6) and now considering 3001/3007 (removed 6) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2021-06-06 02:01:38] [INFO ] Computed 551 place invariants in 9 ms
[2021-06-06 02:01:40] [INFO ] Implicit Places using invariants in 1226 ms returned []
// Phase 1: matrix 3001 rows 3351 cols
[2021-06-06 02:01:40] [INFO ] Computed 551 place invariants in 9 ms
[2021-06-06 02:01:43] [INFO ] Implicit Places using invariants and state equation in 3606 ms returned []
Implicit Place search using SMT with State Equation took 4833 ms to find 0 implicit places.
// Phase 1: matrix 3001 rows 3351 cols
[2021-06-06 02:01:43] [INFO ] Computed 551 place invariants in 10 ms
[2021-06-06 02:01:46] [INFO ] Dead Transitions using invariants and state equation in 2321 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3351/3357 places, 3001/3007 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true]
Running random walk in product with property : ShieldPPPt-PT-050B-06 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 5}, { cond=(NOT p0), acceptance={} source=0 dest: 6}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=3, aps=[p0:(EQ s1497 1), p1:(OR (NEQ s3213 0) (NEQ s2811 1)), p2:(AND (NEQ s1172 0) (NEQ s704 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-050B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-06 finished in 7986 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 3357 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3357/3357 places, 3007/3007 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 3356 transition count 2305
Reduce places removed 701 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 703 rules applied. Total rules applied 1404 place count 2655 transition count 2303
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1406 place count 2653 transition count 2303
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 395 Pre rules applied. Total rules applied 1406 place count 2653 transition count 1908
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 3 with 790 rules applied. Total rules applied 2196 place count 2258 transition count 1908
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2202 place count 2252 transition count 1902
Iterating global reduction 3 with 6 rules applied. Total rules applied 2208 place count 2252 transition count 1902
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 2208 place count 2252 transition count 1898
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 2216 place count 2248 transition count 1898
Performed 844 Post agglomeration using F-continuation condition.Transition count delta: 844
Deduced a syphon composed of 844 places in 1 ms
Reduce places removed 844 places and 0 transitions.
Iterating global reduction 3 with 1688 rules applied. Total rules applied 3904 place count 1404 transition count 1054
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3905 place count 1404 transition count 1053
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3907 place count 1403 transition count 1052
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4109 place count 1302 transition count 1052
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4205 place count 1254 transition count 1052
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4206 place count 1253 transition count 1051
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4207 place count 1252 transition count 1051
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4207 place count 1252 transition count 1049
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4211 place count 1250 transition count 1049
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4212 place count 1249 transition count 1048
Applied a total of 4212 rules in 724 ms. Remains 1249 /3357 variables (removed 2108) and now considering 1048/3007 (removed 1959) transitions.
// Phase 1: matrix 1048 rows 1249 cols
[2021-06-06 02:01:47] [INFO ] Computed 550 place invariants in 3 ms
[2021-06-06 02:01:47] [INFO ] Implicit Places using invariants in 665 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 666 ms to find 2 implicit places.
[2021-06-06 02:01:47] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 1048 rows 1247 cols
[2021-06-06 02:01:47] [INFO ] Computed 548 place invariants in 2 ms
[2021-06-06 02:01:48] [INFO ] Dead Transitions using invariants and state equation in 575 ms returned []
Starting structural reductions, iteration 1 : 1247/3357 places, 1048/3007 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 53 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2021-06-06 02:01:48] [INFO ] Computed 548 place invariants in 2 ms
[2021-06-06 02:01:49] [INFO ] Implicit Places using invariants in 676 ms returned []
// Phase 1: matrix 1046 rows 1245 cols
[2021-06-06 02:01:49] [INFO ] Computed 548 place invariants in 3 ms
[2021-06-06 02:01:50] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned []
Implicit Place search using SMT with State Equation took 2102 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1245/3357 places, 1046/3007 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-07 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 s223 0) (EQ s1063 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 843 ms.
Product exploration explored 100000 steps with 0 reset in 1171 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 830 ms.
Product exploration explored 100000 steps with 0 reset in 1150 ms.
[2021-06-06 02:01:54] [INFO ] Flatten gal took : 93 ms
[2021-06-06 02:01:55] [INFO ] Flatten gal took : 85 ms
[2021-06-06 02:01:55] [INFO ] Time to serialize gal into /tmp/LTL697028601926612184.gal : 26 ms
[2021-06-06 02:01:55] [INFO ] Time to serialize properties into /tmp/LTL7763163551026823055.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/LTL697028601926612184.gal, -t, CGAL, -LTL, /tmp/LTL7763163551026823055.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/LTL697028601926612184.gal -t CGAL -LTL /tmp/LTL7763163551026823055.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("((p718==0)||(p3309==1))"))))
Formula 0 simplified : !FG"((p718==0)||(p3309==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 3.73747e+82 deadlock states
Detected timeout of ITS tools.
[2021-06-06 02:02:10] [INFO ] Flatten gal took : 36 ms
[2021-06-06 02:02:10] [INFO ] Applying decomposition
[2021-06-06 02:02:10] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3036910937330301732.txt, -o, /tmp/graph3036910937330301732.bin, -w, /tmp/graph3036910937330301732.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/graph3036910937330301732.bin, -l, -1, -v, -w, /tmp/graph3036910937330301732.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-06 02:02:10] [INFO ] Decomposing Gal with order
[2021-06-06 02:02:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 02:02:10] [INFO ] Removed a total of 305 redundant transitions.
[2021-06-06 02:02:10] [INFO ] Flatten gal took : 111 ms
[2021-06-06 02:02:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 298 labels/synchronizations in 20 ms.
[2021-06-06 02:02:10] [INFO ] Time to serialize gal into /tmp/LTL14124975995218118954.gal : 16 ms
[2021-06-06 02:02:10] [INFO ] Time to serialize properties into /tmp/LTL18210213753421044783.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/LTL14124975995218118954.gal, -t, CGAL, -LTL, /tmp/LTL18210213753421044783.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/LTL14124975995218118954.gal -t CGAL -LTL /tmp/LTL18210213753421044783.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("((i5.u73.p718==0)||(i23.i1.i0.u342.p3309==1))"))))
Formula 0 simplified : !FG"((i5.u73.p718==0)||(i23.i1.i0.u342.p3309==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 3.73747e+82 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14219494523339348855
[2021-06-06 02:02:25] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14219494523339348855
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/ltsmin14219494523339348855]
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/ltsmin14219494523339348855] 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/ltsmin14219494523339348855] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldPPPt-PT-050B-07 finished in 40466 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 3357 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3357/3357 places, 3007/3007 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3351 transition count 3001
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3351 transition count 3001
Applied a total of 12 rules in 561 ms. Remains 3351 /3357 variables (removed 6) and now considering 3001/3007 (removed 6) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2021-06-06 02:02:27] [INFO ] Computed 551 place invariants in 13 ms
[2021-06-06 02:02:28] [INFO ] Implicit Places using invariants in 1245 ms returned []
// Phase 1: matrix 3001 rows 3351 cols
[2021-06-06 02:02:28] [INFO ] Computed 551 place invariants in 8 ms
[2021-06-06 02:02:32] [INFO ] Implicit Places using invariants and state equation in 3477 ms returned []
Implicit Place search using SMT with State Equation took 4725 ms to find 0 implicit places.
// Phase 1: matrix 3001 rows 3351 cols
[2021-06-06 02:02:32] [INFO ] Computed 551 place invariants in 8 ms
[2021-06-06 02:02:34] [INFO ] Dead Transitions using invariants and state equation in 2301 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3351/3357 places, 3001/3007 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-050B-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s2701 0) (NEQ s59 1)), p1:(AND (EQ s59 0) (EQ s2701 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 332 reset in 436 ms.
Product exploration explored 100000 steps with 340 reset in 456 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 348 reset in 417 ms.
Product exploration explored 100000 steps with 340 reset in 433 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 3351 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Performed 700 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3351 transition count 3001
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 250 Pre rules applied. Total rules applied 700 place count 3351 transition count 3201
Deduced a syphon composed of 950 places in 6 ms
Iterating global reduction 1 with 250 rules applied. Total rules applied 950 place count 3351 transition count 3201
Performed 946 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1896 places in 7 ms
Iterating global reduction 1 with 946 rules applied. Total rules applied 1896 place count 3351 transition count 3201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1897 place count 3351 transition count 3200
Renaming transitions due to excessive name length > 1024 char.
Discarding 352 places :
Symmetric choice reduction at 2 with 352 rule applications. Total rules 2249 place count 2999 transition count 2848
Deduced a syphon composed of 1544 places in 6 ms
Iterating global reduction 2 with 352 rules applied. Total rules applied 2601 place count 2999 transition count 2848
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1545 places in 5 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2602 place count 2999 transition count 2848
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2604 place count 2997 transition count 2846
Deduced a syphon composed of 1543 places in 5 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2606 place count 2997 transition count 2846
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 1644 places in 6 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2707 place count 2997 transition count 3276
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2808 place count 2896 transition count 3074
Deduced a syphon composed of 1543 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2909 place count 2896 transition count 3074
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -415
Deduced a syphon composed of 1641 places in 4 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 3007 place count 2896 transition count 3489
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 3105 place count 2798 transition count 3293
Deduced a syphon composed of 1543 places in 3 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 3203 place count 2798 transition count 3293
Deduced a syphon composed of 1543 places in 3 ms
Applied a total of 3203 rules in 2312 ms. Remains 2798 /3351 variables (removed 553) and now considering 3293/3001 (removed -292) transitions.
[2021-06-06 02:02:39] [INFO ] Redundant transitions in 81 ms returned []
// Phase 1: matrix 3293 rows 2798 cols
[2021-06-06 02:02:39] [INFO ] Computed 551 place invariants in 25 ms
[2021-06-06 02:02:41] [INFO ] Dead Transitions using invariants and state equation in 2092 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2798/3351 places, 3293/3001 transitions.
Product exploration explored 100000 steps with 9837 reset in 3633 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 4 in 0 ms.
FORMULA ShieldPPPt-PT-050B-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-12 finished in 18087 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 3357 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3357/3357 places, 3007/3007 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3352 transition count 3002
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3352 transition count 3002
Applied a total of 10 rules in 480 ms. Remains 3352 /3357 variables (removed 5) and now considering 3002/3007 (removed 5) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2021-06-06 02:02:45] [INFO ] Computed 551 place invariants in 21 ms
[2021-06-06 02:02:46] [INFO ] Implicit Places using invariants in 1155 ms returned []
// Phase 1: matrix 3002 rows 3352 cols
[2021-06-06 02:02:46] [INFO ] Computed 551 place invariants in 15 ms
[2021-06-06 02:02:50] [INFO ] Implicit Places using invariants and state equation in 3594 ms returned []
Implicit Place search using SMT with State Equation took 4751 ms to find 0 implicit places.
// Phase 1: matrix 3002 rows 3352 cols
[2021-06-06 02:02:50] [INFO ] Computed 551 place invariants in 7 ms
[2021-06-06 02:02:52] [INFO ] Dead Transitions using invariants and state equation in 2416 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3352/3357 places, 3002/3007 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-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 s699 0)], 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]]
Product exploration explored 100000 steps with 0 reset in 856 ms.
Product exploration explored 100000 steps with 0 reset in 1153 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 847 ms.
Product exploration explored 100000 steps with 0 reset in 1183 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 3352 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3352/3352 places, 3002/3002 transitions.
Performed 700 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3352 transition count 3002
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 249 Pre rules applied. Total rules applied 700 place count 3352 transition count 3201
Deduced a syphon composed of 949 places in 7 ms
Iterating global reduction 1 with 249 rules applied. Total rules applied 949 place count 3352 transition count 3201
Performed 951 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1900 places in 6 ms
Iterating global reduction 1 with 951 rules applied. Total rules applied 1900 place count 3352 transition count 3201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1901 place count 3352 transition count 3200
Renaming transitions due to excessive name length > 1024 char.
Discarding 353 places :
Symmetric choice reduction at 2 with 353 rule applications. Total rules 2254 place count 2999 transition count 2847
Deduced a syphon composed of 1547 places in 6 ms
Iterating global reduction 2 with 353 rules applied. Total rules applied 2607 place count 2999 transition count 2847
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1548 places in 5 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2608 place count 2999 transition count 2847
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2610 place count 2997 transition count 2845
Deduced a syphon composed of 1546 places in 5 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2612 place count 2997 transition count 2845
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -428
Deduced a syphon composed of 1647 places in 11 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2713 place count 2997 transition count 3273
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2814 place count 2896 transition count 3071
Deduced a syphon composed of 1546 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2915 place count 2896 transition count 3071
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -415
Deduced a syphon composed of 1644 places in 4 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 3013 place count 2896 transition count 3486
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 3111 place count 2798 transition count 3290
Deduced a syphon composed of 1546 places in 3 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 3209 place count 2798 transition count 3290
Deduced a syphon composed of 1546 places in 3 ms
Applied a total of 3209 rules in 1556 ms. Remains 2798 /3352 variables (removed 554) and now considering 3290/3002 (removed -288) transitions.
[2021-06-06 02:02:58] [INFO ] Redundant transitions in 74 ms returned []
// Phase 1: matrix 3290 rows 2798 cols
[2021-06-06 02:02:58] [INFO ] Computed 551 place invariants in 33 ms
[2021-06-06 02:03:00] [INFO ] Dead Transitions using invariants and state equation in 2108 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2798/3352 places, 3290/3002 transitions.
Product exploration explored 100000 steps with 0 reset in 913 ms.
Product exploration explored 100000 steps with 0 reset in 1164 ms.
[2021-06-06 02:03:03] [INFO ] Flatten gal took : 81 ms
[2021-06-06 02:03:03] [INFO ] Flatten gal took : 109 ms
[2021-06-06 02:03:03] [INFO ] Time to serialize gal into /tmp/LTL1801428610177637841.gal : 12 ms
[2021-06-06 02:03:03] [INFO ] Time to serialize properties into /tmp/LTL13966847244452729358.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/LTL1801428610177637841.gal, -t, CGAL, -LTL, /tmp/LTL13966847244452729358.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/LTL1801428610177637841.gal -t CGAL -LTL /tmp/LTL13966847244452729358.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(p803==0)")))))
Formula 0 simplified : !XXG"(p803==0)"
Detected timeout of ITS tools.
[2021-06-06 02:03:18] [INFO ] Flatten gal took : 79 ms
[2021-06-06 02:03:18] [INFO ] Applying decomposition
[2021-06-06 02:03:18] [INFO ] Flatten gal took : 89 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/graph5703407631548823585.txt, -o, /tmp/graph5703407631548823585.bin, -w, /tmp/graph5703407631548823585.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/graph5703407631548823585.bin, -l, -1, -v, -w, /tmp/graph5703407631548823585.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-06 02:03:18] [INFO ] Decomposing Gal with order
[2021-06-06 02:03:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 02:03:19] [INFO ] Removed a total of 494 redundant transitions.
[2021-06-06 02:03:19] [INFO ] Flatten gal took : 173 ms
[2021-06-06 02:03:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2021-06-06 02:03:19] [INFO ] Time to serialize gal into /tmp/LTL18303670660927670745.gal : 27 ms
[2021-06-06 02:03:19] [INFO ] Time to serialize properties into /tmp/LTL10753866129008198757.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/LTL18303670660927670745.gal, -t, CGAL, -LTL, /tmp/LTL10753866129008198757.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/LTL18303670660927670745.gal -t CGAL -LTL /tmp/LTL10753866129008198757.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(i11.i1.i2.u257.p803==0)")))))
Formula 0 simplified : !XXG"(i11.i1.i2.u257.p803==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6051506052699301863
[2021-06-06 02:03:34] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6051506052699301863
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/ltsmin6051506052699301863]
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/ltsmin6051506052699301863] 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/ltsmin6051506052699301863] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldPPPt-PT-050B-13 finished in 50525 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15830231568419486793
[2021-06-06 02:03:35] [INFO ] Too many transitions (3007) to apply POR reductions. Disabling POR matrices.
[2021-06-06 02:03:35] [INFO ] Applying decomposition
[2021-06-06 02:03:35] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15830231568419486793
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/ltsmin15830231568419486793]
[2021-06-06 02:03:35] [INFO ] Flatten gal took : 89 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/graph1093758315367136714.txt, -o, /tmp/graph1093758315367136714.bin, -w, /tmp/graph1093758315367136714.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/graph1093758315367136714.bin, -l, -1, -v, -w, /tmp/graph1093758315367136714.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-06 02:03:35] [INFO ] Decomposing Gal with order
[2021-06-06 02:03:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 02:03:36] [INFO ] Removed a total of 495 redundant transitions.
[2021-06-06 02:03:36] [INFO ] Flatten gal took : 167 ms
[2021-06-06 02:03:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2021-06-06 02:03:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality9192259164942647774.gal : 38 ms
[2021-06-06 02:03:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality6933388103133937242.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/LTLCardinality9192259164942647774.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6933388103133937242.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/LTLCardinality9192259164942647774.gal -t CGAL -LTL /tmp/LTLCardinality6933388103133937242.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((F(G("((i1.i0.i3.u223.p718==0)||(i43.i1.i0.u1022.p3309==1))"))))
Formula 0 simplified : !FG"((i1.i0.i3.u223.p718==0)||(i43.i1.i0.u1022.p3309==1))"
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/ltsmin15830231568419486793] killed by timeout after 40 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/ltsmin15830231568419486793] killed by timeout after 40 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-06-06 02:25:43] [INFO ] Applying decomposition
[2021-06-06 02:25:43] [INFO ] Flatten gal took : 509 ms
[2021-06-06 02:25:44] [INFO ] Decomposing Gal with order
[2021-06-06 02:25:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 02:25:46] [INFO ] Removed a total of 150 redundant transitions.
[2021-06-06 02:25:46] [INFO ] Flatten gal took : 767 ms
[2021-06-06 02:25:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 598 labels/synchronizations in 465 ms.
[2021-06-06 02:25:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality7970523962263354511.gal : 108 ms
[2021-06-06 02:25:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality2186828047076579810.ltl : 5 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/LTLCardinality7970523962263354511.gal, -t, CGAL, -LTL, /tmp/LTLCardinality2186828047076579810.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/LTLCardinality7970523962263354511.gal -t CGAL -LTL /tmp/LTLCardinality2186828047076579810.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((F(G("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u237.p718==0)||(i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u945.p3309==1))"))))
Formula 0 simplified : !FG"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u237.p718==0)||(i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u945.p3309==1))"
Detected timeout of ITS tools.
[2021-06-06 02:47:50] [INFO ] Flatten gal took : 681 ms
[2021-06-06 02:47:51] [INFO ] Input system was already deterministic with 3007 transitions.
[2021-06-06 02:47:51] [INFO ] Transformed 3357 places.
[2021-06-06 02:47:51] [INFO ] Transformed 3007 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-06-06 02:47:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality17302114023879627202.gal : 14 ms
[2021-06-06 02:47:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality10083394045123081166.ltl : 4 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/LTLCardinality17302114023879627202.gal, -t, CGAL, -LTL, /tmp/LTLCardinality10083394045123081166.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality17302114023879627202.gal -t CGAL -LTL /tmp/LTLCardinality10083394045123081166.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((p718==0)||(p3309==1))"))))
Formula 0 simplified : !FG"((p718==0)||(p3309==1))"

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="ShieldPPPt-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 ShieldPPPt-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 r216-tall-162098205800903"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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