Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r295-tall-167873948300707.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is PolyORBNT-COL-S10J80, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948300707
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 9.1K Feb 26 01:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 01:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 00:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 03:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Feb 26 02:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 95K Mar 5 18:23 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 PolyORBNT-COL-S10J80-LTLCardinality-00
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-01
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-02
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-03
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-04
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-05
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-06
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-07
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-08
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-09
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678892115519

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J80
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 14:55:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 14:55:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 14:55:17] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 14:55:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 14:55:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 493 ms
[2023-03-15 14:55:17] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1694 PT places and 13742.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-15 14:55:18] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-15 14:55:18] [INFO ] Skeletonized 16 HLPN properties in 9 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10001 steps, including 572 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 22) seen :4
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :8
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 14:55:18] [INFO ] Computed 13 place invariants in 8 ms
[2023-03-15 14:55:18] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-15 14:55:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 14:55:18] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:4
[2023-03-15 14:55:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 14:55:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 14:55:18] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 14:55:18] [INFO ] Flatten gal took : 43 ms
[2023-03-15 14:55:18] [INFO ] Flatten gal took : 10 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-15 14:55:19] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 13580 transitions 119919 arcs in 221 ms.
[2023-03-15 14:55:19] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Deduced a syphon composed of 80 places in 32 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 351 out of 1614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1604 transition count 3390
Applied a total of 10 rules in 187 ms. Remains 1604 /1614 variables (removed 10) and now considering 3390/3390 (removed 0) transitions.
[2023-03-15 14:55:19] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1604 cols
[2023-03-15 14:55:19] [INFO ] Computed 182 place invariants in 240 ms
[2023-03-15 14:55:22] [INFO ] Dead Transitions using invariants and state equation in 2995 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2023-03-15 14:55:22] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2023-03-15 14:55:22] [INFO ] Computed 182 place invariants in 129 ms
[2023-03-15 14:55:23] [INFO ] Implicit Places using invariants in 1391 ms returned []
[2023-03-15 14:55:23] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
[2023-03-15 14:55:23] [INFO ] Invariant cache hit.
[2023-03-15 14:55:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:55:32] [INFO ] Implicit Places using invariants and state equation in 8809 ms returned []
Implicit Place search using SMT with State Equation took 10207 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1604/1614 places, 2775/3390 transitions.
Applied a total of 0 rules in 125 ms. Remains 1604 /1604 variables (removed 0) and now considering 2775/2775 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13525 ms. Remains : 1604/1614 places, 2775/3390 transitions.
Support contains 351 out of 1604 places after structural reductions.
[2023-03-15 14:55:33] [INFO ] Flatten gal took : 243 ms
[2023-03-15 14:55:33] [INFO ] Flatten gal took : 145 ms
[2023-03-15 14:55:33] [INFO ] Input system was already deterministic with 2775 transitions.
Incomplete random walk after 10000 steps, including 556 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 19) seen :14
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 108 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
[2023-03-15 14:55:34] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
[2023-03-15 14:55:34] [INFO ] Invariant cache hit.
[2023-03-15 14:55:34] [INFO ] [Real]Absence check using 176 positive place invariants in 59 ms returned sat
[2023-03-15 14:55:34] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 32 ms returned sat
[2023-03-15 14:55:34] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-15 14:55:35] [INFO ] [Nat]Absence check using 176 positive place invariants in 54 ms returned sat
[2023-03-15 14:55:35] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 34 ms returned sat
[2023-03-15 14:55:35] [INFO ] After 308ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 8 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
Support contains 3 out of 1604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 1604 transition count 2689
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 172 place count 1518 transition count 2689
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 172 place count 1518 transition count 2605
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 340 place count 1434 transition count 2605
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 341 place count 1433 transition count 2604
Iterating global reduction 2 with 1 rules applied. Total rules applied 342 place count 1433 transition count 2604
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 346 place count 1431 transition count 2602
Applied a total of 346 rules in 550 ms. Remains 1431 /1604 variables (removed 173) and now considering 2602/2775 (removed 173) transitions.
[2023-03-15 14:55:35] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2023-03-15 14:55:35] [INFO ] Computed 182 place invariants in 66 ms
[2023-03-15 14:55:37] [INFO ] Dead Transitions using invariants and state equation in 1458 ms found 0 transitions.
[2023-03-15 14:55:37] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 14:55:37] [INFO ] Invariant cache hit.
[2023-03-15 14:55:38] [INFO ] Implicit Places using invariants in 1409 ms returned []
[2023-03-15 14:55:38] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 14:55:38] [INFO ] Invariant cache hit.
[2023-03-15 14:55:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:55:49] [INFO ] Implicit Places using invariants and state equation in 10387 ms returned []
Implicit Place search using SMT with State Equation took 11808 ms to find 0 implicit places.
[2023-03-15 14:55:49] [INFO ] Redundant transitions in 128 ms returned []
[2023-03-15 14:55:49] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 14:55:49] [INFO ] Invariant cache hit.
[2023-03-15 14:55:50] [INFO ] Dead Transitions using invariants and state equation in 1391 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1431/1604 places, 2602/2775 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15353 ms. Remains : 1431/1604 places, 2602/2775 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 3 s1429), p0:(LEQ s82 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 3 ms.
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J80-LTLCardinality-00 finished in 15603 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 1604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1604 transition count 2690
Reduce places removed 85 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 86 rules applied. Total rules applied 171 place count 1519 transition count 2689
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 172 place count 1518 transition count 2689
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 172 place count 1518 transition count 2605
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 340 place count 1434 transition count 2605
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 341 place count 1433 transition count 2604
Iterating global reduction 3 with 1 rules applied. Total rules applied 342 place count 1433 transition count 2604
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 346 place count 1431 transition count 2602
Applied a total of 346 rules in 261 ms. Remains 1431 /1604 variables (removed 173) and now considering 2602/2775 (removed 173) transitions.
[2023-03-15 14:55:51] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2023-03-15 14:55:51] [INFO ] Computed 182 place invariants in 52 ms
[2023-03-15 14:55:52] [INFO ] Dead Transitions using invariants and state equation in 1460 ms found 0 transitions.
[2023-03-15 14:55:52] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 14:55:52] [INFO ] Invariant cache hit.
[2023-03-15 14:55:54] [INFO ] Implicit Places using invariants in 1458 ms returned []
[2023-03-15 14:55:54] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 14:55:54] [INFO ] Invariant cache hit.
[2023-03-15 14:55:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:56:03] [INFO ] Implicit Places using invariants and state equation in 9630 ms returned []
Implicit Place search using SMT with State Equation took 11115 ms to find 0 implicit places.
[2023-03-15 14:56:03] [INFO ] Redundant transitions in 125 ms returned []
[2023-03-15 14:56:03] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 14:56:03] [INFO ] Invariant cache hit.
[2023-03-15 14:56:05] [INFO ] Dead Transitions using invariants and state equation in 1367 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1431/1604 places, 2602/2775 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14344 ms. Remains : 1431/1604 places, 2602/2775 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1429 s497), p1:(GT 1 s414)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8039 reset in 1246 ms.
Product exploration explored 100000 steps with 7989 reset in 1216 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 678 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:56:08] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 14:56:08] [INFO ] Invariant cache hit.
[2023-03-15 14:56:08] [INFO ] [Real]Absence check using 175 positive place invariants in 42 ms returned sat
[2023-03-15 14:56:08] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-15 14:56:09] [INFO ] After 1032ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:56:09] [INFO ] [Nat]Absence check using 175 positive place invariants in 42 ms returned sat
[2023-03-15 14:56:09] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-15 14:56:10] [INFO ] After 1145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:56:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:56:11] [INFO ] After 412ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:56:12] [INFO ] Deduced a trap composed of 582 places in 612 ms of which 4 ms to minimize.
[2023-03-15 14:56:13] [INFO ] Deduced a trap composed of 526 places in 679 ms of which 1 ms to minimize.
[2023-03-15 14:56:14] [INFO ] Deduced a trap composed of 600 places in 623 ms of which 1 ms to minimize.
[2023-03-15 14:56:15] [INFO ] Deduced a trap composed of 597 places in 652 ms of which 3 ms to minimize.
[2023-03-15 14:56:16] [INFO ] Deduced a trap composed of 591 places in 681 ms of which 2 ms to minimize.
[2023-03-15 14:56:16] [INFO ] Deduced a trap composed of 621 places in 606 ms of which 1 ms to minimize.
[2023-03-15 14:56:17] [INFO ] Deduced a trap composed of 591 places in 626 ms of which 2 ms to minimize.
[2023-03-15 14:56:18] [INFO ] Deduced a trap composed of 615 places in 669 ms of which 3 ms to minimize.
[2023-03-15 14:56:19] [INFO ] Deduced a trap composed of 594 places in 595 ms of which 1 ms to minimize.
[2023-03-15 14:56:19] [INFO ] Deduced a trap composed of 621 places in 595 ms of which 2 ms to minimize.
[2023-03-15 14:56:20] [INFO ] Deduced a trap composed of 591 places in 649 ms of which 1 ms to minimize.
[2023-03-15 14:56:21] [INFO ] Deduced a trap composed of 618 places in 627 ms of which 1 ms to minimize.
[2023-03-15 14:56:22] [INFO ] Deduced a trap composed of 600 places in 647 ms of which 1 ms to minimize.
[2023-03-15 14:56:22] [INFO ] Deduced a trap composed of 606 places in 600 ms of which 1 ms to minimize.
[2023-03-15 14:56:23] [INFO ] Deduced a trap composed of 609 places in 660 ms of which 2 ms to minimize.
[2023-03-15 14:56:24] [INFO ] Deduced a trap composed of 603 places in 595 ms of which 1 ms to minimize.
[2023-03-15 14:56:24] [INFO ] Deduced a trap composed of 606 places in 593 ms of which 1 ms to minimize.
[2023-03-15 14:56:25] [INFO ] Deduced a trap composed of 606 places in 594 ms of which 1 ms to minimize.
[2023-03-15 14:56:26] [INFO ] Deduced a trap composed of 615 places in 612 ms of which 2 ms to minimize.
[2023-03-15 14:56:27] [INFO ] Deduced a trap composed of 606 places in 590 ms of which 1 ms to minimize.
[2023-03-15 14:56:27] [INFO ] Deduced a trap composed of 597 places in 586 ms of which 1 ms to minimize.
[2023-03-15 14:56:28] [INFO ] Deduced a trap composed of 588 places in 592 ms of which 1 ms to minimize.
[2023-03-15 14:56:29] [INFO ] Deduced a trap composed of 591 places in 591 ms of which 1 ms to minimize.
[2023-03-15 14:56:30] [INFO ] Deduced a trap composed of 621 places in 589 ms of which 1 ms to minimize.
[2023-03-15 14:56:30] [INFO ] Deduced a trap composed of 615 places in 597 ms of which 1 ms to minimize.
[2023-03-15 14:56:31] [INFO ] Deduced a trap composed of 594 places in 588 ms of which 1 ms to minimize.
[2023-03-15 14:56:32] [INFO ] Deduced a trap composed of 594 places in 590 ms of which 1 ms to minimize.
[2023-03-15 14:56:32] [INFO ] Deduced a trap composed of 600 places in 589 ms of which 1 ms to minimize.
[2023-03-15 14:56:33] [INFO ] Deduced a trap composed of 609 places in 577 ms of which 1 ms to minimize.
[2023-03-15 14:56:34] [INFO ] Deduced a trap composed of 591 places in 589 ms of which 2 ms to minimize.
[2023-03-15 14:56:34] [INFO ] Deduced a trap composed of 603 places in 592 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 14:56:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 14:56:34] [INFO ] After 25556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 1431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 102 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2023-03-15 14:56:34] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 14:56:34] [INFO ] Invariant cache hit.
[2023-03-15 14:56:36] [INFO ] Dead Transitions using invariants and state equation in 1424 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1528 ms. Remains : 1431/1431 places, 2602/2602 transitions.
Incomplete random walk after 10000 steps, including 711 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 260570 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 260570 steps, saw 43168 distinct states, run finished after 3002 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:56:39] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 14:56:39] [INFO ] Invariant cache hit.
[2023-03-15 14:56:39] [INFO ] [Real]Absence check using 175 positive place invariants in 51 ms returned sat
[2023-03-15 14:56:39] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-15 14:56:40] [INFO ] After 1045ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:56:40] [INFO ] [Nat]Absence check using 175 positive place invariants in 41 ms returned sat
[2023-03-15 14:56:40] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 38 ms returned sat
[2023-03-15 14:56:42] [INFO ] After 1183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:56:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:56:42] [INFO ] After 420ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:56:43] [INFO ] Deduced a trap composed of 582 places in 585 ms of which 1 ms to minimize.
[2023-03-15 14:56:44] [INFO ] Deduced a trap composed of 526 places in 661 ms of which 2 ms to minimize.
[2023-03-15 14:56:46] [INFO ] Deduced a trap composed of 600 places in 656 ms of which 1 ms to minimize.
[2023-03-15 14:56:46] [INFO ] Deduced a trap composed of 597 places in 637 ms of which 1 ms to minimize.
[2023-03-15 14:56:47] [INFO ] Deduced a trap composed of 591 places in 635 ms of which 1 ms to minimize.
[2023-03-15 14:56:48] [INFO ] Deduced a trap composed of 621 places in 640 ms of which 1 ms to minimize.
[2023-03-15 14:56:49] [INFO ] Deduced a trap composed of 591 places in 643 ms of which 1 ms to minimize.
[2023-03-15 14:56:49] [INFO ] Deduced a trap composed of 615 places in 641 ms of which 2 ms to minimize.
[2023-03-15 14:56:50] [INFO ] Deduced a trap composed of 594 places in 647 ms of which 2 ms to minimize.
[2023-03-15 14:56:51] [INFO ] Deduced a trap composed of 621 places in 634 ms of which 2 ms to minimize.
[2023-03-15 14:56:52] [INFO ] Deduced a trap composed of 591 places in 642 ms of which 1 ms to minimize.
[2023-03-15 14:56:52] [INFO ] Deduced a trap composed of 618 places in 630 ms of which 1 ms to minimize.
[2023-03-15 14:56:53] [INFO ] Deduced a trap composed of 600 places in 636 ms of which 1 ms to minimize.
[2023-03-15 14:56:54] [INFO ] Deduced a trap composed of 606 places in 637 ms of which 1 ms to minimize.
[2023-03-15 14:56:55] [INFO ] Deduced a trap composed of 609 places in 634 ms of which 2 ms to minimize.
[2023-03-15 14:56:55] [INFO ] Deduced a trap composed of 603 places in 650 ms of which 1 ms to minimize.
[2023-03-15 14:56:56] [INFO ] Deduced a trap composed of 606 places in 646 ms of which 1 ms to minimize.
[2023-03-15 14:56:57] [INFO ] Deduced a trap composed of 606 places in 639 ms of which 1 ms to minimize.
[2023-03-15 14:56:57] [INFO ] Deduced a trap composed of 615 places in 587 ms of which 1 ms to minimize.
[2023-03-15 14:56:58] [INFO ] Deduced a trap composed of 606 places in 581 ms of which 2 ms to minimize.
[2023-03-15 14:56:59] [INFO ] Deduced a trap composed of 597 places in 582 ms of which 1 ms to minimize.
[2023-03-15 14:57:00] [INFO ] Deduced a trap composed of 588 places in 599 ms of which 1 ms to minimize.
[2023-03-15 14:57:00] [INFO ] Deduced a trap composed of 591 places in 601 ms of which 1 ms to minimize.
[2023-03-15 14:57:01] [INFO ] Deduced a trap composed of 621 places in 586 ms of which 1 ms to minimize.
[2023-03-15 14:57:02] [INFO ] Deduced a trap composed of 615 places in 597 ms of which 1 ms to minimize.
[2023-03-15 14:57:02] [INFO ] Deduced a trap composed of 594 places in 634 ms of which 4 ms to minimize.
[2023-03-15 14:57:03] [INFO ] Deduced a trap composed of 594 places in 591 ms of which 1 ms to minimize.
[2023-03-15 14:57:04] [INFO ] Deduced a trap composed of 600 places in 588 ms of which 1 ms to minimize.
[2023-03-15 14:57:05] [INFO ] Deduced a trap composed of 609 places in 597 ms of which 1 ms to minimize.
[2023-03-15 14:57:05] [INFO ] Deduced a trap composed of 591 places in 588 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 14:57:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 14:57:05] [INFO ] After 25172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 1431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 69 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1431/1431 places, 2602/2602 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 67 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2023-03-15 14:57:05] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 14:57:05] [INFO ] Invariant cache hit.
[2023-03-15 14:57:07] [INFO ] Implicit Places using invariants in 1396 ms returned []
[2023-03-15 14:57:07] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 14:57:07] [INFO ] Invariant cache hit.
[2023-03-15 14:57:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:57:16] [INFO ] Implicit Places using invariants and state equation in 9436 ms returned []
Implicit Place search using SMT with State Equation took 10838 ms to find 0 implicit places.
[2023-03-15 14:57:16] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-15 14:57:16] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 14:57:16] [INFO ] Invariant cache hit.
[2023-03-15 14:57:18] [INFO ] Dead Transitions using invariants and state equation in 1375 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12339 ms. Remains : 1431/1431 places, 2602/2602 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1431 transition count 2593
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 1431 transition count 2592
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 1430 transition count 2592
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1430 transition count 2591
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1429 transition count 2591
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1429 transition count 2581
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 1419 transition count 2581
Applied a total of 33 rules in 269 ms. Remains 1419 /1431 variables (removed 12) and now considering 2581/2602 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2581 rows 1419 cols
[2023-03-15 14:57:18] [INFO ] Computed 182 place invariants in 61 ms
[2023-03-15 14:57:18] [INFO ] [Real]Absence check using 175 positive place invariants in 43 ms returned sat
[2023-03-15 14:57:18] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-15 14:57:19] [INFO ] After 1251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:57:19] [INFO ] [Nat]Absence check using 175 positive place invariants in 41 ms returned sat
[2023-03-15 14:57:19] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-15 14:57:21] [INFO ] After 1061ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:57:21] [INFO ] Deduced a trap composed of 589 places in 616 ms of which 2 ms to minimize.
[2023-03-15 14:57:22] [INFO ] Deduced a trap composed of 592 places in 557 ms of which 1 ms to minimize.
[2023-03-15 14:57:23] [INFO ] Deduced a trap composed of 616 places in 563 ms of which 1 ms to minimize.
[2023-03-15 14:57:23] [INFO ] Deduced a trap composed of 604 places in 556 ms of which 3 ms to minimize.
[2023-03-15 14:57:24] [INFO ] Deduced a trap composed of 616 places in 567 ms of which 1 ms to minimize.
[2023-03-15 14:57:25] [INFO ] Deduced a trap composed of 601 places in 548 ms of which 2 ms to minimize.
[2023-03-15 14:57:25] [INFO ] Deduced a trap composed of 601 places in 564 ms of which 5 ms to minimize.
[2023-03-15 14:57:26] [INFO ] Deduced a trap composed of 592 places in 544 ms of which 2 ms to minimize.
[2023-03-15 14:57:27] [INFO ] Deduced a trap composed of 595 places in 556 ms of which 1 ms to minimize.
[2023-03-15 14:57:27] [INFO ] Deduced a trap composed of 598 places in 562 ms of which 1 ms to minimize.
[2023-03-15 14:57:28] [INFO ] Deduced a trap composed of 619 places in 557 ms of which 1 ms to minimize.
[2023-03-15 14:57:28] [INFO ] Deduced a trap composed of 607 places in 551 ms of which 2 ms to minimize.
[2023-03-15 14:57:29] [INFO ] Deduced a trap composed of 589 places in 552 ms of which 1 ms to minimize.
[2023-03-15 14:57:30] [INFO ] Deduced a trap composed of 601 places in 548 ms of which 1 ms to minimize.
[2023-03-15 14:57:30] [INFO ] Deduced a trap composed of 592 places in 547 ms of which 1 ms to minimize.
[2023-03-15 14:57:31] [INFO ] Deduced a trap composed of 595 places in 551 ms of which 2 ms to minimize.
[2023-03-15 14:57:32] [INFO ] Deduced a trap composed of 598 places in 554 ms of which 1 ms to minimize.
[2023-03-15 14:57:32] [INFO ] Deduced a trap composed of 592 places in 565 ms of which 1 ms to minimize.
[2023-03-15 14:57:33] [INFO ] Deduced a trap composed of 613 places in 562 ms of which 1 ms to minimize.
[2023-03-15 14:57:33] [INFO ] Deduced a trap composed of 607 places in 551 ms of which 1 ms to minimize.
[2023-03-15 14:57:34] [INFO ] Deduced a trap composed of 589 places in 557 ms of which 1 ms to minimize.
[2023-03-15 14:57:35] [INFO ] Deduced a trap composed of 592 places in 546 ms of which 1 ms to minimize.
[2023-03-15 14:57:35] [INFO ] Deduced a trap composed of 610 places in 556 ms of which 1 ms to minimize.
[2023-03-15 14:57:36] [INFO ] Deduced a trap composed of 601 places in 550 ms of which 1 ms to minimize.
[2023-03-15 14:57:37] [INFO ] Deduced a trap composed of 604 places in 551 ms of which 2 ms to minimize.
[2023-03-15 14:57:37] [INFO ] Deduced a trap composed of 592 places in 563 ms of which 1 ms to minimize.
[2023-03-15 14:57:38] [INFO ] Deduced a trap composed of 592 places in 566 ms of which 2 ms to minimize.
[2023-03-15 14:57:38] [INFO ] Deduced a trap composed of 598 places in 560 ms of which 1 ms to minimize.
[2023-03-15 14:57:39] [INFO ] Deduced a trap composed of 583 places in 556 ms of which 2 ms to minimize.
[2023-03-15 14:57:40] [INFO ] Deduced a trap composed of 592 places in 561 ms of which 1 ms to minimize.
[2023-03-15 14:57:40] [INFO ] Deduced a trap composed of 598 places in 563 ms of which 1 ms to minimize.
[2023-03-15 14:57:41] [INFO ] Deduced a trap composed of 607 places in 544 ms of which 1 ms to minimize.
[2023-03-15 14:57:42] [INFO ] Deduced a trap composed of 607 places in 551 ms of which 1 ms to minimize.
[2023-03-15 14:57:42] [INFO ] Deduced a trap composed of 613 places in 572 ms of which 1 ms to minimize.
[2023-03-15 14:57:43] [INFO ] Deduced a trap composed of 613 places in 538 ms of which 1 ms to minimize.
[2023-03-15 14:57:44] [INFO ] Deduced a trap composed of 592 places in 549 ms of which 1 ms to minimize.
[2023-03-15 14:57:44] [INFO ] Deduced a trap composed of 607 places in 552 ms of which 1 ms to minimize.
[2023-03-15 14:57:45] [INFO ] Deduced a trap composed of 601 places in 548 ms of which 1 ms to minimize.
[2023-03-15 14:57:45] [INFO ] Deduced a trap composed of 625 places in 556 ms of which 1 ms to minimize.
[2023-03-15 14:57:46] [INFO ] Deduced a trap composed of 577 places in 558 ms of which 1 ms to minimize.
[2023-03-15 14:57:47] [INFO ] Deduced a trap composed of 589 places in 553 ms of which 1 ms to minimize.
[2023-03-15 14:57:47] [INFO ] Deduced a trap composed of 601 places in 580 ms of which 1 ms to minimize.
[2023-03-15 14:57:48] [INFO ] Deduced a trap composed of 601 places in 551 ms of which 1 ms to minimize.
[2023-03-15 14:57:49] [INFO ] Deduced a trap composed of 610 places in 546 ms of which 1 ms to minimize.
[2023-03-15 14:57:49] [INFO ] Deduced a trap composed of 610 places in 565 ms of which 2 ms to minimize.
[2023-03-15 14:57:50] [INFO ] Deduced a trap composed of 598 places in 548 ms of which 1 ms to minimize.
[2023-03-15 14:57:51] [INFO ] Deduced a trap composed of 586 places in 554 ms of which 1 ms to minimize.
[2023-03-15 14:57:51] [INFO ] Deduced a trap composed of 598 places in 545 ms of which 1 ms to minimize.
[2023-03-15 14:57:52] [INFO ] Deduced a trap composed of 619 places in 549 ms of which 1 ms to minimize.
[2023-03-15 14:57:52] [INFO ] Deduced a trap composed of 604 places in 547 ms of which 1 ms to minimize.
[2023-03-15 14:57:53] [INFO ] Deduced a trap composed of 604 places in 548 ms of which 1 ms to minimize.
[2023-03-15 14:57:54] [INFO ] Deduced a trap composed of 601 places in 538 ms of which 1 ms to minimize.
[2023-03-15 14:57:54] [INFO ] Deduced a trap composed of 622 places in 558 ms of which 1 ms to minimize.
[2023-03-15 14:57:55] [INFO ] Deduced a trap composed of 610 places in 563 ms of which 1 ms to minimize.
[2023-03-15 14:57:56] [INFO ] Deduced a trap composed of 613 places in 553 ms of which 1 ms to minimize.
[2023-03-15 14:57:56] [INFO ] Deduced a trap composed of 604 places in 565 ms of which 2 ms to minimize.
[2023-03-15 14:57:57] [INFO ] Deduced a trap composed of 598 places in 557 ms of which 1 ms to minimize.
[2023-03-15 14:57:57] [INFO ] Deduced a trap composed of 598 places in 554 ms of which 1 ms to minimize.
[2023-03-15 14:57:58] [INFO ] Deduced a trap composed of 616 places in 555 ms of which 1 ms to minimize.
[2023-03-15 14:57:59] [INFO ] Deduced a trap composed of 598 places in 560 ms of which 1 ms to minimize.
[2023-03-15 14:57:59] [INFO ] Deduced a trap composed of 601 places in 554 ms of which 1 ms to minimize.
[2023-03-15 14:58:00] [INFO ] Deduced a trap composed of 601 places in 559 ms of which 2 ms to minimize.
[2023-03-15 14:58:01] [INFO ] Deduced a trap composed of 592 places in 558 ms of which 1 ms to minimize.
[2023-03-15 14:58:01] [INFO ] Deduced a trap composed of 613 places in 573 ms of which 2 ms to minimize.
[2023-03-15 14:58:02] [INFO ] Deduced a trap composed of 598 places in 562 ms of which 1 ms to minimize.
[2023-03-15 14:58:03] [INFO ] Deduced a trap composed of 580 places in 551 ms of which 1 ms to minimize.
[2023-03-15 14:58:03] [INFO ] Deduced a trap composed of 604 places in 560 ms of which 1 ms to minimize.
[2023-03-15 14:58:04] [INFO ] Deduced a trap composed of 595 places in 551 ms of which 1 ms to minimize.
[2023-03-15 14:58:05] [INFO ] Deduced a trap composed of 595 places in 558 ms of which 1 ms to minimize.
[2023-03-15 14:58:05] [INFO ] Deduced a trap composed of 613 places in 556 ms of which 1 ms to minimize.
[2023-03-15 14:58:06] [INFO ] Deduced a trap composed of 601 places in 552 ms of which 1 ms to minimize.
[2023-03-15 14:58:06] [INFO ] Deduced a trap composed of 601 places in 544 ms of which 2 ms to minimize.
[2023-03-15 14:58:07] [INFO ] Deduced a trap composed of 613 places in 561 ms of which 1 ms to minimize.
[2023-03-15 14:58:08] [INFO ] Deduced a trap composed of 580 places in 559 ms of which 2 ms to minimize.
[2023-03-15 14:58:08] [INFO ] Deduced a trap composed of 595 places in 552 ms of which 1 ms to minimize.
[2023-03-15 14:58:09] [INFO ] Deduced a trap composed of 613 places in 564 ms of which 1 ms to minimize.
[2023-03-15 14:58:10] [INFO ] Deduced a trap composed of 601 places in 568 ms of which 1 ms to minimize.
[2023-03-15 14:58:10] [INFO ] Deduced a trap composed of 595 places in 577 ms of which 1 ms to minimize.
[2023-03-15 14:58:11] [INFO ] Deduced a trap composed of 613 places in 560 ms of which 2 ms to minimize.
[2023-03-15 14:58:12] [INFO ] Deduced a trap composed of 604 places in 538 ms of which 1 ms to minimize.
[2023-03-15 14:58:12] [INFO ] Deduced a trap composed of 610 places in 607 ms of which 1 ms to minimize.
[2023-03-15 14:58:13] [INFO ] Deduced a trap composed of 598 places in 551 ms of which 2 ms to minimize.
[2023-03-15 14:58:14] [INFO ] Deduced a trap composed of 604 places in 549 ms of which 1 ms to minimize.
[2023-03-15 14:58:14] [INFO ] Deduced a trap composed of 607 places in 600 ms of which 1 ms to minimize.
[2023-03-15 14:58:15] [INFO ] Deduced a trap composed of 604 places in 601 ms of which 1 ms to minimize.
[2023-03-15 14:58:16] [INFO ] Deduced a trap composed of 598 places in 605 ms of which 1 ms to minimize.
[2023-03-15 14:58:16] [INFO ] Deduced a trap composed of 592 places in 554 ms of which 1 ms to minimize.
[2023-03-15 14:58:17] [INFO ] Deduced a trap composed of 592 places in 555 ms of which 1 ms to minimize.
[2023-03-15 14:58:18] [INFO ] Deduced a trap composed of 586 places in 607 ms of which 1 ms to minimize.
[2023-03-15 14:58:18] [INFO ] Deduced a trap composed of 598 places in 550 ms of which 1 ms to minimize.
[2023-03-15 14:58:19] [INFO ] Deduced a trap composed of 598 places in 547 ms of which 1 ms to minimize.
[2023-03-15 14:58:20] [INFO ] Deduced a trap composed of 610 places in 602 ms of which 2 ms to minimize.
[2023-03-15 14:58:20] [INFO ] Deduced a trap composed of 613 places in 615 ms of which 2 ms to minimize.
[2023-03-15 14:58:21] [INFO ] Deduced a trap composed of 589 places in 607 ms of which 1 ms to minimize.
[2023-03-15 14:58:22] [INFO ] Deduced a trap composed of 601 places in 561 ms of which 1 ms to minimize.
[2023-03-15 14:58:22] [INFO ] Deduced a trap composed of 595 places in 552 ms of which 1 ms to minimize.
[2023-03-15 14:58:23] [INFO ] Deduced a trap composed of 610 places in 618 ms of which 1 ms to minimize.
[2023-03-15 14:58:24] [INFO ] Deduced a trap composed of 604 places in 551 ms of which 1 ms to minimize.
[2023-03-15 14:58:24] [INFO ] Deduced a trap composed of 604 places in 544 ms of which 1 ms to minimize.
[2023-03-15 14:58:25] [INFO ] Deduced a trap composed of 610 places in 569 ms of which 1 ms to minimize.
[2023-03-15 14:58:26] [INFO ] Deduced a trap composed of 601 places in 646 ms of which 1 ms to minimize.
[2023-03-15 14:58:26] [INFO ] Deduced a trap composed of 589 places in 603 ms of which 1 ms to minimize.
[2023-03-15 14:58:27] [INFO ] Deduced a trap composed of 604 places in 612 ms of which 1 ms to minimize.
[2023-03-15 14:58:29] [INFO ] Deduced a trap composed of 592 places in 555 ms of which 1 ms to minimize.
[2023-03-15 14:58:29] [INFO ] Deduced a trap composed of 583 places in 548 ms of which 1 ms to minimize.
[2023-03-15 14:58:30] [INFO ] Deduced a trap composed of 592 places in 544 ms of which 1 ms to minimize.
[2023-03-15 14:58:31] [INFO ] Deduced a trap composed of 598 places in 563 ms of which 1 ms to minimize.
[2023-03-15 14:58:31] [INFO ] Deduced a trap composed of 601 places in 544 ms of which 1 ms to minimize.
[2023-03-15 14:58:32] [INFO ] Deduced a trap composed of 595 places in 556 ms of which 1 ms to minimize.
[2023-03-15 14:58:33] [INFO ] Deduced a trap composed of 607 places in 545 ms of which 1 ms to minimize.
[2023-03-15 14:58:35] [INFO ] Deduced a trap composed of 601 places in 549 ms of which 2 ms to minimize.
[2023-03-15 14:58:44] [INFO ] Deduced a trap composed of 622 places in 551 ms of which 1 ms to minimize.
[2023-03-15 14:58:44] [INFO ] Deduced a trap composed of 583 places in 554 ms of which 2 ms to minimize.
[2023-03-15 14:58:45] [INFO ] Deduced a trap composed of 619 places in 551 ms of which 2 ms to minimize.
[2023-03-15 14:58:46] [INFO ] Deduced a trap composed of 610 places in 563 ms of which 1 ms to minimize.
[2023-03-15 14:58:46] [INFO ] Deduced a trap composed of 610 places in 557 ms of which 1 ms to minimize.
[2023-03-15 14:58:47] [INFO ] Deduced a trap composed of 604 places in 558 ms of which 1 ms to minimize.
[2023-03-15 14:58:48] [INFO ] Deduced a trap composed of 595 places in 545 ms of which 1 ms to minimize.
[2023-03-15 15:01:04] [INFO ] Trap strengthening (SAT) tested/added 118/118 trap constraints in 223436 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 15:01:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 15:01:04] [INFO ] After 225016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1431 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 64 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2023-03-15 15:01:05] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2023-03-15 15:01:05] [INFO ] Computed 182 place invariants in 60 ms
[2023-03-15 15:01:06] [INFO ] Dead Transitions using invariants and state equation in 1413 ms found 0 transitions.
[2023-03-15 15:01:06] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 15:01:06] [INFO ] Invariant cache hit.
[2023-03-15 15:01:07] [INFO ] Implicit Places using invariants in 1408 ms returned []
[2023-03-15 15:01:07] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 15:01:07] [INFO ] Invariant cache hit.
[2023-03-15 15:01:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:01:18] [INFO ] Implicit Places using invariants and state equation in 10419 ms returned []
Implicit Place search using SMT with State Equation took 11830 ms to find 0 implicit places.
[2023-03-15 15:01:18] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-15 15:01:18] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 15:01:18] [INFO ] Invariant cache hit.
[2023-03-15 15:01:19] [INFO ] Dead Transitions using invariants and state equation in 1359 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14734 ms. Remains : 1431/1431 places, 2602/2602 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 700 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 15:01:20] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 15:01:20] [INFO ] Invariant cache hit.
[2023-03-15 15:01:20] [INFO ] [Real]Absence check using 175 positive place invariants in 44 ms returned sat
[2023-03-15 15:01:20] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-15 15:01:21] [INFO ] After 1027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 15:01:21] [INFO ] [Nat]Absence check using 175 positive place invariants in 40 ms returned sat
[2023-03-15 15:01:21] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-15 15:01:22] [INFO ] After 1202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 15:01:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:01:23] [INFO ] After 426ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 15:01:24] [INFO ] Deduced a trap composed of 582 places in 582 ms of which 1 ms to minimize.
[2023-03-15 15:01:25] [INFO ] Deduced a trap composed of 526 places in 657 ms of which 1 ms to minimize.
[2023-03-15 15:01:26] [INFO ] Deduced a trap composed of 600 places in 593 ms of which 2 ms to minimize.
[2023-03-15 15:01:27] [INFO ] Deduced a trap composed of 597 places in 589 ms of which 1 ms to minimize.
[2023-03-15 15:01:28] [INFO ] Deduced a trap composed of 591 places in 587 ms of which 1 ms to minimize.
[2023-03-15 15:01:28] [INFO ] Deduced a trap composed of 621 places in 582 ms of which 1 ms to minimize.
[2023-03-15 15:01:29] [INFO ] Deduced a trap composed of 591 places in 604 ms of which 1 ms to minimize.
[2023-03-15 15:01:30] [INFO ] Deduced a trap composed of 615 places in 597 ms of which 1 ms to minimize.
[2023-03-15 15:01:30] [INFO ] Deduced a trap composed of 594 places in 597 ms of which 1 ms to minimize.
[2023-03-15 15:01:31] [INFO ] Deduced a trap composed of 621 places in 605 ms of which 1 ms to minimize.
[2023-03-15 15:01:32] [INFO ] Deduced a trap composed of 591 places in 594 ms of which 2 ms to minimize.
[2023-03-15 15:01:33] [INFO ] Deduced a trap composed of 618 places in 594 ms of which 1 ms to minimize.
[2023-03-15 15:01:33] [INFO ] Deduced a trap composed of 600 places in 594 ms of which 1 ms to minimize.
[2023-03-15 15:01:34] [INFO ] Deduced a trap composed of 606 places in 590 ms of which 1 ms to minimize.
[2023-03-15 15:01:35] [INFO ] Deduced a trap composed of 609 places in 592 ms of which 1 ms to minimize.
[2023-03-15 15:01:35] [INFO ] Deduced a trap composed of 603 places in 603 ms of which 1 ms to minimize.
[2023-03-15 15:01:36] [INFO ] Deduced a trap composed of 606 places in 599 ms of which 1 ms to minimize.
[2023-03-15 15:01:37] [INFO ] Deduced a trap composed of 606 places in 588 ms of which 1 ms to minimize.
[2023-03-15 15:01:37] [INFO ] Deduced a trap composed of 615 places in 604 ms of which 2 ms to minimize.
[2023-03-15 15:01:38] [INFO ] Deduced a trap composed of 606 places in 592 ms of which 1 ms to minimize.
[2023-03-15 15:01:39] [INFO ] Deduced a trap composed of 597 places in 598 ms of which 1 ms to minimize.
[2023-03-15 15:01:40] [INFO ] Deduced a trap composed of 588 places in 600 ms of which 1 ms to minimize.
[2023-03-15 15:01:40] [INFO ] Deduced a trap composed of 591 places in 597 ms of which 1 ms to minimize.
[2023-03-15 15:01:41] [INFO ] Deduced a trap composed of 621 places in 593 ms of which 1 ms to minimize.
[2023-03-15 15:01:42] [INFO ] Deduced a trap composed of 615 places in 597 ms of which 2 ms to minimize.
[2023-03-15 15:01:42] [INFO ] Deduced a trap composed of 594 places in 594 ms of which 1 ms to minimize.
[2023-03-15 15:01:43] [INFO ] Deduced a trap composed of 594 places in 610 ms of which 1 ms to minimize.
[2023-03-15 15:01:44] [INFO ] Deduced a trap composed of 600 places in 594 ms of which 1 ms to minimize.
[2023-03-15 15:01:44] [INFO ] Deduced a trap composed of 609 places in 589 ms of which 1 ms to minimize.
[2023-03-15 15:01:45] [INFO ] Deduced a trap composed of 591 places in 591 ms of which 1 ms to minimize.
[2023-03-15 15:01:46] [INFO ] Deduced a trap composed of 603 places in 588 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 15:01:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 15:01:46] [INFO ] After 25055ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 1431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 82 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2023-03-15 15:01:46] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 15:01:46] [INFO ] Invariant cache hit.
[2023-03-15 15:01:47] [INFO ] Dead Transitions using invariants and state equation in 1383 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1466 ms. Remains : 1431/1431 places, 2602/2602 transitions.
Incomplete random walk after 10000 steps, including 717 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 262970 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 262970 steps, saw 43515 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 15:01:50] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 15:01:50] [INFO ] Invariant cache hit.
[2023-03-15 15:01:51] [INFO ] [Real]Absence check using 175 positive place invariants in 41 ms returned sat
[2023-03-15 15:01:51] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-15 15:01:51] [INFO ] After 1026ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 15:01:52] [INFO ] [Nat]Absence check using 175 positive place invariants in 43 ms returned sat
[2023-03-15 15:01:52] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-15 15:01:53] [INFO ] After 1179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 15:01:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:01:53] [INFO ] After 421ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 15:01:55] [INFO ] Deduced a trap composed of 582 places in 587 ms of which 1 ms to minimize.
[2023-03-15 15:01:55] [INFO ] Deduced a trap composed of 526 places in 652 ms of which 1 ms to minimize.
[2023-03-15 15:01:57] [INFO ] Deduced a trap composed of 600 places in 604 ms of which 1 ms to minimize.
[2023-03-15 15:01:58] [INFO ] Deduced a trap composed of 597 places in 579 ms of which 1 ms to minimize.
[2023-03-15 15:01:58] [INFO ] Deduced a trap composed of 591 places in 608 ms of which 1 ms to minimize.
[2023-03-15 15:01:59] [INFO ] Deduced a trap composed of 621 places in 589 ms of which 1 ms to minimize.
[2023-03-15 15:02:00] [INFO ] Deduced a trap composed of 591 places in 592 ms of which 1 ms to minimize.
[2023-03-15 15:02:00] [INFO ] Deduced a trap composed of 615 places in 593 ms of which 1 ms to minimize.
[2023-03-15 15:02:01] [INFO ] Deduced a trap composed of 594 places in 590 ms of which 1 ms to minimize.
[2023-03-15 15:02:02] [INFO ] Deduced a trap composed of 621 places in 597 ms of which 1 ms to minimize.
[2023-03-15 15:02:03] [INFO ] Deduced a trap composed of 591 places in 586 ms of which 1 ms to minimize.
[2023-03-15 15:02:03] [INFO ] Deduced a trap composed of 618 places in 604 ms of which 1 ms to minimize.
[2023-03-15 15:02:04] [INFO ] Deduced a trap composed of 600 places in 609 ms of which 1 ms to minimize.
[2023-03-15 15:02:05] [INFO ] Deduced a trap composed of 606 places in 600 ms of which 2 ms to minimize.
[2023-03-15 15:02:05] [INFO ] Deduced a trap composed of 609 places in 588 ms of which 1 ms to minimize.
[2023-03-15 15:02:06] [INFO ] Deduced a trap composed of 603 places in 594 ms of which 1 ms to minimize.
[2023-03-15 15:02:07] [INFO ] Deduced a trap composed of 606 places in 593 ms of which 1 ms to minimize.
[2023-03-15 15:02:07] [INFO ] Deduced a trap composed of 606 places in 600 ms of which 1 ms to minimize.
[2023-03-15 15:02:08] [INFO ] Deduced a trap composed of 615 places in 597 ms of which 1 ms to minimize.
[2023-03-15 15:02:09] [INFO ] Deduced a trap composed of 606 places in 602 ms of which 1 ms to minimize.
[2023-03-15 15:02:10] [INFO ] Deduced a trap composed of 597 places in 589 ms of which 2 ms to minimize.
[2023-03-15 15:02:10] [INFO ] Deduced a trap composed of 588 places in 607 ms of which 2 ms to minimize.
[2023-03-15 15:02:11] [INFO ] Deduced a trap composed of 591 places in 597 ms of which 1 ms to minimize.
[2023-03-15 15:02:12] [INFO ] Deduced a trap composed of 621 places in 577 ms of which 1 ms to minimize.
[2023-03-15 15:02:12] [INFO ] Deduced a trap composed of 615 places in 603 ms of which 1 ms to minimize.
[2023-03-15 15:02:13] [INFO ] Deduced a trap composed of 594 places in 608 ms of which 1 ms to minimize.
[2023-03-15 15:02:14] [INFO ] Deduced a trap composed of 594 places in 586 ms of which 1 ms to minimize.
[2023-03-15 15:02:15] [INFO ] Deduced a trap composed of 600 places in 586 ms of which 1 ms to minimize.
[2023-03-15 15:02:15] [INFO ] Deduced a trap composed of 609 places in 589 ms of which 1 ms to minimize.
[2023-03-15 15:02:16] [INFO ] Deduced a trap composed of 591 places in 590 ms of which 1 ms to minimize.
[2023-03-15 15:02:17] [INFO ] Deduced a trap composed of 603 places in 600 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 15:02:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 15:02:17] [INFO ] After 25127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 1431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 67 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1431/1431 places, 2602/2602 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 68 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2023-03-15 15:02:17] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 15:02:17] [INFO ] Invariant cache hit.
[2023-03-15 15:02:18] [INFO ] Implicit Places using invariants in 1397 ms returned []
[2023-03-15 15:02:18] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 15:02:18] [INFO ] Invariant cache hit.
[2023-03-15 15:02:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:02:28] [INFO ] Implicit Places using invariants and state equation in 10186 ms returned []
Implicit Place search using SMT with State Equation took 11584 ms to find 0 implicit places.
[2023-03-15 15:02:28] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-15 15:02:28] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 15:02:28] [INFO ] Invariant cache hit.
[2023-03-15 15:02:30] [INFO ] Dead Transitions using invariants and state equation in 1371 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13084 ms. Remains : 1431/1431 places, 2602/2602 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1431 transition count 2593
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 1431 transition count 2592
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 1430 transition count 2592
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1430 transition count 2591
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1429 transition count 2591
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1429 transition count 2581
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 1419 transition count 2581
Applied a total of 33 rules in 243 ms. Remains 1419 /1431 variables (removed 12) and now considering 2581/2602 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2581 rows 1419 cols
[2023-03-15 15:02:30] [INFO ] Computed 182 place invariants in 57 ms
[2023-03-15 15:02:30] [INFO ] [Real]Absence check using 175 positive place invariants in 42 ms returned sat
[2023-03-15 15:02:30] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-15 15:02:31] [INFO ] After 1185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 15:02:31] [INFO ] [Nat]Absence check using 175 positive place invariants in 52 ms returned sat
[2023-03-15 15:02:31] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-15 15:02:33] [INFO ] After 1055ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 15:02:33] [INFO ] Deduced a trap composed of 589 places in 594 ms of which 1 ms to minimize.
[2023-03-15 15:02:34] [INFO ] Deduced a trap composed of 592 places in 556 ms of which 1 ms to minimize.
[2023-03-15 15:02:35] [INFO ] Deduced a trap composed of 616 places in 556 ms of which 1 ms to minimize.
[2023-03-15 15:02:35] [INFO ] Deduced a trap composed of 604 places in 553 ms of which 1 ms to minimize.
[2023-03-15 15:02:36] [INFO ] Deduced a trap composed of 616 places in 551 ms of which 2 ms to minimize.
[2023-03-15 15:02:37] [INFO ] Deduced a trap composed of 601 places in 557 ms of which 2 ms to minimize.
[2023-03-15 15:02:37] [INFO ] Deduced a trap composed of 601 places in 555 ms of which 2 ms to minimize.
[2023-03-15 15:02:38] [INFO ] Deduced a trap composed of 592 places in 549 ms of which 2 ms to minimize.
[2023-03-15 15:02:39] [INFO ] Deduced a trap composed of 595 places in 564 ms of which 1 ms to minimize.
[2023-03-15 15:02:39] [INFO ] Deduced a trap composed of 598 places in 560 ms of which 1 ms to minimize.
[2023-03-15 15:02:40] [INFO ] Deduced a trap composed of 619 places in 543 ms of which 1 ms to minimize.
[2023-03-15 15:02:40] [INFO ] Deduced a trap composed of 607 places in 553 ms of which 1 ms to minimize.
[2023-03-15 15:02:41] [INFO ] Deduced a trap composed of 589 places in 539 ms of which 1 ms to minimize.
[2023-03-15 15:02:42] [INFO ] Deduced a trap composed of 601 places in 549 ms of which 2 ms to minimize.
[2023-03-15 15:02:42] [INFO ] Deduced a trap composed of 592 places in 578 ms of which 1 ms to minimize.
[2023-03-15 15:02:43] [INFO ] Deduced a trap composed of 595 places in 550 ms of which 1 ms to minimize.
[2023-03-15 15:02:44] [INFO ] Deduced a trap composed of 598 places in 565 ms of which 1 ms to minimize.
[2023-03-15 15:02:44] [INFO ] Deduced a trap composed of 592 places in 568 ms of which 1 ms to minimize.
[2023-03-15 15:02:45] [INFO ] Deduced a trap composed of 613 places in 568 ms of which 1 ms to minimize.
[2023-03-15 15:02:45] [INFO ] Deduced a trap composed of 607 places in 548 ms of which 1 ms to minimize.
[2023-03-15 15:02:46] [INFO ] Deduced a trap composed of 589 places in 553 ms of which 1 ms to minimize.
[2023-03-15 15:02:47] [INFO ] Deduced a trap composed of 592 places in 563 ms of which 1 ms to minimize.
[2023-03-15 15:02:47] [INFO ] Deduced a trap composed of 610 places in 553 ms of which 1 ms to minimize.
[2023-03-15 15:02:48] [INFO ] Deduced a trap composed of 601 places in 553 ms of which 1 ms to minimize.
[2023-03-15 15:02:49] [INFO ] Deduced a trap composed of 604 places in 556 ms of which 1 ms to minimize.
[2023-03-15 15:02:49] [INFO ] Deduced a trap composed of 592 places in 567 ms of which 1 ms to minimize.
[2023-03-15 15:02:50] [INFO ] Deduced a trap composed of 592 places in 554 ms of which 1 ms to minimize.
[2023-03-15 15:02:51] [INFO ] Deduced a trap composed of 598 places in 564 ms of which 1 ms to minimize.
[2023-03-15 15:02:51] [INFO ] Deduced a trap composed of 583 places in 559 ms of which 1 ms to minimize.
[2023-03-15 15:02:52] [INFO ] Deduced a trap composed of 592 places in 553 ms of which 1 ms to minimize.
[2023-03-15 15:02:52] [INFO ] Deduced a trap composed of 598 places in 561 ms of which 1 ms to minimize.
[2023-03-15 15:02:53] [INFO ] Deduced a trap composed of 607 places in 550 ms of which 1 ms to minimize.
[2023-03-15 15:02:54] [INFO ] Deduced a trap composed of 607 places in 551 ms of which 1 ms to minimize.
[2023-03-15 15:02:54] [INFO ] Deduced a trap composed of 613 places in 570 ms of which 2 ms to minimize.
[2023-03-15 15:02:55] [INFO ] Deduced a trap composed of 613 places in 546 ms of which 1 ms to minimize.
[2023-03-15 15:02:56] [INFO ] Deduced a trap composed of 592 places in 562 ms of which 1 ms to minimize.
[2023-03-15 15:02:56] [INFO ] Deduced a trap composed of 607 places in 574 ms of which 1 ms to minimize.
[2023-03-15 15:02:57] [INFO ] Deduced a trap composed of 601 places in 557 ms of which 1 ms to minimize.
[2023-03-15 15:02:58] [INFO ] Deduced a trap composed of 625 places in 552 ms of which 1 ms to minimize.
[2023-03-15 15:02:58] [INFO ] Deduced a trap composed of 577 places in 565 ms of which 1 ms to minimize.
[2023-03-15 15:02:59] [INFO ] Deduced a trap composed of 589 places in 556 ms of which 1 ms to minimize.
[2023-03-15 15:02:59] [INFO ] Deduced a trap composed of 601 places in 560 ms of which 1 ms to minimize.
[2023-03-15 15:03:00] [INFO ] Deduced a trap composed of 601 places in 562 ms of which 1 ms to minimize.
[2023-03-15 15:03:01] [INFO ] Deduced a trap composed of 610 places in 566 ms of which 1 ms to minimize.
[2023-03-15 15:03:01] [INFO ] Deduced a trap composed of 610 places in 549 ms of which 1 ms to minimize.
[2023-03-15 15:03:02] [INFO ] Deduced a trap composed of 598 places in 583 ms of which 1 ms to minimize.
[2023-03-15 15:03:03] [INFO ] Deduced a trap composed of 586 places in 551 ms of which 1 ms to minimize.
[2023-03-15 15:03:03] [INFO ] Deduced a trap composed of 598 places in 561 ms of which 1 ms to minimize.
[2023-03-15 15:03:04] [INFO ] Deduced a trap composed of 619 places in 553 ms of which 1 ms to minimize.
[2023-03-15 15:03:05] [INFO ] Deduced a trap composed of 604 places in 558 ms of which 1 ms to minimize.
[2023-03-15 15:03:05] [INFO ] Deduced a trap composed of 604 places in 544 ms of which 1 ms to minimize.
[2023-03-15 15:03:06] [INFO ] Deduced a trap composed of 601 places in 562 ms of which 1 ms to minimize.
[2023-03-15 15:03:07] [INFO ] Deduced a trap composed of 622 places in 544 ms of which 1 ms to minimize.
[2023-03-15 15:03:07] [INFO ] Deduced a trap composed of 610 places in 559 ms of which 1 ms to minimize.
[2023-03-15 15:03:08] [INFO ] Deduced a trap composed of 613 places in 552 ms of which 1 ms to minimize.
[2023-03-15 15:03:08] [INFO ] Deduced a trap composed of 604 places in 559 ms of which 1 ms to minimize.
[2023-03-15 15:03:09] [INFO ] Deduced a trap composed of 598 places in 541 ms of which 1 ms to minimize.
[2023-03-15 15:03:10] [INFO ] Deduced a trap composed of 598 places in 539 ms of which 1 ms to minimize.
[2023-03-15 15:03:10] [INFO ] Deduced a trap composed of 616 places in 565 ms of which 1 ms to minimize.
[2023-03-15 15:03:11] [INFO ] Deduced a trap composed of 598 places in 548 ms of which 1 ms to minimize.
[2023-03-15 15:03:12] [INFO ] Deduced a trap composed of 601 places in 549 ms of which 1 ms to minimize.
[2023-03-15 15:03:12] [INFO ] Deduced a trap composed of 601 places in 548 ms of which 1 ms to minimize.
[2023-03-15 15:03:13] [INFO ] Deduced a trap composed of 592 places in 550 ms of which 2 ms to minimize.
[2023-03-15 15:03:14] [INFO ] Deduced a trap composed of 613 places in 547 ms of which 1 ms to minimize.
[2023-03-15 15:03:14] [INFO ] Deduced a trap composed of 598 places in 552 ms of which 1 ms to minimize.
[2023-03-15 15:03:15] [INFO ] Deduced a trap composed of 580 places in 554 ms of which 1 ms to minimize.
[2023-03-15 15:03:15] [INFO ] Deduced a trap composed of 604 places in 554 ms of which 1 ms to minimize.
[2023-03-15 15:03:16] [INFO ] Deduced a trap composed of 595 places in 559 ms of which 1 ms to minimize.
[2023-03-15 15:03:17] [INFO ] Deduced a trap composed of 595 places in 558 ms of which 1 ms to minimize.
[2023-03-15 15:03:17] [INFO ] Deduced a trap composed of 613 places in 552 ms of which 1 ms to minimize.
[2023-03-15 15:03:18] [INFO ] Deduced a trap composed of 601 places in 549 ms of which 1 ms to minimize.
[2023-03-15 15:03:19] [INFO ] Deduced a trap composed of 601 places in 558 ms of which 1 ms to minimize.
[2023-03-15 15:03:19] [INFO ] Deduced a trap composed of 613 places in 552 ms of which 1 ms to minimize.
[2023-03-15 15:03:20] [INFO ] Deduced a trap composed of 580 places in 557 ms of which 1 ms to minimize.
[2023-03-15 15:03:21] [INFO ] Deduced a trap composed of 595 places in 559 ms of which 1 ms to minimize.
[2023-03-15 15:03:21] [INFO ] Deduced a trap composed of 613 places in 549 ms of which 1 ms to minimize.
[2023-03-15 15:03:22] [INFO ] Deduced a trap composed of 601 places in 551 ms of which 1 ms to minimize.
[2023-03-15 15:03:22] [INFO ] Deduced a trap composed of 595 places in 551 ms of which 1 ms to minimize.
[2023-03-15 15:03:23] [INFO ] Deduced a trap composed of 613 places in 554 ms of which 1 ms to minimize.
[2023-03-15 15:03:24] [INFO ] Deduced a trap composed of 604 places in 550 ms of which 1 ms to minimize.
[2023-03-15 15:03:24] [INFO ] Deduced a trap composed of 610 places in 561 ms of which 1 ms to minimize.
[2023-03-15 15:03:25] [INFO ] Deduced a trap composed of 598 places in 552 ms of which 2 ms to minimize.
[2023-03-15 15:03:26] [INFO ] Deduced a trap composed of 604 places in 548 ms of which 1 ms to minimize.
[2023-03-15 15:03:26] [INFO ] Deduced a trap composed of 607 places in 549 ms of which 1 ms to minimize.
[2023-03-15 15:03:27] [INFO ] Deduced a trap composed of 604 places in 543 ms of which 1 ms to minimize.
[2023-03-15 15:03:27] [INFO ] Deduced a trap composed of 598 places in 552 ms of which 1 ms to minimize.
[2023-03-15 15:03:28] [INFO ] Deduced a trap composed of 592 places in 540 ms of which 1 ms to minimize.
[2023-03-15 15:03:29] [INFO ] Deduced a trap composed of 592 places in 565 ms of which 1 ms to minimize.
[2023-03-15 15:03:29] [INFO ] Deduced a trap composed of 586 places in 549 ms of which 1 ms to minimize.
[2023-03-15 15:03:30] [INFO ] Deduced a trap composed of 598 places in 542 ms of which 2 ms to minimize.
[2023-03-15 15:03:31] [INFO ] Deduced a trap composed of 598 places in 536 ms of which 1 ms to minimize.
[2023-03-15 15:03:31] [INFO ] Deduced a trap composed of 610 places in 552 ms of which 2 ms to minimize.
[2023-03-15 15:03:32] [INFO ] Deduced a trap composed of 613 places in 546 ms of which 1 ms to minimize.
[2023-03-15 15:03:33] [INFO ] Deduced a trap composed of 589 places in 551 ms of which 1 ms to minimize.
[2023-03-15 15:03:33] [INFO ] Deduced a trap composed of 601 places in 556 ms of which 1 ms to minimize.
[2023-03-15 15:03:34] [INFO ] Deduced a trap composed of 595 places in 556 ms of which 1 ms to minimize.
[2023-03-15 15:03:34] [INFO ] Deduced a trap composed of 610 places in 547 ms of which 1 ms to minimize.
[2023-03-15 15:03:35] [INFO ] Deduced a trap composed of 604 places in 555 ms of which 1 ms to minimize.
[2023-03-15 15:03:36] [INFO ] Deduced a trap composed of 604 places in 547 ms of which 1 ms to minimize.
[2023-03-15 15:03:36] [INFO ] Deduced a trap composed of 610 places in 548 ms of which 1 ms to minimize.
[2023-03-15 15:03:37] [INFO ] Deduced a trap composed of 601 places in 594 ms of which 1 ms to minimize.
[2023-03-15 15:03:38] [INFO ] Deduced a trap composed of 589 places in 603 ms of which 1 ms to minimize.
[2023-03-15 15:03:38] [INFO ] Deduced a trap composed of 604 places in 609 ms of which 1 ms to minimize.
[2023-03-15 15:03:40] [INFO ] Deduced a trap composed of 592 places in 549 ms of which 1 ms to minimize.
[2023-03-15 15:03:41] [INFO ] Deduced a trap composed of 583 places in 561 ms of which 1 ms to minimize.
[2023-03-15 15:03:41] [INFO ] Deduced a trap composed of 592 places in 536 ms of which 2 ms to minimize.
[2023-03-15 15:03:42] [INFO ] Deduced a trap composed of 598 places in 546 ms of which 1 ms to minimize.
[2023-03-15 15:03:43] [INFO ] Deduced a trap composed of 601 places in 545 ms of which 1 ms to minimize.
[2023-03-15 15:03:43] [INFO ] Deduced a trap composed of 595 places in 545 ms of which 2 ms to minimize.
[2023-03-15 15:03:44] [INFO ] Deduced a trap composed of 607 places in 556 ms of which 2 ms to minimize.
[2023-03-15 15:03:46] [INFO ] Deduced a trap composed of 601 places in 541 ms of which 1 ms to minimize.
[2023-03-15 15:03:55] [INFO ] Deduced a trap composed of 622 places in 564 ms of which 1 ms to minimize.
[2023-03-15 15:03:56] [INFO ] Deduced a trap composed of 583 places in 541 ms of which 2 ms to minimize.
[2023-03-15 15:03:57] [INFO ] Deduced a trap composed of 619 places in 549 ms of which 1 ms to minimize.
[2023-03-15 15:03:57] [INFO ] Deduced a trap composed of 610 places in 545 ms of which 1 ms to minimize.
[2023-03-15 15:03:58] [INFO ] Deduced a trap composed of 610 places in 551 ms of which 1 ms to minimize.
[2023-03-15 15:03:58] [INFO ] Deduced a trap composed of 604 places in 564 ms of which 2 ms to minimize.
[2023-03-15 15:03:59] [INFO ] Deduced a trap composed of 595 places in 547 ms of which 1 ms to minimize.
[2023-03-15 15:06:16] [INFO ] Trap strengthening (SAT) tested/added 118/118 trap constraints in 223428 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 15:06:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 15:06:16] [INFO ] After 225023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7952 reset in 1092 ms.
Product exploration explored 100000 steps with 7957 reset in 1130 ms.
Support contains 3 out of 1431 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 58 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2023-03-15 15:06:19] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2023-03-15 15:06:19] [INFO ] Computed 182 place invariants in 58 ms
[2023-03-15 15:06:20] [INFO ] Dead Transitions using invariants and state equation in 1379 ms found 0 transitions.
[2023-03-15 15:06:20] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 15:06:20] [INFO ] Invariant cache hit.
[2023-03-15 15:06:22] [INFO ] Implicit Places using invariants in 1422 ms returned []
[2023-03-15 15:06:22] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 15:06:22] [INFO ] Invariant cache hit.
[2023-03-15 15:06:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:06:33] [INFO ] Implicit Places using invariants and state equation in 11509 ms returned []
Implicit Place search using SMT with State Equation took 12932 ms to find 0 implicit places.
[2023-03-15 15:06:33] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-15 15:06:33] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-15 15:06:33] [INFO ] Invariant cache hit.
[2023-03-15 15:06:35] [INFO ] Dead Transitions using invariants and state equation in 1359 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15789 ms. Remains : 1431/1431 places, 2602/2602 transitions.
Treatment of property PolyORBNT-COL-S10J80-LTLCardinality-02 finished in 644542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 13 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 84 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-15 15:06:35] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2023-03-15 15:06:35] [INFO ] Computed 182 place invariants in 67 ms
[2023-03-15 15:06:37] [INFO ] Dead Transitions using invariants and state equation in 2295 ms found 0 transitions.
[2023-03-15 15:06:37] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 15:06:37] [INFO ] Invariant cache hit.
[2023-03-15 15:06:39] [INFO ] Implicit Places using invariants in 1429 ms returned []
[2023-03-15 15:06:39] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 15:06:39] [INFO ] Invariant cache hit.
[2023-03-15 15:06:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:06:49] [INFO ] Implicit Places using invariants and state equation in 10458 ms returned []
Implicit Place search using SMT with State Equation took 11889 ms to find 0 implicit places.
[2023-03-15 15:06:49] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 15:06:49] [INFO ] Invariant cache hit.
[2023-03-15 15:06:51] [INFO ] Dead Transitions using invariants and state equation in 2293 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16563 ms. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ s502 s499), p0:(LEQ s1602 (ADD s1420 s1421 s1422 s1423 s1424 s1425 s1426 s1427 s1428 s1429))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5598 reset in 811 ms.
Product exploration explored 100000 steps with 5598 reset in 857 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 346 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 560 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 15:06:54] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 15:06:54] [INFO ] Invariant cache hit.
[2023-03-15 15:06:54] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 15:06:54] [INFO ] [Nat]Absence check using 176 positive place invariants in 51 ms returned sat
[2023-03-15 15:06:54] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 37 ms returned sat
[2023-03-15 15:07:04] [INFO ] After 9280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 15:07:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:07:05] [INFO ] After 1325ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 15:07:06] [INFO ] After 2357ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1596 ms.
[2023-03-15 15:07:08] [INFO ] After 13546ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 13 out of 1603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1603/1603 places, 2774/2774 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 1603 transition count 2692
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 164 place count 1521 transition count 2692
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 164 place count 1521 transition count 2607
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 334 place count 1436 transition count 2607
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 338 place count 1434 transition count 2605
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 339 place count 1434 transition count 2604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 340 place count 1433 transition count 2604
Applied a total of 340 rules in 332 ms. Remains 1433 /1603 variables (removed 170) and now considering 2604/2774 (removed 170) transitions.
[2023-03-15 15:07:08] [INFO ] Flow matrix only has 2595 transitions (discarded 9 similar events)
// Phase 1: matrix 2595 rows 1433 cols
[2023-03-15 15:07:08] [INFO ] Computed 182 place invariants in 66 ms
[2023-03-15 15:07:10] [INFO ] Dead Transitions using invariants and state equation in 1488 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1821 ms. Remains : 1433/1603 places, 2604/2774 transitions.
Finished random walk after 336 steps, including 21 resets, run visited all 2 properties in 7 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 413 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1), true]
Support contains 13 out of 1603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1603/1603 places, 2774/2774 transitions.
Applied a total of 0 rules in 50 ms. Remains 1603 /1603 variables (removed 0) and now considering 2774/2774 (removed 0) transitions.
[2023-03-15 15:07:10] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2023-03-15 15:07:10] [INFO ] Computed 182 place invariants in 56 ms
[2023-03-15 15:07:12] [INFO ] Dead Transitions using invariants and state equation in 2298 ms found 0 transitions.
[2023-03-15 15:07:12] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 15:07:12] [INFO ] Invariant cache hit.
[2023-03-15 15:07:14] [INFO ] Implicit Places using invariants in 1423 ms returned []
[2023-03-15 15:07:14] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 15:07:14] [INFO ] Invariant cache hit.
[2023-03-15 15:07:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:07:31] [INFO ] Implicit Places using invariants and state equation in 16815 ms returned []
Implicit Place search using SMT with State Equation took 18240 ms to find 0 implicit places.
[2023-03-15 15:07:31] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 15:07:31] [INFO ] Invariant cache hit.
[2023-03-15 15:07:33] [INFO ] Dead Transitions using invariants and state equation in 2169 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22759 ms. Remains : 1603/1603 places, 2774/2774 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 319 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 560 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 15:07:34] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 15:07:34] [INFO ] Invariant cache hit.
[2023-03-15 15:07:34] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 15:07:34] [INFO ] [Nat]Absence check using 176 positive place invariants in 50 ms returned sat
[2023-03-15 15:07:34] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 36 ms returned sat
[2023-03-15 15:07:43] [INFO ] After 9334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 15:07:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:07:45] [INFO ] After 1320ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 15:07:46] [INFO ] After 2343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1589 ms.
[2023-03-15 15:07:47] [INFO ] After 13579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 13 out of 1603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1603/1603 places, 2774/2774 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 1603 transition count 2692
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 164 place count 1521 transition count 2692
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 164 place count 1521 transition count 2607
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 334 place count 1436 transition count 2607
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 338 place count 1434 transition count 2605
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 339 place count 1434 transition count 2604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 340 place count 1433 transition count 2604
Applied a total of 340 rules in 205 ms. Remains 1433 /1603 variables (removed 170) and now considering 2604/2774 (removed 170) transitions.
[2023-03-15 15:07:48] [INFO ] Flow matrix only has 2595 transitions (discarded 9 similar events)
// Phase 1: matrix 2595 rows 1433 cols
[2023-03-15 15:07:48] [INFO ] Computed 182 place invariants in 60 ms
[2023-03-15 15:07:49] [INFO ] Dead Transitions using invariants and state equation in 1491 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1699 ms. Remains : 1433/1603 places, 2604/2774 transitions.
Finished random walk after 2051 steps, including 141 resets, run visited all 2 properties in 44 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 368 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 5603 reset in 805 ms.
Product exploration explored 100000 steps with 5601 reset in 841 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1), true]
Support contains 13 out of 1603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1603/1603 places, 2774/2774 transitions.
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 1603 transition count 2774
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 82 place count 1603 transition count 2775
Deduced a syphon composed of 84 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 1603 transition count 2775
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 169 places in 0 ms
Iterating global reduction 1 with 85 rules applied. Total rules applied 169 place count 1603 transition count 2775
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 252 place count 1520 transition count 2692
Deduced a syphon composed of 86 places in 8 ms
Iterating global reduction 1 with 83 rules applied. Total rules applied 335 place count 1520 transition count 2692
Deduced a syphon composed of 86 places in 1 ms
Applied a total of 335 rules in 463 ms. Remains 1520 /1603 variables (removed 83) and now considering 2692/2774 (removed 82) transitions.
[2023-03-15 15:07:52] [INFO ] Flow matrix only has 2683 transitions (discarded 9 similar events)
// Phase 1: matrix 2683 rows 1520 cols
[2023-03-15 15:07:52] [INFO ] Computed 182 place invariants in 55 ms
[2023-03-15 15:07:55] [INFO ] Dead Transitions using invariants and state equation in 3205 ms found 0 transitions.
[2023-03-15 15:07:55] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-15 15:07:55] [INFO ] Flow matrix only has 2683 transitions (discarded 9 similar events)
[2023-03-15 15:07:55] [INFO ] Invariant cache hit.
[2023-03-15 15:07:59] [INFO ] Dead Transitions using invariants and state equation in 3852 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1520/1603 places, 2692/2774 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7584 ms. Remains : 1520/1603 places, 2692/2774 transitions.
Support contains 13 out of 1603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1603/1603 places, 2774/2774 transitions.
Applied a total of 0 rules in 51 ms. Remains 1603 /1603 variables (removed 0) and now considering 2774/2774 (removed 0) transitions.
[2023-03-15 15:07:59] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2023-03-15 15:07:59] [INFO ] Computed 182 place invariants in 55 ms
[2023-03-15 15:08:01] [INFO ] Dead Transitions using invariants and state equation in 2290 ms found 0 transitions.
[2023-03-15 15:08:01] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 15:08:01] [INFO ] Invariant cache hit.
[2023-03-15 15:08:03] [INFO ] Implicit Places using invariants in 1428 ms returned []
[2023-03-15 15:08:03] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 15:08:03] [INFO ] Invariant cache hit.
[2023-03-15 15:08:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:08:12] [INFO ] Implicit Places using invariants and state equation in 8829 ms returned []
Implicit Place search using SMT with State Equation took 10259 ms to find 0 implicit places.
[2023-03-15 15:08:12] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 15:08:12] [INFO ] Invariant cache hit.
[2023-03-15 15:08:14] [INFO ] Dead Transitions using invariants and state equation in 2234 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14836 ms. Remains : 1603/1603 places, 2774/2774 transitions.
Treatment of property PolyORBNT-COL-S10J80-LTLCardinality-03 finished in 99160 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1604 transition count 2690
Reduce places removed 85 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 86 rules applied. Total rules applied 171 place count 1519 transition count 2689
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 172 place count 1518 transition count 2689
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 172 place count 1518 transition count 2604
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 342 place count 1433 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 343 place count 1432 transition count 2603
Iterating global reduction 3 with 1 rules applied. Total rules applied 344 place count 1432 transition count 2603
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 348 place count 1430 transition count 2601
Applied a total of 348 rules in 195 ms. Remains 1430 /1604 variables (removed 174) and now considering 2601/2775 (removed 174) transitions.
[2023-03-15 15:08:14] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-15 15:08:14] [INFO ] Computed 182 place invariants in 63 ms
[2023-03-15 15:08:16] [INFO ] Dead Transitions using invariants and state equation in 1374 ms found 0 transitions.
[2023-03-15 15:08:16] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 15:08:16] [INFO ] Invariant cache hit.
[2023-03-15 15:08:17] [INFO ] Implicit Places using invariants in 1448 ms returned []
[2023-03-15 15:08:17] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 15:08:17] [INFO ] Invariant cache hit.
[2023-03-15 15:08:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:08:28] [INFO ] Implicit Places using invariants and state equation in 11338 ms returned []
Implicit Place search using SMT with State Equation took 12789 ms to find 0 implicit places.
[2023-03-15 15:08:29] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-15 15:08:29] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 15:08:29] [INFO ] Invariant cache hit.
[2023-03-15 15:08:30] [INFO ] Dead Transitions using invariants and state equation in 1366 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1430/1604 places, 2601/2775 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15783 ms. Remains : 1430/1604 places, 2601/2775 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLCardinality-04 automaton TGBA Formula[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:(GT s1332 s1428)], 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 8 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J80-LTLCardinality-04 finished in 15931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||X(F(!p1)))))'
Support contains 4 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 90 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-15 15:08:30] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2023-03-15 15:08:30] [INFO ] Computed 182 place invariants in 66 ms
[2023-03-15 15:08:32] [INFO ] Dead Transitions using invariants and state equation in 2320 ms found 0 transitions.
[2023-03-15 15:08:32] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 15:08:32] [INFO ] Invariant cache hit.
[2023-03-15 15:08:34] [INFO ] Implicit Places using invariants in 1528 ms returned []
[2023-03-15 15:08:34] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 15:08:34] [INFO ] Invariant cache hit.
[2023-03-15 15:08:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:08:50] [INFO ] Implicit Places using invariants and state equation in 15606 ms returned []
Implicit Place search using SMT with State Equation took 17135 ms to find 0 implicit places.
[2023-03-15 15:08:50] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 15:08:50] [INFO ] Invariant cache hit.
[2023-03-15 15:08:52] [INFO ] Dead Transitions using invariants and state equation in 2298 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21848 ms. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 83 ms :[false, p1, false]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(GT s82 s1602), p0:(GT s503 s502)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 999 ms.
Product exploration explored 100000 steps with 33333 reset in 1027 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J80-LTLCardinality-08 finished in 24052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 88 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-15 15:08:54] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 15:08:54] [INFO ] Invariant cache hit.
[2023-03-15 15:08:56] [INFO ] Dead Transitions using invariants and state equation in 2304 ms found 0 transitions.
[2023-03-15 15:08:56] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 15:08:56] [INFO ] Invariant cache hit.
[2023-03-15 15:08:58] [INFO ] Implicit Places using invariants in 1404 ms returned []
[2023-03-15 15:08:58] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 15:08:58] [INFO ] Invariant cache hit.
[2023-03-15 15:08:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:09:07] [INFO ] Implicit Places using invariants and state equation in 8651 ms returned []
Implicit Place search using SMT with State Equation took 10057 ms to find 0 implicit places.
[2023-03-15 15:09:07] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 15:09:07] [INFO ] Invariant cache hit.
[2023-03-15 15:09:09] [INFO ] Dead Transitions using invariants and state equation in 2206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14663 ms. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s1336)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 PolyORBNT-COL-S10J80-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J80-LTLCardinality-09 finished in 14744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 84 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 97 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-15 15:09:09] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 15:09:09] [INFO ] Invariant cache hit.
[2023-03-15 15:09:11] [INFO ] Dead Transitions using invariants and state equation in 2273 ms found 0 transitions.
[2023-03-15 15:09:11] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 15:09:11] [INFO ] Invariant cache hit.
[2023-03-15 15:09:13] [INFO ] Implicit Places using invariants in 1352 ms returned []
[2023-03-15 15:09:13] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 15:09:13] [INFO ] Invariant cache hit.
[2023-03-15 15:09:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:09:27] [INFO ] Implicit Places using invariants and state equation in 14208 ms returned []
Implicit Place search using SMT with State Equation took 15564 ms to find 0 implicit places.
[2023-03-15 15:09:27] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 15:09:27] [INFO ] Invariant cache hit.
[2023-03-15 15:09:29] [INFO ] Dead Transitions using invariants and state equation in 2317 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20252 ms. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ (ADD s1436 s1437 s1438 s1439 s1440 s1441 s1442 s1443 s1444 s1445 s1446 s1447 s1448 s1449 s1450 s1451 s1452 s1453 s1454 s1455 s1456 s1457 s1458 s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1274 ms.
Product exploration explored 100000 steps with 50000 reset in 1322 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 5 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J80-LTLCardinality-12 finished in 23087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1604 transition count 2691
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 168 place count 1520 transition count 2691
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 168 place count 1520 transition count 2605
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 340 place count 1434 transition count 2605
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 344 place count 1432 transition count 2603
Applied a total of 344 rules in 141 ms. Remains 1432 /1604 variables (removed 172) and now considering 2603/2775 (removed 172) transitions.
[2023-03-15 15:09:32] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
// Phase 1: matrix 2594 rows 1432 cols
[2023-03-15 15:09:32] [INFO ] Computed 182 place invariants in 62 ms
[2023-03-15 15:09:34] [INFO ] Dead Transitions using invariants and state equation in 1493 ms found 0 transitions.
[2023-03-15 15:09:34] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-15 15:09:34] [INFO ] Invariant cache hit.
[2023-03-15 15:09:35] [INFO ] Implicit Places using invariants in 1303 ms returned []
[2023-03-15 15:09:35] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-15 15:09:35] [INFO ] Invariant cache hit.
[2023-03-15 15:09:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:09:45] [INFO ] Implicit Places using invariants and state equation in 9685 ms returned []
Implicit Place search using SMT with State Equation took 10990 ms to find 0 implicit places.
[2023-03-15 15:09:45] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-15 15:09:45] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-15 15:09:45] [INFO ] Invariant cache hit.
[2023-03-15 15:09:46] [INFO ] Dead Transitions using invariants and state equation in 1392 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1432/1604 places, 2603/2775 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14085 ms. Remains : 1432/1604 places, 2603/2775 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s1431)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J80-LTLCardinality-15 finished in 14132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Found a Lengthening insensitive property : PolyORBNT-COL-S10J80-LTLCardinality-03
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1), true]
Support contains 13 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 1604 transition count 2692
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 166 place count 1521 transition count 2692
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 166 place count 1521 transition count 2607
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 336 place count 1436 transition count 2607
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 337 place count 1435 transition count 2606
Iterating global reduction 2 with 1 rules applied. Total rules applied 338 place count 1435 transition count 2606
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 340 place count 1434 transition count 2605
Applied a total of 340 rules in 176 ms. Remains 1434 /1604 variables (removed 170) and now considering 2605/2775 (removed 170) transitions.
[2023-03-15 15:09:46] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
// Phase 1: matrix 2596 rows 1434 cols
[2023-03-15 15:09:46] [INFO ] Computed 182 place invariants in 57 ms
[2023-03-15 15:09:48] [INFO ] Dead Transitions using invariants and state equation in 1410 ms found 0 transitions.
[2023-03-15 15:09:48] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-15 15:09:48] [INFO ] Invariant cache hit.
[2023-03-15 15:09:49] [INFO ] Implicit Places using invariants in 1077 ms returned []
[2023-03-15 15:09:49] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-15 15:09:49] [INFO ] Invariant cache hit.
[2023-03-15 15:09:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:09:58] [INFO ] Implicit Places using invariants and state equation in 9025 ms returned []
Implicit Place search using SMT with State Equation took 10104 ms to find 0 implicit places.
[2023-03-15 15:09:58] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-15 15:09:58] [INFO ] Invariant cache hit.
[2023-03-15 15:09:59] [INFO ] Dead Transitions using invariants and state equation in 1383 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1434/1604 places, 2605/2775 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 13076 ms. Remains : 1434/1604 places, 2605/2775 transitions.
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ s499 s496), p0:(LEQ s1433 (ADD s1416 s1417 s1418 s1419 s1420 s1421 s1422 s1423 s1424 s1425))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6869 reset in 1162 ms.
Product exploration explored 100000 steps with 6878 reset in 1196 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 322 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1), true]
Finished random walk after 2279 steps, including 157 resets, run visited all 4 properties in 49 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 455 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1), true]
Support contains 13 out of 1434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1434/1434 places, 2605/2605 transitions.
Applied a total of 0 rules in 39 ms. Remains 1434 /1434 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
[2023-03-15 15:10:03] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-15 15:10:03] [INFO ] Invariant cache hit.
[2023-03-15 15:10:04] [INFO ] Dead Transitions using invariants and state equation in 1378 ms found 0 transitions.
[2023-03-15 15:10:04] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-15 15:10:04] [INFO ] Invariant cache hit.
[2023-03-15 15:10:05] [INFO ] Implicit Places using invariants in 1085 ms returned []
[2023-03-15 15:10:05] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-15 15:10:05] [INFO ] Invariant cache hit.
[2023-03-15 15:10:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:10:15] [INFO ] Implicit Places using invariants and state equation in 9887 ms returned []
Implicit Place search using SMT with State Equation took 10973 ms to find 0 implicit places.
[2023-03-15 15:10:15] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-15 15:10:15] [INFO ] Invariant cache hit.
[2023-03-15 15:10:17] [INFO ] Dead Transitions using invariants and state equation in 1356 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13747 ms. Remains : 1434/1434 places, 2605/2605 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 386 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1), true]
Finished random walk after 530 steps, including 35 resets, run visited all 4 properties in 11 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 389 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 6857 reset in 1182 ms.
Product exploration explored 100000 steps with 6865 reset in 1219 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1), true]
Support contains 13 out of 1434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1434/1434 places, 2605/2605 transitions.
Applied a total of 0 rules in 62 ms. Remains 1434 /1434 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
[2023-03-15 15:10:20] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-15 15:10:20] [INFO ] Invariant cache hit.
[2023-03-15 15:10:22] [INFO ] Dead Transitions using invariants and state equation in 1366 ms found 0 transitions.
[2023-03-15 15:10:22] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-15 15:10:22] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-15 15:10:22] [INFO ] Invariant cache hit.
[2023-03-15 15:10:23] [INFO ] Dead Transitions using invariants and state equation in 1380 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2864 ms. Remains : 1434/1434 places, 2605/2605 transitions.
Support contains 13 out of 1434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1434/1434 places, 2605/2605 transitions.
Applied a total of 0 rules in 32 ms. Remains 1434 /1434 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
[2023-03-15 15:10:23] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-15 15:10:23] [INFO ] Invariant cache hit.
[2023-03-15 15:10:25] [INFO ] Dead Transitions using invariants and state equation in 1355 ms found 0 transitions.
[2023-03-15 15:10:25] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-15 15:10:25] [INFO ] Invariant cache hit.
[2023-03-15 15:10:26] [INFO ] Implicit Places using invariants in 1073 ms returned []
[2023-03-15 15:10:26] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-15 15:10:26] [INFO ] Invariant cache hit.
[2023-03-15 15:10:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:10:33] [INFO ] Implicit Places using invariants and state equation in 7771 ms returned []
Implicit Place search using SMT with State Equation took 8845 ms to find 0 implicit places.
[2023-03-15 15:10:33] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-15 15:10:33] [INFO ] Invariant cache hit.
[2023-03-15 15:10:35] [INFO ] Dead Transitions using invariants and state equation in 1367 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11601 ms. Remains : 1434/1434 places, 2605/2605 transitions.
Treatment of property PolyORBNT-COL-S10J80-LTLCardinality-03 finished in 48746 ms.
[2023-03-15 15:10:35] [INFO ] Flatten gal took : 130 ms
[2023-03-15 15:10:35] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-15 15:10:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1604 places, 2775 transitions and 14764 arcs took 34 ms.
Total runtime 918187 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBNT-COL-S10J80
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

