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.r007-tall-162037989500122.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ASLink-PT-08a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989500122
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 01:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 01:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 757K May 5 16:51 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 ASLink-PT-08a-00
FORMULA_NAME ASLink-PT-08a-01
FORMULA_NAME ASLink-PT-08a-02
FORMULA_NAME ASLink-PT-08a-03
FORMULA_NAME ASLink-PT-08a-04
FORMULA_NAME ASLink-PT-08a-05
FORMULA_NAME ASLink-PT-08a-06
FORMULA_NAME ASLink-PT-08a-07
FORMULA_NAME ASLink-PT-08a-08
FORMULA_NAME ASLink-PT-08a-09
FORMULA_NAME ASLink-PT-08a-10
FORMULA_NAME ASLink-PT-08a-11
FORMULA_NAME ASLink-PT-08a-12
FORMULA_NAME ASLink-PT-08a-13
FORMULA_NAME ASLink-PT-08a-14
FORMULA_NAME ASLink-PT-08a-15

=== Now, execution of the tool begins

BK_START 1620429233941

Running Version 0
[2021-05-07 23:13:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-07 23:13:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 23:13:58] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2021-05-07 23:13:58] [INFO ] Transformed 1796 places.
[2021-05-07 23:13:58] [INFO ] Transformed 2646 transitions.
[2021-05-07 23:13:58] [INFO ] Found NUPN structural information;
[2021-05-07 23:13:58] [INFO ] Parsed PT model containing 1796 places and 2646 transitions in 292 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 52 ms.
Working with output stream class java.io.PrintStream
[2021-05-07 23:13:58] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Support contains 66 out of 1796 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1796/1796 places, 2618/2618 transitions.
Ensure Unique test removed 31 places
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 1749 transition count 2618
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 1739 transition count 2575
Ensure Unique test removed 1 places
Iterating global reduction 1 with 11 rules applied. Total rules applied 68 place count 1738 transition count 2575
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 70 place count 1738 transition count 2573
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 1737 transition count 2565
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 1737 transition count 2565
Applied a total of 72 rules in 535 ms. Remains 1737 /1796 variables (removed 59) and now considering 2565/2618 (removed 53) transitions.
// Phase 1: matrix 2565 rows 1737 cols
[2021-05-07 23:13:59] [INFO ] Computed 298 place invariants in 279 ms
[2021-05-07 23:14:01] [INFO ] Implicit Places using invariants in 1907 ms returned [1, 19, 20, 23, 33, 51, 69, 199, 215, 220, 221, 222, 240, 258, 387, 403, 408, 410, 428, 446, 575, 591, 596, 597, 617, 635, 764, 780, 785, 786, 806, 953, 969, 974, 975, 976, 994, 1012, 1141, 1157, 1162, 1163, 1183, 1201, 1330, 1346, 1352, 1353, 1371, 1389, 1518, 1523, 1535, 1540, 1541, 1542, 1575, 1577, 1580, 1598, 1600, 1601, 1618, 1626, 1634, 1640, 1646, 1652, 1658, 1666, 1672, 1686]
Discarding 72 places :
Implicit Place search using SMT only with invariants took 1935 ms to find 72 implicit places.
// Phase 1: matrix 2565 rows 1665 cols
[2021-05-07 23:14:01] [INFO ] Computed 226 place invariants in 179 ms
[2021-05-07 23:14:02] [INFO ] Dead Transitions using invariants and state equation in 1405 ms returned []
Starting structural reductions, iteration 1 : 1665/1796 places, 2565/2618 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1654 transition count 2554
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1654 transition count 2554
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 1647 transition count 2547
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 1647 transition count 2547
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 1645 transition count 2545
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 1645 transition count 2545
Applied a total of 40 rules in 244 ms. Remains 1645 /1665 variables (removed 20) and now considering 2545/2565 (removed 20) transitions.
// Phase 1: matrix 2545 rows 1645 cols
[2021-05-07 23:14:03] [INFO ] Computed 226 place invariants in 73 ms
[2021-05-07 23:14:03] [INFO ] Implicit Places using invariants in 776 ms returned []
// Phase 1: matrix 2545 rows 1645 cols
[2021-05-07 23:14:03] [INFO ] Computed 226 place invariants in 28 ms
[2021-05-07 23:14:06] [INFO ] Implicit Places using invariants and state equation in 2694 ms returned []
Implicit Place search using SMT with State Equation took 3474 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1645/1796 places, 2545/2618 transitions.
[2021-05-07 23:14:06] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-07 23:14:06] [INFO ] Flatten gal took : 214 ms
FORMULA ASLink-PT-08a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-07 23:14:07] [INFO ] Flatten gal took : 146 ms
[2021-05-07 23:14:07] [INFO ] Input system was already deterministic with 2545 transitions.
Incomplete random walk after 100000 steps, including 467 resets, run finished after 703 ms. (steps per millisecond=142 ) properties (out of 26) seen :9
Running SMT prover for 17 properties.
// Phase 1: matrix 2545 rows 1645 cols
[2021-05-07 23:14:08] [INFO ] Computed 226 place invariants in 28 ms
[2021-05-07 23:14:08] [INFO ] [Real]Absence check using 42 positive place invariants in 24 ms returned sat
[2021-05-07 23:14:08] [INFO ] [Real]Absence check using 42 positive and 184 generalized place invariants in 43 ms returned sat
[2021-05-07 23:14:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:14:09] [INFO ] [Real]Absence check using state equation in 971 ms returned sat
[2021-05-07 23:14:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:14:09] [INFO ] [Nat]Absence check using 42 positive place invariants in 24 ms returned sat
[2021-05-07 23:14:09] [INFO ] [Nat]Absence check using 42 positive and 184 generalized place invariants in 41 ms returned sat
[2021-05-07 23:14:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:14:10] [INFO ] [Nat]Absence check using state equation in 1056 ms returned sat
[2021-05-07 23:14:11] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 4 ms to minimize.
[2021-05-07 23:14:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 416 ms
[2021-05-07 23:14:11] [INFO ] Computed and/alt/rep : 1097/2703/1097 causal constraints (skipped 1447 transitions) in 190 ms.
[2021-05-07 23:14:30] [INFO ] Deduced a trap composed of 5 places in 763 ms of which 2 ms to minimize.
[2021-05-07 23:14:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-07 23:14:30] [INFO ] [Real]Absence check using 42 positive place invariants in 23 ms returned sat
[2021-05-07 23:14:30] [INFO ] [Real]Absence check using 42 positive and 184 generalized place invariants in 41 ms returned sat
[2021-05-07 23:14:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:14:31] [INFO ] [Real]Absence check using state equation in 1041 ms returned sat
[2021-05-07 23:14:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:14:31] [INFO ] [Nat]Absence check using 42 positive place invariants in 23 ms returned sat
[2021-05-07 23:14:31] [INFO ] [Nat]Absence check using 42 positive and 184 generalized place invariants in 45 ms returned sat
[2021-05-07 23:14:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:14:38] [INFO ] [Nat]Absence check using state equation in 6474 ms returned unknown
[2021-05-07 23:14:38] [INFO ] [Real]Absence check using 42 positive place invariants in 21 ms returned sat
[2021-05-07 23:14:38] [INFO ] [Real]Absence check using 42 positive and 184 generalized place invariants in 40 ms returned sat
[2021-05-07 23:14:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:14:39] [INFO ] [Real]Absence check using state equation in 850 ms returned sat
[2021-05-07 23:14:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:14:39] [INFO ] [Nat]Absence check using 42 positive place invariants in 23 ms returned sat
[2021-05-07 23:14:39] [INFO ] [Nat]Absence check using 42 positive and 184 generalized place invariants in 40 ms returned sat
[2021-05-07 23:14:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:14:42] [INFO ] [Nat]Absence check using state equation in 3182 ms returned unsat
[2021-05-07 23:14:42] [INFO ] [Real]Absence check using 42 positive place invariants in 22 ms returned sat
[2021-05-07 23:14:42] [INFO ] [Real]Absence check using 42 positive and 184 generalized place invariants in 24 ms returned unsat
[2021-05-07 23:14:43] [INFO ] [Real]Absence check using 42 positive place invariants in 22 ms returned sat
[2021-05-07 23:14:43] [INFO ] [Real]Absence check using 42 positive and 184 generalized place invariants in 42 ms returned sat
[2021-05-07 23:14:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:14:44] [INFO ] [Real]Absence check using state equation in 1067 ms returned sat
[2021-05-07 23:14:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:14:44] [INFO ] [Nat]Absence check using 42 positive place invariants in 23 ms returned sat
[2021-05-07 23:14:44] [INFO ] [Nat]Absence check using 42 positive and 184 generalized place invariants in 40 ms returned sat
[2021-05-07 23:14:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:14:45] [INFO ] [Nat]Absence check using state equation in 1028 ms returned sat
[2021-05-07 23:14:45] [INFO ] Computed and/alt/rep : 1097/2703/1097 causal constraints (skipped 1447 transitions) in 159 ms.
[2021-05-07 23:15:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2021-05-07 23:15:04] [INFO ] [Real]Absence check using 42 positive place invariants in 22 ms returned sat
[2021-05-07 23:15:04] [INFO ] [Real]Absence check using 42 positive and 184 generalized place invariants in 42 ms returned sat
[2021-05-07 23:15:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:15:05] [INFO ] [Real]Absence check using state equation in 1050 ms returned sat
[2021-05-07 23:15:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:15:05] [INFO ] [Nat]Absence check using 42 positive place invariants in 23 ms returned sat
[2021-05-07 23:15:05] [INFO ] [Nat]Absence check using 42 positive and 184 generalized place invariants in 42 ms returned sat
[2021-05-07 23:15:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:15:13] [INFO ] [Nat]Absence check using state equation in 7343 ms returned unknown
[2021-05-07 23:15:13] [INFO ] [Real]Absence check using 42 positive place invariants in 22 ms returned sat
[2021-05-07 23:15:13] [INFO ] [Real]Absence check using 42 positive and 184 generalized place invariants in 40 ms returned sat
[2021-05-07 23:15:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:15:14] [INFO ] [Real]Absence check using state equation in 973 ms returned sat
[2021-05-07 23:15:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:15:14] [INFO ] [Nat]Absence check using 42 positive place invariants in 22 ms returned sat
[2021-05-07 23:15:14] [INFO ] [Nat]Absence check using 42 positive and 184 generalized place invariants in 39 ms returned sat
[2021-05-07 23:15:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:15:16] [INFO ] [Nat]Absence check using state equation in 1957 ms returned unsat
[2021-05-07 23:15:16] [INFO ] [Real]Absence check using 42 positive place invariants in 22 ms returned sat
[2021-05-07 23:15:16] [INFO ] [Real]Absence check using 42 positive and 184 generalized place invariants in 41 ms returned sat
[2021-05-07 23:15:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:15:17] [INFO ] [Real]Absence check using state equation in 972 ms returned sat
[2021-05-07 23:15:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:15:18] [INFO ] [Nat]Absence check using 42 positive place invariants in 26 ms returned sat
[2021-05-07 23:15:18] [INFO ] [Nat]Absence check using 42 positive and 184 generalized place invariants in 40 ms returned sat
[2021-05-07 23:15:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:15:19] [INFO ] [Nat]Absence check using state equation in 1291 ms returned sat
[2021-05-07 23:15:19] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 1 ms to minimize.
[2021-05-07 23:15:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 279 ms
[2021-05-07 23:15:19] [INFO ] [Real]Absence check using 42 positive place invariants in 22 ms returned sat
[2021-05-07 23:15:19] [INFO ] [Real]Absence check using 42 positive and 184 generalized place invariants in 40 ms returned sat
[2021-05-07 23:15:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:15:20] [INFO ] [Real]Absence check using state equation in 975 ms returned sat
[2021-05-07 23:15:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:15:21] [INFO ] [Nat]Absence check using 42 positive place invariants in 23 ms returned sat
[2021-05-07 23:15:21] [INFO ] [Nat]Absence check using 42 positive and 184 generalized place invariants in 40 ms returned sat
[2021-05-07 23:15:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:15:27] [INFO ] [Nat]Absence check using state equation in 6408 ms returned unknown
[2021-05-07 23:15:27] [INFO ] [Real]Absence check using 42 positive place invariants in 22 ms returned sat
[2021-05-07 23:15:27] [INFO ] [Real]Absence check using 42 positive and 184 generalized place invariants in 40 ms returned sat
[2021-05-07 23:15:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:15:28] [INFO ] [Real]Absence check using state equation in 1166 ms returned sat
[2021-05-07 23:15:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:15:29] [INFO ] [Nat]Absence check using 42 positive place invariants in 23 ms returned sat
[2021-05-07 23:15:29] [INFO ] [Nat]Absence check using 42 positive and 184 generalized place invariants in 40 ms returned sat
[2021-05-07 23:15:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:15:30] [INFO ] [Nat]Absence check using state equation in 1701 ms returned unsat
[2021-05-07 23:15:31] [INFO ] [Real]Absence check using 42 positive place invariants in 22 ms returned sat
[2021-05-07 23:15:31] [INFO ] [Real]Absence check using 42 positive and 184 generalized place invariants in 41 ms returned sat
[2021-05-07 23:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:15:32] [INFO ] [Real]Absence check using state equation in 993 ms returned sat
[2021-05-07 23:15:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:15:32] [INFO ] [Nat]Absence check using 42 positive place invariants in 22 ms returned sat
[2021-05-07 23:15:32] [INFO ] [Nat]Absence check using 42 positive and 184 generalized place invariants in 39 ms returned sat
[2021-05-07 23:15:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:15:34] [INFO ] [Nat]Absence check using state equation in 1750 ms returned unsat
[2021-05-07 23:15:34] [INFO ] [Real]Absence check using 42 positive place invariants in 21 ms returned sat
[2021-05-07 23:15:34] [INFO ] [Real]Absence check using 42 positive and 184 generalized place invariants in 41 ms returned sat
[2021-05-07 23:15:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:15:35] [INFO ] [Real]Absence check using state equation in 868 ms returned sat
[2021-05-07 23:15:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:15:35] [INFO ] [Nat]Absence check using 42 positive place invariants in 22 ms returned sat
[2021-05-07 23:15:35] [INFO ] [Nat]Absence check using 42 positive and 184 generalized place invariants in 41 ms returned sat
[2021-05-07 23:15:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:15:37] [INFO ] [Nat]Absence check using state equation in 1440 ms returned sat
[2021-05-07 23:15:37] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 1 ms to minimize.
[2021-05-07 23:15:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2021-05-07 23:15:37] [INFO ] Computed and/alt/rep : 1097/2703/1097 causal constraints (skipped 1447 transitions) in 132 ms.
[2021-05-07 23:15:56] [INFO ] Deduced a trap composed of 5 places in 776 ms of which 1 ms to minimize.
[2021-05-07 23:15:56] [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 11
[2021-05-07 23:15:56] [INFO ] [Real]Absence check using 42 positive place invariants in 20 ms returned sat
[2021-05-07 23:15:56] [INFO ] [Real]Absence check using 42 positive and 184 generalized place invariants in 40 ms returned sat
[2021-05-07 23:15:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:15:57] [INFO ] [Real]Absence check using state equation in 995 ms returned sat
[2021-05-07 23:15:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:15:57] [INFO ] [Nat]Absence check using 42 positive place invariants in 21 ms returned sat
[2021-05-07 23:15:57] [INFO ] [Nat]Absence check using 42 positive and 184 generalized place invariants in 39 ms returned sat
[2021-05-07 23:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:15:58] [INFO ] [Nat]Absence check using state equation in 1188 ms returned sat
[2021-05-07 23:15:59] [INFO ] Computed and/alt/rep : 1097/2703/1097 causal constraints (skipped 1447 transitions) in 138 ms.
[2021-05-07 23:16:18] [INFO ] Deduced a trap composed of 5 places in 775 ms of which 2 ms to minimize.
[2021-05-07 23:16:18] [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 12
[2021-05-07 23:16:18] [INFO ] [Real]Absence check using 42 positive place invariants in 21 ms returned sat
[2021-05-07 23:16:18] [INFO ] [Real]Absence check using 42 positive and 184 generalized place invariants in 41 ms returned sat
[2021-05-07 23:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:16:19] [INFO ] [Real]Absence check using state equation in 891 ms returned sat
[2021-05-07 23:16:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:16:19] [INFO ] [Nat]Absence check using 42 positive place invariants in 24 ms returned sat
[2021-05-07 23:16:19] [INFO ] [Nat]Absence check using 42 positive and 184 generalized place invariants in 41 ms returned sat
[2021-05-07 23:16:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:16:25] [INFO ] [Nat]Absence check using state equation in 6343 ms returned unknown
[2021-05-07 23:16:26] [INFO ] [Real]Absence check using 42 positive place invariants in 22 ms returned sat
[2021-05-07 23:16:26] [INFO ] [Real]Absence check using 42 positive and 184 generalized place invariants in 43 ms returned sat
[2021-05-07 23:16:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:16:27] [INFO ] [Real]Absence check using state equation in 1081 ms returned sat
[2021-05-07 23:16:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:16:27] [INFO ] [Nat]Absence check using 42 positive place invariants in 22 ms returned sat
[2021-05-07 23:16:27] [INFO ] [Nat]Absence check using 42 positive and 184 generalized place invariants in 44 ms returned sat
[2021-05-07 23:16:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:16:28] [INFO ] [Nat]Absence check using state equation in 1068 ms returned sat
[2021-05-07 23:16:29] [INFO ] Deduced a trap composed of 76 places in 510 ms of which 3 ms to minimize.
[2021-05-07 23:16:29] [INFO ] Deduced a trap composed of 28 places in 211 ms of which 1 ms to minimize.
[2021-05-07 23:16:48] [INFO ] Deduced a trap composed of 5 places in 771 ms of which 1 ms to minimize.
[2021-05-07 23:16:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 14
[2021-05-07 23:16:48] [INFO ] [Real]Absence check using 42 positive place invariants in 22 ms returned sat
[2021-05-07 23:16:48] [INFO ] [Real]Absence check using 42 positive and 184 generalized place invariants in 47 ms returned sat
[2021-05-07 23:16:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:16:49] [INFO ] [Real]Absence check using state equation in 1031 ms returned sat
[2021-05-07 23:16:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:16:49] [INFO ] [Nat]Absence check using 42 positive place invariants in 24 ms returned sat
[2021-05-07 23:16:49] [INFO ] [Nat]Absence check using 42 positive and 184 generalized place invariants in 42 ms returned sat
[2021-05-07 23:16:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:16:56] [INFO ] [Nat]Absence check using state equation in 6651 ms returned unknown
[2021-05-07 23:16:56] [INFO ] [Real]Absence check using 42 positive place invariants in 21 ms returned sat
[2021-05-07 23:16:56] [INFO ] [Real]Absence check using 42 positive and 184 generalized place invariants in 43 ms returned sat
[2021-05-07 23:16:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:16:57] [INFO ] [Real]Absence check using state equation in 1037 ms returned sat
[2021-05-07 23:16:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:16:57] [INFO ] [Nat]Absence check using 42 positive place invariants in 22 ms returned sat
[2021-05-07 23:16:57] [INFO ] [Nat]Absence check using 42 positive and 184 generalized place invariants in 42 ms returned sat
[2021-05-07 23:16:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:17:04] [INFO ] [Nat]Absence check using state equation in 6938 ms returned unknown
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
[2021-05-07 23:17:04] [INFO ] Initial state test concluded for 3 properties.
FORMULA ASLink-PT-08a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(F(p0)))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 1645 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1645/1645 places, 2545/2545 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1644 transition count 2545
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 1639 transition count 2518
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 1639 transition count 2518
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 1637 transition count 2509
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 1637 transition count 2509
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 1635 transition count 2500
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 1635 transition count 2500
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 1633 transition count 2491
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 1633 transition count 2491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 1631 transition count 2482
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 1631 transition count 2482
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 1629 transition count 2473
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 1629 transition count 2473
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 1627 transition count 2464
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 1627 transition count 2464
Applied a total of 35 rules in 365 ms. Remains 1627 /1645 variables (removed 18) and now considering 2464/2545 (removed 81) transitions.
// Phase 1: matrix 2464 rows 1627 cols
[2021-05-07 23:17:05] [INFO ] Computed 225 place invariants in 26 ms
[2021-05-07 23:17:05] [INFO ] Implicit Places using invariants in 752 ms returned [391, 573, 755, 790, 1119, 1301, 1528, 1571]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 754 ms to find 8 implicit places.
// Phase 1: matrix 2464 rows 1619 cols
[2021-05-07 23:17:05] [INFO ] Computed 217 place invariants in 26 ms
[2021-05-07 23:17:07] [INFO ] Dead Transitions using invariants and state equation in 1198 ms returned []
Starting structural reductions, iteration 1 : 1619/1645 places, 2464/2545 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1617 transition count 2462
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1617 transition count 2462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1615 transition count 2460
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1615 transition count 2460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 1613 transition count 2458
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1613 transition count 2458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1612 transition count 2457
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1612 transition count 2457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1611 transition count 2456
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1611 transition count 2456
Applied a total of 16 rules in 287 ms. Remains 1611 /1619 variables (removed 8) and now considering 2456/2464 (removed 8) transitions.
// Phase 1: matrix 2456 rows 1611 cols
[2021-05-07 23:17:07] [INFO ] Computed 217 place invariants in 26 ms
[2021-05-07 23:17:08] [INFO ] Implicit Places using invariants in 708 ms returned []
// Phase 1: matrix 2456 rows 1611 cols
[2021-05-07 23:17:08] [INFO ] Computed 217 place invariants in 25 ms
[2021-05-07 23:17:11] [INFO ] Implicit Places using invariants and state equation in 3387 ms returned []
Implicit Place search using SMT with State Equation took 4097 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1611/1645 places, 2456/2545 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-08a-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (EQ s1309 1) (EQ s1486 1)), p1:(AND (EQ s1467 1) (EQ s1512 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 213 steps with 0 reset in 5 ms.
FORMULA ASLink-PT-08a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-02 finished in 6986 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 1645 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1645/1645 places, 2545/2545 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1644 transition count 2545
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 1639 transition count 2518
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 1639 transition count 2518
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 1637 transition count 2509
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 1637 transition count 2509
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 1635 transition count 2500
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 1635 transition count 2500
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 1633 transition count 2491
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 1633 transition count 2491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 1631 transition count 2482
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 1631 transition count 2482
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 1629 transition count 2473
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 1629 transition count 2473
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 1627 transition count 2464
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 1627 transition count 2464
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1626 transition count 2456
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1626 transition count 2456
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1625 transition count 2448
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1625 transition count 2448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1624 transition count 2440
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1624 transition count 2440
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1623 transition count 2432
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1623 transition count 2432
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1622 transition count 2424
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1622 transition count 2424
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1621 transition count 2416
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1621 transition count 2416
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1620 transition count 2408
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1620 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1619 transition count 2400
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1619 transition count 2400
Applied a total of 51 rules in 691 ms. Remains 1619 /1645 variables (removed 26) and now considering 2400/2545 (removed 145) transitions.
// Phase 1: matrix 2400 rows 1619 cols
[2021-05-07 23:17:12] [INFO ] Computed 225 place invariants in 35 ms
[2021-05-07 23:17:13] [INFO ] Implicit Places using invariants in 713 ms returned [391, 573, 755, 790, 1119, 1301, 1520, 1563]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 715 ms to find 8 implicit places.
// Phase 1: matrix 2400 rows 1611 cols
[2021-05-07 23:17:13] [INFO ] Computed 217 place invariants in 24 ms
[2021-05-07 23:17:14] [INFO ] Dead Transitions using invariants and state equation in 1133 ms returned []
Starting structural reductions, iteration 1 : 1611/1645 places, 2400/2545 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1609 transition count 2398
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1609 transition count 2398
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1607 transition count 2396
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1607 transition count 2396
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 1605 transition count 2394
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1605 transition count 2394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1604 transition count 2393
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1604 transition count 2393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1603 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1603 transition count 2392
Applied a total of 16 rules in 539 ms. Remains 1603 /1611 variables (removed 8) and now considering 2392/2400 (removed 8) transitions.
// Phase 1: matrix 2392 rows 1603 cols
[2021-05-07 23:17:14] [INFO ] Computed 217 place invariants in 24 ms
[2021-05-07 23:17:15] [INFO ] Implicit Places using invariants in 724 ms returned []
// Phase 1: matrix 2392 rows 1603 cols
[2021-05-07 23:17:15] [INFO ] Computed 217 place invariants in 24 ms
[2021-05-07 23:17:18] [INFO ] Implicit Places using invariants and state equation in 3025 ms returned []
Implicit Place search using SMT with State Equation took 3750 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1603/1645 places, 2392/2545 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ASLink-PT-08a-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s887 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-08a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-04 finished in 6907 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 1645 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1645/1645 places, 2545/2545 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 308 transitions
Trivial Post-agglo rules discarded 308 transitions
Performed 308 trivial Post agglomeration. Transition count delta: 308
Iterating post reduction 0 with 308 rules applied. Total rules applied 308 place count 1643 transition count 2236
Reduce places removed 317 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 322 rules applied. Total rules applied 630 place count 1326 transition count 2231
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 635 place count 1321 transition count 2231
Performed 229 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 229 Pre rules applied. Total rules applied 635 place count 1321 transition count 2002
Deduced a syphon composed of 229 places in 2 ms
Ensure Unique test removed 69 places
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 3 with 527 rules applied. Total rules applied 1162 place count 1023 transition count 2002
Discarding 18 places :
Implicit places reduction removed 18 places
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 3 with 45 rules applied. Total rules applied 1207 place count 1005 transition count 1975
Reduce places removed 28 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 30 rules applied. Total rules applied 1237 place count 977 transition count 1973
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1239 place count 975 transition count 1973
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 29 Pre rules applied. Total rules applied 1239 place count 975 transition count 1944
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 1297 place count 946 transition count 1944
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1314 place count 929 transition count 1905
Iterating global reduction 6 with 17 rules applied. Total rules applied 1331 place count 929 transition count 1905
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 14 rules applied. Total rules applied 1345 place count 926 transition count 1894
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1346 place count 925 transition count 1894
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1346 place count 925 transition count 1893
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1348 place count 924 transition count 1893
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1350 place count 922 transition count 1884
Iterating global reduction 8 with 2 rules applied. Total rules applied 1352 place count 922 transition count 1884
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1354 place count 920 transition count 1875
Iterating global reduction 8 with 2 rules applied. Total rules applied 1356 place count 920 transition count 1875
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1357 place count 919 transition count 1867
Iterating global reduction 8 with 1 rules applied. Total rules applied 1358 place count 919 transition count 1867
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1359 place count 918 transition count 1859
Iterating global reduction 8 with 1 rules applied. Total rules applied 1360 place count 918 transition count 1859
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1361 place count 917 transition count 1851
Iterating global reduction 8 with 1 rules applied. Total rules applied 1362 place count 917 transition count 1851
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1363 place count 916 transition count 1843
Iterating global reduction 8 with 1 rules applied. Total rules applied 1364 place count 916 transition count 1843
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1365 place count 915 transition count 1835
Iterating global reduction 8 with 1 rules applied. Total rules applied 1366 place count 915 transition count 1835
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1367 place count 914 transition count 1827
Iterating global reduction 8 with 1 rules applied. Total rules applied 1368 place count 914 transition count 1827
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1369 place count 913 transition count 1819
Iterating global reduction 8 with 1 rules applied. Total rules applied 1370 place count 913 transition count 1819
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1371 place count 912 transition count 1811
Iterating global reduction 8 with 1 rules applied. Total rules applied 1372 place count 912 transition count 1811
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1373 place count 911 transition count 1803
Iterating global reduction 8 with 1 rules applied. Total rules applied 1374 place count 911 transition count 1803
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1375 place count 910 transition count 1795
Iterating global reduction 8 with 1 rules applied. Total rules applied 1376 place count 910 transition count 1795
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1377 place count 909 transition count 1787
Iterating global reduction 8 with 1 rules applied. Total rules applied 1378 place count 909 transition count 1787
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1379 place count 908 transition count 1779
Iterating global reduction 8 with 1 rules applied. Total rules applied 1380 place count 908 transition count 1779
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 8 with 158 rules applied. Total rules applied 1538 place count 829 transition count 1700
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1542 place count 825 transition count 1696
Iterating global reduction 8 with 4 rules applied. Total rules applied 1546 place count 825 transition count 1696
Applied a total of 1546 rules in 832 ms. Remains 825 /1645 variables (removed 820) and now considering 1696/2545 (removed 849) transitions.
// Phase 1: matrix 1696 rows 825 cols
[2021-05-07 23:17:19] [INFO ] Computed 125 place invariants in 19 ms
[2021-05-07 23:17:20] [INFO ] Implicit Places using invariants in 513 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 288, 341, 362, 368, 373, 375, 384, 419, 438, 460, 466, 471, 474, 534, 551, 557, 562, 564, 573, 626, 664, 673, 725, 742, 748, 753, 755, 817, 822]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 514 ms to find 43 implicit places.
[2021-05-07 23:17:20] [INFO ] Redundant transitions in 144 ms returned []
// Phase 1: matrix 1696 rows 782 cols
[2021-05-07 23:17:20] [INFO ] Computed 82 place invariants in 17 ms
[2021-05-07 23:17:20] [INFO ] Dead Transitions using invariants and state equation in 687 ms returned []
Starting structural reductions, iteration 1 : 782/1645 places, 1696/2545 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 782 transition count 1681
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 767 transition count 1680
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 31 place count 767 transition count 1676
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 39 place count 763 transition count 1676
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 55 place count 747 transition count 1660
Iterating global reduction 2 with 16 rules applied. Total rules applied 71 place count 747 transition count 1660
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 85 place count 733 transition count 1646
Iterating global reduction 2 with 14 rules applied. Total rules applied 99 place count 733 transition count 1646
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 106 place count 726 transition count 1639
Iterating global reduction 2 with 7 rules applied. Total rules applied 113 place count 726 transition count 1639
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 151 place count 707 transition count 1620
Applied a total of 151 rules in 160 ms. Remains 707 /782 variables (removed 75) and now considering 1620/1696 (removed 76) transitions.
// Phase 1: matrix 1620 rows 707 cols
[2021-05-07 23:17:21] [INFO ] Computed 82 place invariants in 16 ms
[2021-05-07 23:17:21] [INFO ] Implicit Places using invariants in 453 ms returned [553, 559, 564]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 455 ms to find 3 implicit places.
Starting structural reductions, iteration 2 : 704/1645 places, 1620/2545 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 702 transition count 1618
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 702 transition count 1618
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 700 transition count 1616
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 700 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 699 transition count 1615
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 699 transition count 1615
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 698 transition count 1614
Applied a total of 12 rules in 121 ms. Remains 698 /704 variables (removed 6) and now considering 1614/1620 (removed 6) transitions.
// Phase 1: matrix 1614 rows 698 cols
[2021-05-07 23:17:21] [INFO ] Computed 79 place invariants in 16 ms
[2021-05-07 23:17:22] [INFO ] Implicit Places using invariants in 455 ms returned []
// Phase 1: matrix 1614 rows 698 cols
[2021-05-07 23:17:22] [INFO ] Computed 79 place invariants in 19 ms
[2021-05-07 23:17:23] [INFO ] Implicit Places using invariants and state equation in 1517 ms returned []
Implicit Place search using SMT with State Equation took 1974 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 698/1645 places, 1614/2545 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-08a-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s178 1) (EQ s297 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-08a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-05 finished in 4941 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(G(p0)))&&(X((p2 U p3))||p1)))], workingDir=/home/mcc/execution]
Support contains 6 out of 1645 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1645/1645 places, 2545/2545 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1644 transition count 2545
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 1639 transition count 2518
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 1639 transition count 2518
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 1637 transition count 2509
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 1637 transition count 2509
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 1635 transition count 2500
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 1635 transition count 2500
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 1633 transition count 2491
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 1633 transition count 2491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 1631 transition count 2482
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 1631 transition count 2482
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 1629 transition count 2473
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 1629 transition count 2473
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 1627 transition count 2464
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 1627 transition count 2464
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1626 transition count 2456
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1626 transition count 2456
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1625 transition count 2448
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1625 transition count 2448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1624 transition count 2440
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1624 transition count 2440
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1623 transition count 2432
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1623 transition count 2432
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1622 transition count 2424
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1622 transition count 2424
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1621 transition count 2416
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1621 transition count 2416
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1620 transition count 2408
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1620 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1619 transition count 2400
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1619 transition count 2400
Applied a total of 51 rules in 1094 ms. Remains 1619 /1645 variables (removed 26) and now considering 2400/2545 (removed 145) transitions.
// Phase 1: matrix 2400 rows 1619 cols
[2021-05-07 23:17:24] [INFO ] Computed 225 place invariants in 24 ms
[2021-05-07 23:17:25] [INFO ] Implicit Places using invariants in 744 ms returned [391, 573, 755, 790, 1119, 1301, 1520]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 747 ms to find 7 implicit places.
// Phase 1: matrix 2400 rows 1612 cols
[2021-05-07 23:17:25] [INFO ] Computed 218 place invariants in 23 ms
[2021-05-07 23:17:26] [INFO ] Dead Transitions using invariants and state equation in 1141 ms returned []
Starting structural reductions, iteration 1 : 1612/1645 places, 2400/2545 transitions.
Applied a total of 0 rules in 69 ms. Remains 1612 /1612 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 1612 cols
[2021-05-07 23:17:26] [INFO ] Computed 218 place invariants in 24 ms
[2021-05-07 23:17:27] [INFO ] Dead Transitions using invariants and state equation in 1133 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1612/1645 places, 2400/2545 transitions.
[2021-05-07 23:17:27] [INFO ] Initial state test concluded for 1 properties.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p3), (NOT p0), true]
Running random walk in product with property : ASLink-PT-08a-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s1 0) (EQ s18 0) (AND (EQ s587 1) (EQ s790 1))), p3:(AND (EQ s1556 1) (EQ s1561 1) (OR (EQ s1 0) (EQ s18 0) (AND (EQ s587 1) (EQ s790 1)))), p2:(AND (EQ s1556 1) (EQ s1561 1)), p0:(OR (EQ s1556 0) (EQ s1561 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 381 steps with 1 reset in 3 ms.
FORMULA ASLink-PT-08a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-08 finished in 4333 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 1645 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1645/1645 places, 2545/2545 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1640 transition count 2518
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1640 transition count 2518
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 1638 transition count 2509
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 1638 transition count 2509
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 1636 transition count 2500
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 1636 transition count 2500
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 1634 transition count 2491
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 1634 transition count 2491
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 1632 transition count 2482
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 1632 transition count 2482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 1630 transition count 2473
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 1630 transition count 2473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 1628 transition count 2464
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 1628 transition count 2464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1627 transition count 2456
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1627 transition count 2456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1626 transition count 2448
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1626 transition count 2448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1625 transition count 2440
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1625 transition count 2440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1624 transition count 2432
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1624 transition count 2432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 1623 transition count 2424
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 1623 transition count 2424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1622 transition count 2416
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1622 transition count 2416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1621 transition count 2408
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1621 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1620 transition count 2400
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1620 transition count 2400
Applied a total of 50 rules in 1110 ms. Remains 1620 /1645 variables (removed 25) and now considering 2400/2545 (removed 145) transitions.
// Phase 1: matrix 2400 rows 1620 cols
[2021-05-07 23:17:29] [INFO ] Computed 226 place invariants in 24 ms
[2021-05-07 23:17:29] [INFO ] Implicit Places using invariants in 745 ms returned [392, 574, 756, 791, 1120, 1302, 1521, 1564]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 747 ms to find 8 implicit places.
// Phase 1: matrix 2400 rows 1612 cols
[2021-05-07 23:17:29] [INFO ] Computed 218 place invariants in 23 ms
[2021-05-07 23:17:31] [INFO ] Dead Transitions using invariants and state equation in 1263 ms returned []
Starting structural reductions, iteration 1 : 1612/1645 places, 2400/2545 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1610 transition count 2398
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1610 transition count 2398
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1608 transition count 2396
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1608 transition count 2396
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 1606 transition count 2394
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1606 transition count 2394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1605 transition count 2393
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1605 transition count 2393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1604 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1604 transition count 2392
Applied a total of 16 rules in 404 ms. Remains 1604 /1612 variables (removed 8) and now considering 2392/2400 (removed 8) transitions.
// Phase 1: matrix 2392 rows 1604 cols
[2021-05-07 23:17:31] [INFO ] Computed 218 place invariants in 23 ms
[2021-05-07 23:17:32] [INFO ] Implicit Places using invariants in 693 ms returned []
// Phase 1: matrix 2392 rows 1604 cols
[2021-05-07 23:17:32] [INFO ] Computed 218 place invariants in 23 ms
[2021-05-07 23:17:35] [INFO ] Implicit Places using invariants and state equation in 2982 ms returned []
Implicit Place search using SMT with State Equation took 3680 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1604/1645 places, 2392/2545 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ASLink-PT-08a-09 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s707 1) (OR (EQ s83 0) (EQ s209 0))), p0:(OR (EQ s83 0) (EQ s209 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][false, false, false]]
Stuttering criterion allowed to conclude after 305 steps with 0 reset in 7 ms.
FORMULA ASLink-PT-08a-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-09 finished in 7294 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 1645 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1645/1645 places, 2545/2545 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 308 transitions
Trivial Post-agglo rules discarded 308 transitions
Performed 308 trivial Post agglomeration. Transition count delta: 308
Iterating post reduction 0 with 308 rules applied. Total rules applied 308 place count 1643 transition count 2236
Reduce places removed 317 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 322 rules applied. Total rules applied 630 place count 1326 transition count 2231
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 635 place count 1321 transition count 2231
Performed 229 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 229 Pre rules applied. Total rules applied 635 place count 1321 transition count 2002
Deduced a syphon composed of 229 places in 2 ms
Ensure Unique test removed 69 places
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 3 with 527 rules applied. Total rules applied 1162 place count 1023 transition count 2002
Discarding 18 places :
Implicit places reduction removed 18 places
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 3 with 45 rules applied. Total rules applied 1207 place count 1005 transition count 1975
Reduce places removed 28 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 30 rules applied. Total rules applied 1237 place count 977 transition count 1973
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1239 place count 975 transition count 1973
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 29 Pre rules applied. Total rules applied 1239 place count 975 transition count 1944
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 1297 place count 946 transition count 1944
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1314 place count 929 transition count 1905
Iterating global reduction 6 with 17 rules applied. Total rules applied 1331 place count 929 transition count 1905
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 14 rules applied. Total rules applied 1345 place count 926 transition count 1894
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1346 place count 925 transition count 1894
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1346 place count 925 transition count 1893
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1348 place count 924 transition count 1893
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1350 place count 922 transition count 1884
Iterating global reduction 8 with 2 rules applied. Total rules applied 1352 place count 922 transition count 1884
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1354 place count 920 transition count 1875
Iterating global reduction 8 with 2 rules applied. Total rules applied 1356 place count 920 transition count 1875
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1357 place count 919 transition count 1867
Iterating global reduction 8 with 1 rules applied. Total rules applied 1358 place count 919 transition count 1867
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1359 place count 918 transition count 1859
Iterating global reduction 8 with 1 rules applied. Total rules applied 1360 place count 918 transition count 1859
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1361 place count 917 transition count 1851
Iterating global reduction 8 with 1 rules applied. Total rules applied 1362 place count 917 transition count 1851
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1363 place count 916 transition count 1843
Iterating global reduction 8 with 1 rules applied. Total rules applied 1364 place count 916 transition count 1843
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1365 place count 915 transition count 1835
Iterating global reduction 8 with 1 rules applied. Total rules applied 1366 place count 915 transition count 1835
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1367 place count 914 transition count 1827
Iterating global reduction 8 with 1 rules applied. Total rules applied 1368 place count 914 transition count 1827
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1369 place count 913 transition count 1819
Iterating global reduction 8 with 1 rules applied. Total rules applied 1370 place count 913 transition count 1819
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1371 place count 912 transition count 1811
Iterating global reduction 8 with 1 rules applied. Total rules applied 1372 place count 912 transition count 1811
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1373 place count 911 transition count 1803
Iterating global reduction 8 with 1 rules applied. Total rules applied 1374 place count 911 transition count 1803
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1375 place count 910 transition count 1795
Iterating global reduction 8 with 1 rules applied. Total rules applied 1376 place count 910 transition count 1795
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1377 place count 909 transition count 1787
Iterating global reduction 8 with 1 rules applied. Total rules applied 1378 place count 909 transition count 1787
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1379 place count 908 transition count 1779
Iterating global reduction 8 with 1 rules applied. Total rules applied 1380 place count 908 transition count 1779
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 8 with 158 rules applied. Total rules applied 1538 place count 829 transition count 1700
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1542 place count 825 transition count 1696
Iterating global reduction 8 with 4 rules applied. Total rules applied 1546 place count 825 transition count 1696
Applied a total of 1546 rules in 612 ms. Remains 825 /1645 variables (removed 820) and now considering 1696/2545 (removed 849) transitions.
// Phase 1: matrix 1696 rows 825 cols
[2021-05-07 23:17:35] [INFO ] Computed 125 place invariants in 19 ms
[2021-05-07 23:17:36] [INFO ] Implicit Places using invariants in 492 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 288, 341, 362, 368, 373, 375, 384, 419, 438, 460, 466, 471, 474, 534, 551, 557, 562, 564, 573, 626, 664, 673, 725, 742, 748, 753, 755, 817, 822]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 494 ms to find 43 implicit places.
[2021-05-07 23:17:36] [INFO ] Redundant transitions in 107 ms returned []
// Phase 1: matrix 1696 rows 782 cols
[2021-05-07 23:17:36] [INFO ] Computed 82 place invariants in 17 ms
[2021-05-07 23:17:37] [INFO ] Dead Transitions using invariants and state equation in 733 ms returned []
Starting structural reductions, iteration 1 : 782/1645 places, 1696/2545 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 782 transition count 1681
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 767 transition count 1680
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 31 place count 767 transition count 1676
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 39 place count 763 transition count 1676
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 55 place count 747 transition count 1660
Iterating global reduction 2 with 16 rules applied. Total rules applied 71 place count 747 transition count 1660
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 85 place count 733 transition count 1646
Iterating global reduction 2 with 14 rules applied. Total rules applied 99 place count 733 transition count 1646
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 106 place count 726 transition count 1639
Iterating global reduction 2 with 7 rules applied. Total rules applied 113 place count 726 transition count 1639
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 151 place count 707 transition count 1620
Applied a total of 151 rules in 136 ms. Remains 707 /782 variables (removed 75) and now considering 1620/1696 (removed 76) transitions.
// Phase 1: matrix 1620 rows 707 cols
[2021-05-07 23:17:37] [INFO ] Computed 82 place invariants in 16 ms
[2021-05-07 23:17:37] [INFO ] Implicit Places using invariants in 444 ms returned [553, 559, 564]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 446 ms to find 3 implicit places.
Starting structural reductions, iteration 2 : 704/1645 places, 1620/2545 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 702 transition count 1618
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 702 transition count 1618
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 700 transition count 1616
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 700 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 699 transition count 1615
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 699 transition count 1615
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 698 transition count 1614
Applied a total of 12 rules in 119 ms. Remains 698 /704 variables (removed 6) and now considering 1614/1620 (removed 6) transitions.
// Phase 1: matrix 1614 rows 698 cols
[2021-05-07 23:17:37] [INFO ] Computed 79 place invariants in 16 ms
[2021-05-07 23:17:38] [INFO ] Implicit Places using invariants in 443 ms returned []
// Phase 1: matrix 1614 rows 698 cols
[2021-05-07 23:17:38] [INFO ] Computed 79 place invariants in 15 ms
[2021-05-07 23:17:39] [INFO ] Implicit Places using invariants and state equation in 1493 ms returned []
Implicit Place search using SMT with State Equation took 1937 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 698/1645 places, 1614/2545 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-08a-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s107 1) (NEQ s220 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 1262 reset in 325 ms.
Product exploration explored 100000 steps with 1307 reset in 387 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1304 reset in 262 ms.
Product exploration explored 100000 steps with 1285 reset in 274 ms.
[2021-05-07 23:17:41] [INFO ] Flatten gal took : 73 ms
[2021-05-07 23:17:41] [INFO ] Flatten gal took : 72 ms
[2021-05-07 23:17:41] [INFO ] Time to serialize gal into /tmp/LTL16320017437895017805.gal : 33 ms
[2021-05-07 23:17:41] [INFO ] Time to serialize properties into /tmp/LTL15957142954647806566.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/LTL16320017437895017805.gal, -t, CGAL, -LTL, /tmp/LTL15957142954647806566.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/LTL16320017437895017805.gal -t CGAL -LTL /tmp/LTL15957142954647806566.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("((p241!=1)||(p474!=1))"))))
Formula 0 simplified : !FG"((p241!=1)||(p474!=1))"
Detected timeout of ITS tools.
[2021-05-07 23:17:56] [INFO ] Flatten gal took : 67 ms
[2021-05-07 23:17:56] [INFO ] Applying decomposition
[2021-05-07 23:17:56] [INFO ] Flatten gal took : 69 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/graph15457752627664884857.txt, -o, /tmp/graph15457752627664884857.bin, -w, /tmp/graph15457752627664884857.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/graph15457752627664884857.bin, -l, -1, -v, -w, /tmp/graph15457752627664884857.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 23:17:56] [INFO ] Decomposing Gal with order
[2021-05-07 23:17:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 23:17:57] [INFO ] Removed a total of 3204 redundant transitions.
[2021-05-07 23:17:57] [INFO ] Flatten gal took : 191 ms
[2021-05-07 23:17:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 36 ms.
[2021-05-07 23:17:57] [INFO ] Time to serialize gal into /tmp/LTL16571112593792434577.gal : 15 ms
[2021-05-07 23:17:57] [INFO ] Time to serialize properties into /tmp/LTL12614935579549604362.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/LTL16571112593792434577.gal, -t, CGAL, -LTL, /tmp/LTL12614935579549604362.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/LTL16571112593792434577.gal -t CGAL -LTL /tmp/LTL12614935579549604362.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("((i4.u31.p241!=1)||(i4.u58.p474!=1))"))))
Formula 0 simplified : !FG"((i4.u31.p241!=1)||(i4.u58.p474!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18272288473203887213
[2021-05-07 23:18:12] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18272288473203887213
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/ltsmin18272288473203887213]
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/ltsmin18272288473203887213] 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/ltsmin18272288473203887213] 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 ASLink-PT-08a-10 finished in 38081 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 1645 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1645/1645 places, 2545/2545 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1644 transition count 2545
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 1640 transition count 2524
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 1640 transition count 2524
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 1638 transition count 2515
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 1638 transition count 2515
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 1636 transition count 2506
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 1636 transition count 2506
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 1634 transition count 2497
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 1634 transition count 2497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 1632 transition count 2488
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 1632 transition count 2488
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 1630 transition count 2479
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 1630 transition count 2479
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 1628 transition count 2470
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 1628 transition count 2470
Applied a total of 33 rules in 583 ms. Remains 1628 /1645 variables (removed 17) and now considering 2470/2545 (removed 75) transitions.
// Phase 1: matrix 2470 rows 1628 cols
[2021-05-07 23:18:13] [INFO ] Computed 225 place invariants in 25 ms
[2021-05-07 23:18:14] [INFO ] Implicit Places using invariants in 777 ms returned [391, 573, 755, 790, 1302, 1529, 1572]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 779 ms to find 7 implicit places.
// Phase 1: matrix 2470 rows 1621 cols
[2021-05-07 23:18:14] [INFO ] Computed 218 place invariants in 24 ms
[2021-05-07 23:18:15] [INFO ] Dead Transitions using invariants and state equation in 1221 ms returned []
Starting structural reductions, iteration 1 : 1621/1645 places, 2470/2545 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1619 transition count 2468
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1619 transition count 2468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1617 transition count 2466
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1617 transition count 2466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 1615 transition count 2464
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1615 transition count 2464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1614 transition count 2463
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1614 transition count 2463
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1613 transition count 2462
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1613 transition count 2462
Applied a total of 16 rules in 416 ms. Remains 1613 /1621 variables (removed 8) and now considering 2462/2470 (removed 8) transitions.
// Phase 1: matrix 2462 rows 1613 cols
[2021-05-07 23:18:16] [INFO ] Computed 218 place invariants in 24 ms
[2021-05-07 23:18:17] [INFO ] Implicit Places using invariants in 724 ms returned []
// Phase 1: matrix 2462 rows 1613 cols
[2021-05-07 23:18:17] [INFO ] Computed 218 place invariants in 23 ms
[2021-05-07 23:18:20] [INFO ] Implicit Places using invariants and state equation in 3194 ms returned []
Implicit Place search using SMT with State Equation took 3923 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1613/1645 places, 2462/2545 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ASLink-PT-08a-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (EQ s1115 1) (EQ s1181 1)) (AND (EQ s1309 1) (EQ s1496 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-08a-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-11 finished in 7009 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1645 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1645/1645 places, 2545/2545 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1644 transition count 2545
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 1639 transition count 2518
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 1639 transition count 2518
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 1637 transition count 2509
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 1637 transition count 2509
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 1635 transition count 2500
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 1635 transition count 2500
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 1633 transition count 2491
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 1633 transition count 2491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 1631 transition count 2482
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 1631 transition count 2482
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 1629 transition count 2473
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 1629 transition count 2473
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 1627 transition count 2464
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 1627 transition count 2464
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1626 transition count 2456
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1626 transition count 2456
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1625 transition count 2448
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1625 transition count 2448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1624 transition count 2440
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1624 transition count 2440
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1623 transition count 2432
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1623 transition count 2432
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1622 transition count 2424
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1622 transition count 2424
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1621 transition count 2416
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1621 transition count 2416
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1620 transition count 2408
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1620 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1619 transition count 2400
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1619 transition count 2400
Applied a total of 51 rules in 1130 ms. Remains 1619 /1645 variables (removed 26) and now considering 2400/2545 (removed 145) transitions.
// Phase 1: matrix 2400 rows 1619 cols
[2021-05-07 23:18:21] [INFO ] Computed 225 place invariants in 24 ms
[2021-05-07 23:18:22] [INFO ] Implicit Places using invariants in 772 ms returned [573, 755, 790, 1119, 1301, 1520, 1563]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 774 ms to find 7 implicit places.
// Phase 1: matrix 2400 rows 1612 cols
[2021-05-07 23:18:22] [INFO ] Computed 218 place invariants in 23 ms
[2021-05-07 23:18:23] [INFO ] Dead Transitions using invariants and state equation in 1195 ms returned []
Starting structural reductions, iteration 1 : 1612/1645 places, 2400/2545 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1610 transition count 2398
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1610 transition count 2398
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1608 transition count 2396
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1608 transition count 2396
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 1606 transition count 2394
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1606 transition count 2394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1605 transition count 2393
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1605 transition count 2393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1604 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1604 transition count 2392
Applied a total of 16 rules in 417 ms. Remains 1604 /1612 variables (removed 8) and now considering 2392/2400 (removed 8) transitions.
// Phase 1: matrix 2392 rows 1604 cols
[2021-05-07 23:18:23] [INFO ] Computed 218 place invariants in 23 ms
[2021-05-07 23:18:24] [INFO ] Implicit Places using invariants in 718 ms returned []
// Phase 1: matrix 2392 rows 1604 cols
[2021-05-07 23:18:24] [INFO ] Computed 218 place invariants in 24 ms
[2021-05-07 23:18:27] [INFO ] Implicit Places using invariants and state equation in 3196 ms returned []
Implicit Place search using SMT with State Equation took 3915 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1604/1645 places, 2392/2545 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s305 0) (EQ s391 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][false, false, false]]
Product exploration explored 100000 steps with 29026 reset in 1173 ms.
Product exploration explored 100000 steps with 28983 reset in 1164 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 28818 reset in 1155 ms.
Product exploration explored 100000 steps with 28695 reset in 1177 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1604 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1604/1604 places, 2392/2392 transitions.
Performed 314 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 314 rules applied. Total rules applied 314 place count 1604 transition count 2392
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 118 Pre rules applied. Total rules applied 314 place count 1604 transition count 2463
Deduced a syphon composed of 432 places in 2 ms
Iterating global reduction 1 with 118 rules applied. Total rules applied 432 place count 1604 transition count 2463
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 433 place count 1603 transition count 2463
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 478 place count 1558 transition count 2418
Deduced a syphon composed of 389 places in 3 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 523 place count 1558 transition count 2418
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 523 place count 1558 transition count 2418
Deduced a syphon composed of 390 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 524 place count 1558 transition count 2418
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 525 place count 1557 transition count 2417
Deduced a syphon composed of 389 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 526 place count 1557 transition count 2417
Performed 197 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 586 places in 3 ms
Iterating global reduction 2 with 197 rules applied. Total rules applied 723 place count 1557 transition count 2444
Discarding 103 places :
Symmetric choice reduction at 2 with 103 rule applications. Total rules 826 place count 1454 transition count 2341
Deduced a syphon composed of 483 places in 3 ms
Iterating global reduction 2 with 103 rules applied. Total rules applied 929 place count 1454 transition count 2341
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 491 places in 3 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 937 place count 1454 transition count 2373
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 492 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 938 place count 1454 transition count 2377
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 940 place count 1452 transition count 2371
Deduced a syphon composed of 490 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 942 place count 1452 transition count 2371
Deduced a syphon composed of 490 places in 2 ms
Applied a total of 942 rules in 793 ms. Remains 1452 /1604 variables (removed 152) and now considering 2371/2392 (removed 21) transitions.
[2021-05-07 23:18:33] [INFO ] Redundant transitions in 55 ms returned []
// Phase 1: matrix 2371 rows 1452 cols
[2021-05-07 23:18:33] [INFO ] Computed 217 place invariants in 28 ms
[2021-05-07 23:18:34] [INFO ] Dead Transitions using invariants and state equation in 1135 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1452/1604 places, 2371/2392 transitions.
Product exploration explored 100000 steps with 30345 reset in 5693 ms.
Product exploration explored 100000 steps with 30534 reset in 5601 ms.
[2021-05-07 23:18:46] [INFO ] Flatten gal took : 85 ms
[2021-05-07 23:18:46] [INFO ] Flatten gal took : 87 ms
[2021-05-07 23:18:46] [INFO ] Time to serialize gal into /tmp/LTL9928108305990921337.gal : 9 ms
[2021-05-07 23:18:46] [INFO ] Time to serialize properties into /tmp/LTL3891700722623789574.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/LTL9928108305990921337.gal, -t, CGAL, -LTL, /tmp/LTL3891700722623789574.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/LTL9928108305990921337.gal -t CGAL -LTL /tmp/LTL3891700722623789574.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((p330==0)||(p423==0))")))))
Formula 0 simplified : !XXF"((p330==0)||(p423==0))"
Detected timeout of ITS tools.
[2021-05-07 23:19:01] [INFO ] Flatten gal took : 78 ms
[2021-05-07 23:19:01] [INFO ] Applying decomposition
[2021-05-07 23:19:01] [INFO ] Flatten gal took : 81 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/graph11284753493263443959.txt, -o, /tmp/graph11284753493263443959.bin, -w, /tmp/graph11284753493263443959.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/graph11284753493263443959.bin, -l, -1, -v, -w, /tmp/graph11284753493263443959.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 23:19:01] [INFO ] Decomposing Gal with order
[2021-05-07 23:19:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 23:19:02] [INFO ] Removed a total of 3194 redundant transitions.
[2021-05-07 23:19:02] [INFO ] Flatten gal took : 142 ms
[2021-05-07 23:19:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 25 ms.
[2021-05-07 23:19:02] [INFO ] Time to serialize gal into /tmp/LTL10104527964607961933.gal : 14 ms
[2021-05-07 23:19:02] [INFO ] Time to serialize properties into /tmp/LTL4617833370617162015.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/LTL10104527964607961933.gal, -t, CGAL, -LTL, /tmp/LTL4617833370617162015.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/LTL10104527964607961933.gal -t CGAL -LTL /tmp/LTL4617833370617162015.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((i3.u83.p330==0)||(i3.u118.p423==0))")))))
Formula 0 simplified : !XXF"((i3.u83.p330==0)||(i3.u118.p423==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5101824680670842557
[2021-05-07 23:19:17] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5101824680670842557
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/ltsmin5101824680670842557]
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/ltsmin5101824680670842557] 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/ltsmin5101824680670842557] 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 ASLink-PT-08a-12 finished in 57898 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1645 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1645/1645 places, 2545/2545 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 308 transitions
Trivial Post-agglo rules discarded 308 transitions
Performed 308 trivial Post agglomeration. Transition count delta: 308
Iterating post reduction 0 with 308 rules applied. Total rules applied 308 place count 1643 transition count 2236
Reduce places removed 317 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 322 rules applied. Total rules applied 630 place count 1326 transition count 2231
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 635 place count 1321 transition count 2231
Performed 229 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 229 Pre rules applied. Total rules applied 635 place count 1321 transition count 2002
Deduced a syphon composed of 229 places in 3 ms
Ensure Unique test removed 69 places
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 3 with 527 rules applied. Total rules applied 1162 place count 1023 transition count 2002
Discarding 18 places :
Implicit places reduction removed 18 places
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 3 with 45 rules applied. Total rules applied 1207 place count 1005 transition count 1975
Reduce places removed 28 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 30 rules applied. Total rules applied 1237 place count 977 transition count 1973
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1239 place count 975 transition count 1973
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 29 Pre rules applied. Total rules applied 1239 place count 975 transition count 1944
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 1297 place count 946 transition count 1944
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1314 place count 929 transition count 1905
Iterating global reduction 6 with 17 rules applied. Total rules applied 1331 place count 929 transition count 1905
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 14 rules applied. Total rules applied 1345 place count 926 transition count 1894
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1346 place count 925 transition count 1894
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1346 place count 925 transition count 1893
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1348 place count 924 transition count 1893
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1350 place count 922 transition count 1884
Iterating global reduction 8 with 2 rules applied. Total rules applied 1352 place count 922 transition count 1884
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1354 place count 920 transition count 1875
Iterating global reduction 8 with 2 rules applied. Total rules applied 1356 place count 920 transition count 1875
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1357 place count 919 transition count 1867
Iterating global reduction 8 with 1 rules applied. Total rules applied 1358 place count 919 transition count 1867
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1359 place count 918 transition count 1859
Iterating global reduction 8 with 1 rules applied. Total rules applied 1360 place count 918 transition count 1859
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1361 place count 917 transition count 1851
Iterating global reduction 8 with 1 rules applied. Total rules applied 1362 place count 917 transition count 1851
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1363 place count 916 transition count 1843
Iterating global reduction 8 with 1 rules applied. Total rules applied 1364 place count 916 transition count 1843
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1365 place count 915 transition count 1835
Iterating global reduction 8 with 1 rules applied. Total rules applied 1366 place count 915 transition count 1835
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1367 place count 914 transition count 1827
Iterating global reduction 8 with 1 rules applied. Total rules applied 1368 place count 914 transition count 1827
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1369 place count 913 transition count 1819
Iterating global reduction 8 with 1 rules applied. Total rules applied 1370 place count 913 transition count 1819
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1371 place count 912 transition count 1811
Iterating global reduction 8 with 1 rules applied. Total rules applied 1372 place count 912 transition count 1811
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1373 place count 911 transition count 1803
Iterating global reduction 8 with 1 rules applied. Total rules applied 1374 place count 911 transition count 1803
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1375 place count 910 transition count 1795
Iterating global reduction 8 with 1 rules applied. Total rules applied 1376 place count 910 transition count 1795
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1377 place count 909 transition count 1787
Iterating global reduction 8 with 1 rules applied. Total rules applied 1378 place count 909 transition count 1787
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1379 place count 908 transition count 1779
Iterating global reduction 8 with 1 rules applied. Total rules applied 1380 place count 908 transition count 1779
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 8 with 158 rules applied. Total rules applied 1538 place count 829 transition count 1700
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1542 place count 825 transition count 1696
Iterating global reduction 8 with 4 rules applied. Total rules applied 1546 place count 825 transition count 1696
Applied a total of 1546 rules in 565 ms. Remains 825 /1645 variables (removed 820) and now considering 1696/2545 (removed 849) transitions.
// Phase 1: matrix 1696 rows 825 cols
[2021-05-07 23:19:18] [INFO ] Computed 125 place invariants in 18 ms
[2021-05-07 23:19:19] [INFO ] Implicit Places using invariants in 467 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 288, 341, 362, 368, 373, 375, 384, 419, 438, 460, 466, 471, 474, 534, 551, 557, 562, 564, 573, 626, 664, 673, 725, 742, 748, 753, 755, 817, 822]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 468 ms to find 43 implicit places.
[2021-05-07 23:19:19] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 1696 rows 782 cols
[2021-05-07 23:19:19] [INFO ] Computed 82 place invariants in 17 ms
[2021-05-07 23:19:20] [INFO ] Dead Transitions using invariants and state equation in 740 ms returned []
Starting structural reductions, iteration 1 : 782/1645 places, 1696/2545 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 782 transition count 1681
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 767 transition count 1680
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 31 place count 767 transition count 1676
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 39 place count 763 transition count 1676
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 55 place count 747 transition count 1660
Iterating global reduction 2 with 16 rules applied. Total rules applied 71 place count 747 transition count 1660
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 85 place count 733 transition count 1646
Iterating global reduction 2 with 14 rules applied. Total rules applied 99 place count 733 transition count 1646
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 106 place count 726 transition count 1639
Iterating global reduction 2 with 7 rules applied. Total rules applied 113 place count 726 transition count 1639
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 151 place count 707 transition count 1620
Applied a total of 151 rules in 131 ms. Remains 707 /782 variables (removed 75) and now considering 1620/1696 (removed 76) transitions.
// Phase 1: matrix 1620 rows 707 cols
[2021-05-07 23:19:20] [INFO ] Computed 82 place invariants in 17 ms
[2021-05-07 23:19:20] [INFO ] Implicit Places using invariants in 457 ms returned [553, 559, 564]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 458 ms to find 3 implicit places.
Starting structural reductions, iteration 2 : 704/1645 places, 1620/2545 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 702 transition count 1618
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 702 transition count 1618
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 700 transition count 1616
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 700 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 699 transition count 1615
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 699 transition count 1615
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 698 transition count 1614
Applied a total of 12 rules in 106 ms. Remains 698 /704 variables (removed 6) and now considering 1614/1620 (removed 6) transitions.
// Phase 1: matrix 1614 rows 698 cols
[2021-05-07 23:19:20] [INFO ] Computed 79 place invariants in 15 ms
[2021-05-07 23:19:21] [INFO ] Implicit Places using invariants in 439 ms returned []
// Phase 1: matrix 1614 rows 698 cols
[2021-05-07 23:19:21] [INFO ] Computed 79 place invariants in 15 ms
[2021-05-07 23:19:22] [INFO ] Implicit Places using invariants and state equation in 1526 ms returned []
Implicit Place search using SMT with State Equation took 1969 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 698/1645 places, 1614/2545 transitions.
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-08a-14 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s411 1) (EQ s534 1)), p1:(OR (NEQ s642 1) (NEQ s675 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1304 reset in 390 ms.
Product exploration explored 100000 steps with 1358 reset in 373 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 23 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1329 reset in 322 ms.
Product exploration explored 100000 steps with 1345 reset in 329 ms.
[2021-05-07 23:19:24] [INFO ] Flatten gal took : 62 ms
[2021-05-07 23:19:24] [INFO ] Flatten gal took : 56 ms
[2021-05-07 23:19:24] [INFO ] Time to serialize gal into /tmp/LTL6210274293088582495.gal : 6 ms
[2021-05-07 23:19:24] [INFO ] Time to serialize properties into /tmp/LTL15298465730591238694.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/LTL6210274293088582495.gal, -t, CGAL, -LTL, /tmp/LTL15298465730591238694.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/LTL6210274293088582495.gal -t CGAL -LTL /tmp/LTL15298465730591238694.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("((p1013==1)&&(p1256==1))"))||(G("((p1581!=1)||(p1645!=1))")))))
Formula 0 simplified : !F(G"((p1013==1)&&(p1256==1))" | G"((p1581!=1)||(p1645!=1))")
Detected timeout of ITS tools.
[2021-05-07 23:19:39] [INFO ] Flatten gal took : 56 ms
[2021-05-07 23:19:39] [INFO ] Applying decomposition
[2021-05-07 23:19:39] [INFO ] Flatten gal took : 56 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/graph1961901110774883438.txt, -o, /tmp/graph1961901110774883438.bin, -w, /tmp/graph1961901110774883438.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/graph1961901110774883438.bin, -l, -1, -v, -w, /tmp/graph1961901110774883438.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 23:19:39] [INFO ] Decomposing Gal with order
[2021-05-07 23:19:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 23:19:39] [INFO ] Removed a total of 3194 redundant transitions.
[2021-05-07 23:19:39] [INFO ] Flatten gal took : 99 ms
[2021-05-07 23:19:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 15 ms.
[2021-05-07 23:19:39] [INFO ] Time to serialize gal into /tmp/LTL2878125475222573469.gal : 9 ms
[2021-05-07 23:19:39] [INFO ] Time to serialize properties into /tmp/LTL6674306396750288198.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/LTL2878125475222573469.gal, -t, CGAL, -LTL, /tmp/LTL6674306396750288198.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/LTL2878125475222573469.gal -t CGAL -LTL /tmp/LTL6674306396750288198.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G("((i13.u99.p1013==1)&&(i13.u130.p1256==1))"))||(G("((i16.u152.p1581!=1)||(i16.u166.p1645!=1))")))))
Formula 0 simplified : !F(G"((i13.u99.p1013==1)&&(i13.u130.p1256==1))" | G"((i16.u152.p1581!=1)||(i16.u166.p1645!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5827752016883082247
[2021-05-07 23:19:54] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5827752016883082247
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/ltsmin5827752016883082247]
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/ltsmin5827752016883082247] 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/ltsmin5827752016883082247] 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 ASLink-PT-08a-14 finished in 37705 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 1645 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1645/1645 places, 2545/2545 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 302 transitions
Trivial Post-agglo rules discarded 302 transitions
Performed 302 trivial Post agglomeration. Transition count delta: 302
Iterating post reduction 0 with 302 rules applied. Total rules applied 302 place count 1644 transition count 2243
Reduce places removed 302 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 303 rules applied. Total rules applied 605 place count 1342 transition count 2242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 606 place count 1341 transition count 2242
Performed 205 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 205 Pre rules applied. Total rules applied 606 place count 1341 transition count 2037
Deduced a syphon composed of 205 places in 3 ms
Ensure Unique test removed 68 places
Reduce places removed 273 places and 0 transitions.
Iterating global reduction 3 with 478 rules applied. Total rules applied 1084 place count 1068 transition count 2037
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 10 rules applied. Total rules applied 1094 place count 1063 transition count 2032
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1099 place count 1058 transition count 2032
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 1099 place count 1058 transition count 2008
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 1147 place count 1034 transition count 2008
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1154 place count 1027 transition count 1979
Iterating global reduction 5 with 7 rules applied. Total rules applied 1161 place count 1027 transition count 1979
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 1165 place count 1024 transition count 1978
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1166 place count 1023 transition count 1978
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1166 place count 1023 transition count 1977
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1168 place count 1022 transition count 1977
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1170 place count 1020 transition count 1968
Iterating global reduction 7 with 2 rules applied. Total rules applied 1172 place count 1020 transition count 1968
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1174 place count 1018 transition count 1959
Iterating global reduction 7 with 2 rules applied. Total rules applied 1176 place count 1018 transition count 1959
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1177 place count 1017 transition count 1951
Iterating global reduction 7 with 1 rules applied. Total rules applied 1178 place count 1017 transition count 1951
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1179 place count 1016 transition count 1943
Iterating global reduction 7 with 1 rules applied. Total rules applied 1180 place count 1016 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1181 place count 1015 transition count 1935
Iterating global reduction 7 with 1 rules applied. Total rules applied 1182 place count 1015 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1183 place count 1014 transition count 1927
Iterating global reduction 7 with 1 rules applied. Total rules applied 1184 place count 1014 transition count 1927
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1185 place count 1013 transition count 1919
Iterating global reduction 7 with 1 rules applied. Total rules applied 1186 place count 1013 transition count 1919
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1187 place count 1012 transition count 1911
Iterating global reduction 7 with 1 rules applied. Total rules applied 1188 place count 1012 transition count 1911
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1189 place count 1011 transition count 1903
Iterating global reduction 7 with 1 rules applied. Total rules applied 1190 place count 1011 transition count 1903
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1191 place count 1010 transition count 1895
Iterating global reduction 7 with 1 rules applied. Total rules applied 1192 place count 1010 transition count 1895
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1193 place count 1009 transition count 1887
Iterating global reduction 7 with 1 rules applied. Total rules applied 1194 place count 1009 transition count 1887
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1195 place count 1008 transition count 1879
Iterating global reduction 7 with 1 rules applied. Total rules applied 1196 place count 1008 transition count 1879
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1197 place count 1007 transition count 1871
Iterating global reduction 7 with 1 rules applied. Total rules applied 1198 place count 1007 transition count 1871
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1199 place count 1006 transition count 1863
Iterating global reduction 7 with 1 rules applied. Total rules applied 1200 place count 1006 transition count 1863
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 2 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 7 with 178 rules applied. Total rules applied 1378 place count 917 transition count 1774
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1381 place count 914 transition count 1771
Iterating global reduction 7 with 3 rules applied. Total rules applied 1384 place count 914 transition count 1771
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1388 place count 914 transition count 1771
Applied a total of 1388 rules in 579 ms. Remains 914 /1645 variables (removed 731) and now considering 1771/2545 (removed 774) transitions.
// Phase 1: matrix 1771 rows 914 cols
[2021-05-07 23:19:56] [INFO ] Computed 149 place invariants in 20 ms
[2021-05-07 23:19:57] [INFO ] Implicit Places using invariants in 556 ms returned [90, 96, 101, 117, 219, 220, 290, 296, 301, 317, 318, 393, 399, 404, 420, 421, 456, 498, 504, 509, 526, 596, 602, 607, 623, 624, 730, 731, 801, 807, 812, 831, 883, 887]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 559 ms to find 34 implicit places.
[2021-05-07 23:19:57] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 1771 rows 880 cols
[2021-05-07 23:19:57] [INFO ] Computed 115 place invariants in 19 ms
[2021-05-07 23:19:57] [INFO ] Dead Transitions using invariants and state equation in 701 ms returned []
Starting structural reductions, iteration 1 : 880/1645 places, 1771/2545 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 880 transition count 1756
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 865 transition count 1756
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 30 place count 865 transition count 1732
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 78 place count 841 transition count 1732
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 81 place count 840 transition count 1730
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 83 place count 838 transition count 1730
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 98 place count 823 transition count 1715
Iterating global reduction 4 with 15 rules applied. Total rules applied 113 place count 823 transition count 1715
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 114 place count 823 transition count 1714
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 126 place count 811 transition count 1702
Iterating global reduction 5 with 12 rules applied. Total rules applied 138 place count 811 transition count 1702
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 144 place count 805 transition count 1696
Iterating global reduction 5 with 6 rules applied. Total rules applied 150 place count 805 transition count 1696
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 184 place count 788 transition count 1679
Applied a total of 184 rules in 147 ms. Remains 788 /880 variables (removed 92) and now considering 1679/1771 (removed 92) transitions.
// Phase 1: matrix 1679 rows 788 cols
[2021-05-07 23:19:57] [INFO ] Computed 114 place invariants in 17 ms
[2021-05-07 23:19:58] [INFO ] Implicit Places using invariants in 489 ms returned [93, 96, 173, 179, 184, 186, 189, 270, 273, 354, 357, 417, 438, 519, 522, 599, 605, 610, 612, 615, 696, 699]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 499 ms to find 22 implicit places.
Starting structural reductions, iteration 2 : 766/1645 places, 1679/2545 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 766 transition count 1672
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 759 transition count 1672
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 25 place count 748 transition count 1661
Iterating global reduction 2 with 11 rules applied. Total rules applied 36 place count 748 transition count 1661
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 43 place count 748 transition count 1654
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 47 place count 744 transition count 1650
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 744 transition count 1650
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 53 place count 742 transition count 1648
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 742 transition count 1648
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 63 place count 738 transition count 1644
Applied a total of 63 rules in 123 ms. Remains 738 /766 variables (removed 28) and now considering 1644/1679 (removed 35) transitions.
// Phase 1: matrix 1644 rows 738 cols
[2021-05-07 23:19:58] [INFO ] Computed 92 place invariants in 16 ms
[2021-05-07 23:19:59] [INFO ] Implicit Places using invariants in 494 ms returned [72, 151, 231, 311, 469, 549, 629]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 500 ms to find 7 implicit places.
Starting structural reductions, iteration 3 : 731/1645 places, 1644/2545 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 724 transition count 1637
Applied a total of 14 rules in 48 ms. Remains 724 /731 variables (removed 7) and now considering 1637/1644 (removed 7) transitions.
// Phase 1: matrix 1637 rows 724 cols
[2021-05-07 23:19:59] [INFO ] Computed 85 place invariants in 16 ms
[2021-05-07 23:19:59] [INFO ] Implicit Places using invariants in 442 ms returned []
// Phase 1: matrix 1637 rows 724 cols
[2021-05-07 23:19:59] [INFO ] Computed 85 place invariants in 16 ms
[2021-05-07 23:20:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-07 23:20:01] [INFO ] Implicit Places using invariants and state equation in 2214 ms returned []
Implicit Place search using SMT with State Equation took 2657 ms to find 0 implicit places.
Finished structural reductions, in 4 iterations. Remains : 724/1645 places, 1637/2545 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s419 0) (NEQ s524 0) (OR (NEQ s683 1) (NEQ s708 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 62 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-08a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-15 finished in 5922 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13871000466949449477
[2021-05-07 23:20:01] [INFO ] Too many transitions (2545) to apply POR reductions. Disabling POR matrices.
[2021-05-07 23:20:01] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13871000466949449477
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/ltsmin13871000466949449477]
[2021-05-07 23:20:01] [INFO ] Applying decomposition
[2021-05-07 23:20:01] [INFO ] Flatten gal took : 83 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/graph17430616144778415879.txt, -o, /tmp/graph17430616144778415879.bin, -w, /tmp/graph17430616144778415879.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/graph17430616144778415879.bin, -l, -1, -v, -w, /tmp/graph17430616144778415879.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 23:20:02] [INFO ] Decomposing Gal with order
[2021-05-07 23:20:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 23:20:02] [INFO ] Removed a total of 3575 redundant transitions.
[2021-05-07 23:20:02] [INFO ] Flatten gal took : 134 ms
[2021-05-07 23:20:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 32 ms.
[2021-05-07 23:20:02] [INFO ] Time to serialize gal into /tmp/LTLFireability2175916294428066594.gal : 39 ms
[2021-05-07 23:20:02] [INFO ] Time to serialize properties into /tmp/LTLFireability6929262436632997474.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/LTLFireability2175916294428066594.gal, -t, CGAL, -LTL, /tmp/LTLFireability6929262436632997474.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/LTLFireability2175916294428066594.gal -t CGAL -LTL /tmp/LTLFireability6929262436632997474.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((F(G(!("((i3.u71.p241==1)&&(i3.u134.p474==1))")))))
Formula 0 simplified : !FG!"((i3.u71.p241==1)&&(i3.u134.p474==1))"
Compilation finished in 23973 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13871000466949449477]
Link finished in 56 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin13871000466949449477]
WARNING : LTSmin timed out (>257 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin13871000466949449477]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin13871000466949449477]
WARNING : LTSmin timed out (>257 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin13871000466949449477]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(([]((LTLAPp2==true))||[]((LTLAPp3==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin13871000466949449477]
WARNING : LTSmin timed out (>257 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(([]((LTLAPp2==true))||[]((LTLAPp3==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin13871000466949449477]
Retrying LTSmin with larger timeout 2056 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin13871000466949449477]
Detected timeout of ITS tools.
[2021-05-07 23:42:04] [INFO ] Applying decomposition
[2021-05-07 23:42:04] [INFO ] Flatten gal took : 253 ms
[2021-05-07 23:42:04] [INFO ] Decomposing Gal with order
[2021-05-07 23:42:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 23:42:05] [INFO ] Removed a total of 2953 redundant transitions.
[2021-05-07 23:42:05] [INFO ] Flatten gal took : 510 ms
[2021-05-07 23:42:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 1066 labels/synchronizations in 180 ms.
[2021-05-07 23:42:05] [INFO ] Time to serialize gal into /tmp/LTLFireability5826974449527655761.gal : 26 ms
[2021-05-07 23:42:05] [INFO ] Time to serialize properties into /tmp/LTLFireability6997028754226006233.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/LTLFireability5826974449527655761.gal, -t, CGAL, -LTL, /tmp/LTLFireability6997028754226006233.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/LTLFireability5826974449527655761.gal -t CGAL -LTL /tmp/LTLFireability6997028754226006233.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((F(G(!("((u39.p241==1)&&(u76.p474==1))")))))
Formula 0 simplified : !FG!"((u39.p241==1)&&(u76.p474==1))"
Detected timeout of ITS tools.
[2021-05-08 00:04:07] [INFO ] Flatten gal took : 169 ms
[2021-05-08 00:04:07] [INFO ] Input system was already deterministic with 2545 transitions.
[2021-05-08 00:04:07] [INFO ] Transformed 1645 places.
[2021-05-08 00:04:07] [INFO ] Transformed 2545 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
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-05-08 00:04:37] [INFO ] Time to serialize gal into /tmp/LTLFireability7602468468970109578.gal : 7 ms
[2021-05-08 00:04:37] [INFO ] Time to serialize properties into /tmp/LTLFireability12510571218290077917.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/LTLFireability7602468468970109578.gal, -t, CGAL, -LTL, /tmp/LTLFireability12510571218290077917.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/LTLFireability7602468468970109578.gal -t CGAL -LTL /tmp/LTLFireability12510571218290077917.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(!("((p241==1)&&(p474==1))")))))
Formula 0 simplified : !FG!"((p241==1)&&(p474==1))"
WARNING : LTSmin timed out (>2056 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin13871000466949449477]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin13871000466949449477]

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-08a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ASLink-PT-08a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-tall-162037989500122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-08a.tgz
mv ASLink-PT-08a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;