BK_STOP 1678893211824

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 PolyORBNT-COL-S10J80-LTLCardinality-02
lola: time limit : 1799 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/1799 2/32 PolyORBNT-COL-S10J80-LTLCardinality-02 96261 m, 19252 m/sec, 267873 t fired, .

Time elapsed: 5 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/1799 4/32 PolyORBNT-COL-S10J80-LTLCardinality-02 198559 m, 20459 m/sec, 552152 t fired, .

Time elapsed: 10 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/1799 5/32 PolyORBNT-COL-S10J80-LTLCardinality-02 294509 m, 19190 m/sec, 819377 t fired, .

Time elapsed: 15 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/1799 6/32 PolyORBNT-COL-S10J80-LTLCardinality-02 378309 m, 16760 m/sec, 1251858 t fired, .

Time elapsed: 20 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/1799 8/32 PolyORBNT-COL-S10J80-LTLCardinality-02 493446 m, 23027 m/sec, 1864715 t fired, .

Time elapsed: 25 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/1799 10/32 PolyORBNT-COL-S10J80-LTLCardinality-02 623063 m, 25923 m/sec, 2438788 t fired, .

Time elapsed: 30 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 34/1799 11/32 PolyORBNT-COL-S10J80-LTLCardinality-02 728082 m, 21003 m/sec, 2848579 t fired, .

Time elapsed: 35 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 39/1799 11/32 PolyORBNT-COL-S10J80-LTLCardinality-02 806989 m, 15781 m/sec, 3097381 t fired, .

Time elapsed: 40 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 44/1799 12/32 PolyORBNT-COL-S10J80-LTLCardinality-02 909293 m, 20460 m/sec, 3690912 t fired, .

Time elapsed: 45 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 49/1799 12/32 PolyORBNT-COL-S10J80-LTLCardinality-02 1019435 m, 22028 m/sec, 4257938 t fired, .

Time elapsed: 50 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 54/1799 13/32 PolyORBNT-COL-S10J80-LTLCardinality-02 1107353 m, 17583 m/sec, 4631020 t fired, .

Time elapsed: 55 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 59/1799 15/32 PolyORBNT-COL-S10J80-LTLCardinality-02 1196238 m, 17777 m/sec, 4849457 t fired, .

Time elapsed: 60 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 64/1799 16/32 PolyORBNT-COL-S10J80-LTLCardinality-02 1283914 m, 17535 m/sec, 5066680 t fired, .

Time elapsed: 65 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 69/1799 17/32 PolyORBNT-COL-S10J80-LTLCardinality-02 1372104 m, 17638 m/sec, 5283949 t fired, .

Time elapsed: 70 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 74/1799 18/32 PolyORBNT-COL-S10J80-LTLCardinality-02 1460690 m, 17717 m/sec, 5502242 t fired, .

Time elapsed: 75 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 79/1799 19/32 PolyORBNT-COL-S10J80-LTLCardinality-02 1551596 m, 18181 m/sec, 5727033 t fired, .

Time elapsed: 80 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 84/1799 21/32 PolyORBNT-COL-S10J80-LTLCardinality-02 1643410 m, 18362 m/sec, 5955027 t fired, .

Time elapsed: 85 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 89/1799 22/32 PolyORBNT-COL-S10J80-LTLCardinality-02 1736483 m, 18614 m/sec, 6184187 t fired, .

Time elapsed: 90 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 94/1799 23/32 PolyORBNT-COL-S10J80-LTLCardinality-02 1811451 m, 14993 m/sec, 6471183 t fired, .

Time elapsed: 95 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 99/1799 23/32 PolyORBNT-COL-S10J80-LTLCardinality-02 1883992 m, 14508 m/sec, 6867773 t fired, .

Time elapsed: 100 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 104/1799 24/32 PolyORBNT-COL-S10J80-LTLCardinality-02 1973163 m, 17834 m/sec, 7266549 t fired, .

Time elapsed: 105 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 109/1799 25/32 PolyORBNT-COL-S10J80-LTLCardinality-02 2062502 m, 17867 m/sec, 7667276 t fired, .

Time elapsed: 110 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 114/1799 26/32 PolyORBNT-COL-S10J80-LTLCardinality-02 2150301 m, 17559 m/sec, 8058699 t fired, .

Time elapsed: 115 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 119/1799 27/32 PolyORBNT-COL-S10J80-LTLCardinality-02 2236658 m, 17271 m/sec, 8447152 t fired, .

Time elapsed: 120 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 124/1799 28/32 PolyORBNT-COL-S10J80-LTLCardinality-02 2322256 m, 17119 m/sec, 8832514 t fired, .

Time elapsed: 125 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 129/1799 29/32 PolyORBNT-COL-S10J80-LTLCardinality-02 2407911 m, 17131 m/sec, 9216625 t fired, .

Time elapsed: 130 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 134/1799 30/32 PolyORBNT-COL-S10J80-LTLCardinality-02 2489784 m, 16374 m/sec, 9580620 t fired, .

Time elapsed: 135 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 139/1799 30/32 PolyORBNT-COL-S10J80-LTLCardinality-02 2566884 m, 15420 m/sec, 10016764 t fired, .

Time elapsed: 140 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for PolyORBNT-COL-S10J80-LTLCardinality-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 145 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 PolyORBNT-COL-S10J80-LTLCardinality-03
lola: time limit : 3455 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3455 6/32 PolyORBNT-COL-S10J80-LTLCardinality-03 207687 m, 41537 m/sec, 522165 t fired, .

Time elapsed: 150 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3455 12/32 PolyORBNT-COL-S10J80-LTLCardinality-03 433221 m, 45106 m/sec, 1013576 t fired, .

Time elapsed: 155 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3455 17/32 PolyORBNT-COL-S10J80-LTLCardinality-03 624292 m, 38214 m/sec, 1516472 t fired, .

Time elapsed: 160 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3455 22/32 PolyORBNT-COL-S10J80-LTLCardinality-03 825146 m, 40170 m/sec, 2021975 t fired, .

Time elapsed: 165 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3455 27/32 PolyORBNT-COL-S10J80-LTLCardinality-03 1008119 m, 36594 m/sec, 2510814 t fired, .

Time elapsed: 170 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for PolyORBNT-COL-S10J80-LTLCardinality-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 175 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S10J80-LTLCardinality-02: LTL unknown AGGR
PolyORBNT-COL-S10J80-LTLCardinality-03: LTL unknown AGGR


Time elapsed: 175 secs. Pages in use: 32

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="PolyORBNT-COL-S10J80"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is PolyORBNT-COL-S10J80, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r295-tall-167873948300707"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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